> Date: Tue, 11 Mar 2003 13:39:17 -0500 > From: RWGRAY <[EMAIL PROTECTED]> > > I was just using the Icosahedron as an example. Could be that the > polyhedron has 120 vertices or more. I don't want to work out by hand which > vertex is connect to which other vertices. I'd like a program to figure > that all out. Could be a mixed (concave/convex) polyhedron. The terrain > correspondence is pretty good, but I know the "terrain" bends around and > closes on itself to form a polyhedron of some kind.
If the polyhedron can be concave, then I don't believe there is any one unique face representation. Think of the vertices of a simple cube with an extra vertex in the interior. I'm don't know offhand how many polyhedrons you could come up with that connected all the vertices, but I'm sure it's more than one. If convex polyhedra are good enough, then there are several ways to compute the convex hull containing all the points. Try doing a Google search on "Convex Hull". -- Mark Hood =========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA3D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
