Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm

DOI10.1007/978-3-319-42432-3_66zbMath1434.68611OpenAlexW2489980419MaRDI QIDQ2819272

Mokwon Lee, Kōkichi Sugihara, Deok-Soo Kim

Publication date: 28 September 2016

Published in: Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42432-3_66

zbMATH Keywords

circlerobustnessdiskadditively-weighted Voronoi diagramtopology-oriented algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• CGAL
• BetaConcept
• QTFier

Cites Work

• Unnamed Item
• Unnamed Item
• Towards exact geometric computation
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• On the computational geometry of pocket machining
• Representing the Voronoï diagram of a simple polygon using rational quadratic Bézier curves
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Generalization of Voronoi Diagrams in the Plane
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• On the design of CGAL a computational geometry algorithms library
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
• Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry

This page was built for publication: Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm