Improved construction of vertical decompositions of three-dimensional arrangements

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 283-292

  Shaul, Hayim ^a   Halperin, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Arrangements; Exact computation; Geometric software; Vertical decomposition

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DECOMPOSITION;

VERTICAL DECOMPOSITION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0036361483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513437     Document Type: Conference Paper

References (29)

1. Polygon decomposition for efficient construction of Minkowski sums
2. Arrangements
3. On-line zone construction in arrangements of lines in the plane
4. Triangles in space or building (and analyzing) castles in the air
5. Castles in the air revisited
6. Efficient algorithms for line and curve segment intersection using restricted predicates
7. A singly-exponential stratification scheme for real semialgebraic varieties and its applications
8. A randomized algorithm for closest-point queries
9. Vertical decomposition for triangles in 3-space
10. Algorithms in combinatorial geometry
11. The design and implementation of planar maps in CGAL
12. Dynamic trees and dynamic point location
13. Arrangements
14. Robust geometric computing in motion
15. Arrangements and their applications in robotics: Recent developments
16. A perturbation scheme for spherical arrangements with application to molecular modeling
17. Constructing planar cuttings in theory and practice
18. Almost tight upper bounds for vertical decompositions in four dimensions
19. Robust proximity queries: An illustration of degree-driven algorithm design
20. Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes
21. A new technique for analyzing substructures in arrangements of piecewise linear surfaces