Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems

Details Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems

1998-10-07

arxiv.org/abs/cs/9810007v2

Internat. J. Comput. Geom. Appl., 2(1):621--635, 1992

Computer Science

Computational Geometry

16 pages, 6 figures, Proc. 3rd Canad. Conf. Comput. Geom., 1991

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605342