Topologically sweeping an arrangement

Journal of Computer and System Sciences

Volumn 38, Issue 1, 1989, Pages 165-194

  Edelsbrunner, Herbert ^a   Guibas, Leonidas J ^b,c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b DEC SRC ^*  (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING--DATA STRUCTURES; MATHEMATICAL TECHNIQUES--GEOMETRY;

COMPUTATIONAL GEOMETRY; CONVEX POLYTOPES; LARGEST CONVEX SUBSETS; LONGEST MONOTONE PATHS; TOPOLOGICAL SWEEPING; VISIBILITY GRAPHS;

COMPUTER PROGRAMMING;

EID: 0024606073     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(89)90038-X     Document Type: Article

References (30)

1. Visibility-polygon search and euclidean shortest paths
2. Computing the largest empty convex subset of a set of points
3. Decomposable searching problems 1. Static to dynamic transformation
4. The power of geometric duality
5. Finding largest convex subsets
6. Optimal point location in a monotone subdivision
7. Constructing arrangements of lines and hyperplanes with appllications
8. Graphics in flatland: A case study
9. A combinatorial problem in geometry
10. On some extremum problems in elementary geometry
11. Constructing belts in two-dimensional arrangements with applications
12. Twenty-two points with No Empty Hexagon
13. On the information theoretic lower bound
14. Fibonacci heaps and their uses in improved network optimization algorithms
15. Arrangements and Spreads
16. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
17. Konvexe-Fünfecke in ebenen Punkmengen
18. Sets with no empty convex 7-gon
19. Proximity and Reachability in the Plane
20. Euclidean shortest paths in the presence of rectilinear barriers
21. Finding the optimal shadow of a convex polytope
22. Plane-sweep algorithms for intersecting geometric figures
23. 2) time