RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS-Reference-Cited by-同舟云学术

RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

Published:1992-03 Issue:01 Volume:02 Page:97-111
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

DEVILLERS OLIVIER¹

Affiliation:

1. INRIA, 2004 Route des Lucioles, B.P.109, 06561 Valbonne cedex, France

Abstract

We use here the results on the influence graph1 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 ⋆ 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).

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S021819599200007X

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed Thresholded Counting with Limited Interaction;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets;Discrete & Computational Geometry;2020-09-08

3. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets;LEIBNIZ INT PR INFOR;2019

4. A leader-election procedure using records;The Annals of Probability;2017-11-01

5. Offset polygon and annulus placement problems;Computational Geometry;2014-04