Given a set of plane equations (inequalities), determine the convex polyhedron bounded by them. Vertices, edges, adjacency, as perhaps a half-edge data structure.
This has probably already been done, but seems messy. What is the asymptotic running time?
No comments :
Post a Comment