On the difficulty of triangulating three-dimensional Nonconvex Polyhedra
- 1 March 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 7 (3) , 227-253
- https://doi.org/10.1007/bf02187840
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Triangulating a simple polygon in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Triangulating a nonconvex polytopeDiscrete & Computational Geometry, 1990
- Robust decompositions of polyhedraPublished by Springer Nature ,1989
- Covering polygons is hardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Triangulating point sets in spaceDiscrete & Computational Geometry, 1987
- Computational GeometryPublished by Springer Nature ,1985
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- Finding simplicial subdivisions of polytopesMathematical Programming, 1981
- Über die Zerlegung von Dreieckspolyedern in TetraederMathematische Annalen, 1928