A convex hull algorithm for discs, and applications

Computational Geometry: Theory and Applications

Volumn 1, Issue 3, 1992, Pages 171-187

  Rappaport, David ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

convex hull; Discs; minimum spanning circle; transversals; Voronoi diagram

Indexed keywords

EID: 38249015751     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(92)90015-K     Document Type: Article

References (19)

1. The convex hull of random circles
2. Efficient algorithms for common transversals
3. Power diagrams: Properties, algorithms and applications
4. Lower bounds for line stabbing
5. Geometric transforms for fast geometric algorithms
6. A combinatorial problem connected with differential equations
7. Stabbing line segments
8. A sweepline algorithm for Voronoi diagrams
9. Efficient computation of continuous skeletons
10. On the ball spanned by balls
11. Computing the furthest site Voronoi diagram for a set of discs
12. Computational Geometry
13. Closest point problems
14. Intersection and closest-pair problems for a set of planar discs
15. Geometric applications of Davenport-Schinzel sequences
16. On a problem of Davenport and Schinzel
17. Solving geometric problems with the rotating callipers
18. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments