Polygon nesting and robustness

Information Processing Letters

Volumn 35, Issue 1, 1990, Pages 23-32

  Bajaj, Chanderjit L ^a   Dey, Tamal ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

analysis of algorithms; Computational geometry; computer graphics

Indexed keywords

COMPUTER GRAPHICS; MATHEMATICAL TECHNIQUES--GEOMETRY;

COMPUTATIONAL GEOMETRY; POLYGON NESTING; ROBUSTNESS;

COMPUTER PROGRAMMING;

EID: 0025445122     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(90)90169-X     Document Type: Article

References (16)

1. Geometric modeling with algebraic surfaces
2. Robust decompositions of polyhedra
3. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm
4. Recipes for geometry and numerical analysis
5. Topologically sweeping an arrangement
6. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
7. Stable maintenance of point-set triangulations in two dimensions
8. Finite-resolution computational geometry
9. Building robust algorithms from imprecise computations
10. Robust set operations on polyhedral solids
11. On the representation and manipulation of rigid solids
12. Verifiable implementations of geometric algorithms using finite precision arithmetic
13. Consistent calculations for solid modeling
14. A simple method of avoiding numerical errors and degeneracy in Voronoi diagram constructions
15. A solid modeling system free from topological consistency
16. A geometric consistency theorem for a symbolic perturbation theorem for a symbolic perturbation theorem