Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Constructing a polyhedron given n points in R3.
Posted:
Jul 18, 2010 5:19 PM


Given n points in the plane it is easy to construct a simple (nonselfcrossing) ngon on these points.
Given n points in general position in 0R3, it is always possible to construct a simple polyhedron on these points? If not, give a counterexample. If so, give an algorithm and/or proof.
I do not know the answer to this question, nor whether it's easy or hard, nor do I know where to find information on it.
Steve Gray



