A sweepline algorithm for Euclidean Voronoi diagram of circles
From MaRDI portal
Publication:628153
DOI10.1016/J.CAD.2005.11.001zbMATH Open1206.65089OpenAlexW2141968974MaRDI QIDQ628153FDOQ628153
Authors: Li Jin, D. Kim, Lisen Mu, D.-S. Kim, Shimin Hu 
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
Recommendations
- scientific article; zbMATH DE number 2080266
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- scientific article; zbMATH DE number 140459
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
- EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (11)
- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane
- Near optimal minimal convex hulls of disks
- Computational Science and Its Applications – ICCSA 2004
- Swap conditions for dynamic Voronoi diagrams for circles and line segments
- A dynamic sampling approach towards computing Voronoi diagram of a set of circles
- A competition flow method for computing medial axis transform
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- Title not available (Why is that?)
- A sweep-line algorithm for the inclusion hierarchy among circles
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching
This page was built for publication: A sweepline algorithm for Euclidean Voronoi diagram of circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628153)
