A sweepline algorithm for Euclidean Voronoi diagram of circles
From MaRDI portal
Publication:628153
DOI10.1016/j.cad.2005.11.001zbMath1206.65089OpenAlexW2141968974MaRDI QIDQ628153
Shi-Min Hu, Donguk Kim, Deok-Soo Kim, Li Jin, Lisen Mu
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.2005.11.001
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching ⋮ A competition flow method for computing medial axis transform ⋮ Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities ⋮ An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane ⋮ A dynamic sampling approach towards computing Voronoi diagram of a set of circles ⋮ Near optimal minimal convex hulls of disks ⋮ Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
