Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
From MaRDI portal
Publication:628206
Recommendations
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- scientific article; zbMATH DE number 2080266
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
Cited in
(13)- Computing the topology of Voronoï diagrams of parallel half-lines
- A fast straight-skeleton algorithm based on generalized motorcycle graphs
- Divide-and-conquer for Voronoi diagrams revisited
- Automatic piloting in progressive dies using medial axis transform
- TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS
- Near optimal minimal convex hulls of disks
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- Incremental problems in the parameterized complexity setting
- Bold graph drawings
- Exact Voronoi diagram of smooth convex pseudo-circles: general predicates, and implementation for ellipses
This page was built for publication: Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628206)