Pages that link to "Item:Q628153"

The following pages link to A sweepline algorithm for Euclidean Voronoi diagram of circles (Q628153):

Displaying 7 items.

• A competition flow method for computing medial axis transform (Q1636774) (← links)
• Near optimal minimal convex hulls of disks (Q2046265) (← links)
• A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching (Q2127711) (← links)
• A dynamic sampling approach towards computing Voronoi diagram of a set of circles (Q2243180) (← links)
• Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities (Q2446403) (← links)
• Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks (Q5270775) (← links)
• An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800) (← links)