Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.

Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Handbook of Computational Geometry CrossRef

Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.

Aurenhammer, Franz; Klein, Rolf
Handbook of Computational Geometry : 201-290 – Jan 1, 2000
Download PDF

Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.

Aurenhammer, Franz; Klein, Rolf
Handbook of Computational Geometry : 201-290 – Jan 1, 2000

Loading next page...
 
/lp/crossref/voronoi-diagrams-partially-supported-by-the-deutsche-FVCtmvTlX4

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
DOI
10.1016/b978-044482537-7/50006-1
Publisher site
See Article on Publisher Site

Abstract

Journal

Handbook of Computational Geometry – CrossRef

Published: Jan 1, 2000

References

  • Voronoi diagrams and containment of families of convex sets on the plane
    Abellanas
  • Constructing levels in arrangements and higher order Voronoi diagrams
    Agarwal
  • Euclidean minimum spanning trees and bichromatic closest pairs
    Agarwal
  • A linear-time algorithm for computing the Voronoi diagram of a convex polygon
    Aggarwal
  • Solving query retrieval problems by compacting Voronoi diagrams
    Aggarwal
  • Finding k points with minimum diameter and related problems
    Aggarwal
  • Dot pattern processing using Voronoi polygons as neighborhoods
    Ahuja
  • A novel type of skeleton for polygons
    Aichholzer
  • Straight skeletons for general polygonal figures
    Aichholzer