I'm new to computational geometry and advanced mathematics in general here so bear with me. I've spent a decent amount of time attempting to figure out this problem and I just can't find a solution.
My problem is to find the vertices that make up each face of a convex polyhedron. At my disposal are a set of planes, with each plane corresponding to a face. Each plane is derived from exactly three points that I know already exist on the corresponding face.
How do I solve this problem in an efficient manner? Apologies if this isn't in the right section, since it involves both math and computer science.
Best Answer
For the description of a pretty good algorithm see Avis and Fukuda. For an efficient implementation (in any dimension), and much additional discussion and references, see Komei Fukuda's page.