Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems
Olivier Devillers
Abstract
We use here the results on the influence graph by Boissonnat et al. to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from O(n log n) to O(n log star n). This technique applies in the following applications: triangulation of a simple polygon, skeleton of a simple polygon, Delaunay triangulation of points knowing the EMST (euclidean minimum spanning tree).
Create a lesson
Related papers
Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs
Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier et al.
Quadratic Complexity of Voronoi Diagrams in R3 for Lines in a Single Ruling of a Regulus
Eunku Park
Sequential Euclidean tree construction with exponential memory: distributional performance and worst-case guarantees
Pedro M. M. de Castro
Computing an e-net of a closed hyperbolic surface
Vincent Delecroix, Vincent Despré, Camille Lanuel et al.
On Angle-optimization and Simplification of Degree-1 Homology Representatives
Emerson G. Escolar, Yuta Shimada
Riesz Energy Subset Selection in the Euclidean Plane is NP-Hard: A Reduction from the Ising Model on Planar Cubic Graphs
Michael Emmerich