Strategies for polyhedral surface decomposition: An experimental study
- 1 April 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 7 (5-6) , 327-342
- https://doi.org/10.1016/s0925-7721(96)00024-7
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Visualization of geometric algorithmsIEEE Transactions on Visualization and Computer Graphics, 1995
- Castles in the air revisitedDiscrete & Computational Geometry, 1994
- MESH GENERATION AND OPTIMAL TRIANGULATIONParallel Algorithms, 1992
- Convex Decomposition of Polyhedra and RobustnessSIAM Journal on Computing, 1992
- On the difficulty of triangulating three-dimensional Nonconvex PolyhedraDiscrete & Computational Geometry, 1992
- Triangulating a nonconvex polytopeDiscrete & Computational Geometry, 1990
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal AlgorithmSIAM Journal on Computing, 1984
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980