Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » Math Topics » geometry.research.independent

Topic: Constructing a polyhedron given n points in R3.
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Steve Gray

Posts: 103
Registered: 7/6/07
Constructing a polyhedron given n points in R3.
Posted: Jul 18, 2010 5:19 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Given n points in the plane it is easy to construct a simple
(non-self-crossing) n-gon 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

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.