Backwards Analysis of Randomized Geometric Algorithms (1992)
| Venue: | Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics |
| Citations: | 59 - 0 self |
BibTeX
@INPROCEEDINGS{Seidel92backwardsanalysis,
author = {Raimund Seidel},
title = {Backwards Analysis of Randomized Geometric Algorithms},
booktitle = {Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics},
year = {1992},
pages = {37--68},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The theme of this paper is a rather simple method that has proved very potent in the analysis of the expected performance of various randomized algorithms and data structures in computational geometry. The method can be described as "analyze a randomized algorithm as if it were running backwards in time, from output to input." We apply this type of analysis to a variety of algorithms, old and new, and obtain solutions with optimal or near optimal expected performance for a plethora of problems in computational geometry, such as computing Delaunay triangulations of convex polygons, computing convex hulls of point sets in the plane or in higher dimensions, sorting, intersecting line segments, linear programming with a fixed number of variables, and others. 1 Introduction The curious phenomenon that randomness can be used profitably in the solution of computational tasks has attracted a lot of attention from researchers in recent years. The approach has proved useful in such diverse area...
