All Questions
1 question
8
votes
3
answers
793
views
Efficient topological triangulations of non-convex polyhedra
Does every polyhedron in $\mathbb{R}^3$ with $n$ triangular facets have a topological triangulation with complexity $O(n)$?
Suppose $P$ is a non-convex polyhedron in $\mathbb{R}^3$ with $n$ ...