The theme of this chapter 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.
CITATION STYLE
Seidel, R. (1993). Backwards Analysis of Randomized Geometric Algorithms (pp. 37–67). https://doi.org/10.1007/978-3-642-58043-7_3
Mendeley helps you to discover research relevant for your work.