Voronoi diagrams from convex hulls

Information Processing Letters

Volumn 9, Issue 5, 1979, Pages 223-228

  Brown, Kevin Q ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; computational complexity; computational geometry

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018768186     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(79)90074-7     Document Type: Article

References (25)

1. Divide and conquer for linear expected time
2. Optimal expected-time algorithms for closest-point problems
3. Fast intersection of half-spaces
4. Geometric transforms for fast geometric algorithms
5. An algorithm for convex polytopes
6. Generalized Voronoi diagram in the plane
7. A new convex hull algorithm for planar sets
8. An efficient algorithm for determining the convex hull of a planar set
9. Location of a point in a planar subdivision and its applications
10. ∞) metrics with 2-dimensional storage applications
11. Applications of a separator theorem for planar graphs
12. Convex hulls of finite sets of points in two and three dimensions
13. Finding the intersection of a set of n half-spaces in time O(n log n)
14. Geometric complexity
15. Computational geometry
16. Closest-point problems
17. Statistical methods in algorithm design and analysis
18. Topics in computational geometry