Linear expected complexity for directional and multiplicative Voronoi diagrams

DOI10.1007/s00454-024-00705-2MaRDI QIDQ6662763

Benjamin Raichel, Chenglin Fan

Publication date: 14 January 2025

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

computational geometryVoronoi diagramsexpected complexity

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) General topics of discrete mathematics in relation to computer science (68R01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From proximity to utility: a Voronoi partition of Pareto optima
• A note on visibility-constrained Voronoi diagrams
• Union of random Minkowski sums and network vulnerability analysis
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• A sweepline algorithm for Voronoi diagrams
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• Voronoi diagram with visual restriction
• Semi Voronoi Diagrams
• The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Generalization of Voronoi Diagrams in the Plane
• Approximating the k-Level in Three-Dimensional Plane Arrangements
• Power Diagrams: Properties, Algorithms and Applications
• On the Expected Complexity of Voronoi Diagrams on Terrains

This page was built for publication: Linear expected complexity for directional and multiplicative Voronoi diagrams