Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

DOI10.1016/j.cad.2008.08.004zbMath1206.65087OpenAlexW2042711481MaRDI QIDQ628206

Martin Held, Stefan Huber

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cad.2008.08.004

zbMATH Keywords

algorithmexperimentsVoronoi diagramimplementationcircular arcsstraight-line segmentscomputation of Voronoi nodestest datatopology-oriented approach

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (9)

A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHS ⋮ TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS ⋮ Automatic piloting in progressive dies using medial axis transform ⋮ Exact Voronoi diagram of smooth convex pseudo-circles: general predicates, and implementation for ellipses ⋮ Bold graph drawings ⋮ Incremental problems in the parameterized complexity setting ⋮ Divide-and-conquer for Voronoi diagrams revisited ⋮ Near optimal minimal convex hulls of disks ⋮ Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks

Uses Software

• VRONI

This page was built for publication: Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments