Assertion: convex polyhedron | /r/HasProperty | triangulated
Facets:
Source sentences:
text: Ruppert & Seidel (1992) used Schönhardt's polyhedron as the basis for a proof that it is NP-complete to determine whether a non-convex polyhedron can be triangulated.