A sweepline algorithm for Euclidean Voronoi diagram of circles
From MaRDI portal
(Redirected from Publication:628153)
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
Cited in
(11)- A competition flow method for computing medial axis transform
- A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching
- Computational Science and Its Applications – ICCSA 2004
- scientific article; zbMATH DE number 5137290 (Why is no real title available?)
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- A sweep-line algorithm for the inclusion hierarchy among circles
- Near optimal minimal convex hulls of disks
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- 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
- Swap conditions for dynamic Voronoi diagrams for circles and line segments
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)