scientific article; zbMATH DE number 7651184

DOI10.4230/LIPICS.ESA.2020.45MaRDI QIDQ5874515FDOQ5874515

Authors: Chenglin Fan, Benjamin Raichel 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2004.09385

Title of this publication is not available (Why is that?)

Recommendations

• Higher-dimensional Voronoi diagrams in linear expected time
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• The probabilistic complexity of the Voronoi diagram of points on a polyhedron
• On the Complexity of Randomly Weighted Voronoi Diagrams
• Aspect-ratio Voronoi diagram and its complexity bounds
• On the expected complexity of Voronoi diagrams on terrains
• On the expected complexity of Voronoi diagrams on terrains
• scientific article; zbMATH DE number 2119656
• On the complexity of higher order abstract Voronoi diagrams
• On the complexity of higher order abstract Voronoi diagrams

zbMATH Keywords

computational geometryVoronoi diagramsexpected complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Voronoi diagrams and Delaunay triangulations
• A note on visibility-constrained Voronoi diagrams
• Title not available (Why is that?)
• Power Diagrams: Properties, Algorithms and Applications
• A sweepline algorithm for Voronoi diagrams
• From proximity to utility: a Voronoi partition of Pareto optima
• Union of random Minkowski sums and network vulnerability analysis
• Voronoi diagram with visual restriction
• Semi Voronoi Diagrams
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Generalization of Voronoi Diagrams in the Plane
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
• Approximating the \(k\)-level in three-dimensional plane arrangements
• On the expected complexity of Voronoi diagrams on terrains

Cited In (4)

• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
• The impact of heterogeneity and geometry on the proof complexity of random satisfiability
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• Linear expected complexity for directional and multiplicative Voronoi diagrams

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874515)