Pages that link to "Item:Q1882526"
From MaRDI portal
The following pages link to The Hausdorff Voronoi diagram of point clusters in the plane (Q1882526):
Displaying 19 items.
- New results on stabbing segments with a polygon (Q474818) (← links)
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Bernoulli cluster field: Voronoi tessellations. (Q558546) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Influence-based Voronoi diagrams of clusters (Q1984607) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Map of Geometric Minimal Cuts for General Planar Embedding (Q2867123) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- On Clustering Induced Voronoi Diagrams (Q4593247) (← links)
- Voros symbols as cluster coordinates (Q5217922) (← links)
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction (Q5387806) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)
- Algorithms and Data Structures (Q5900774) (← links)
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology (Q5941487) (← links)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (Q5971177) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)
