Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation

Motivated by problems in computational geometry, this paper investigates the complexity of finding a fixed-point of the composition of two or three continuous functions that are defined piecewise. It shows that certain cases require nested binary search taking Θ(log2 n) time. Other cases can be solved in logarithmic time by using a prune-and-search technique that may make tentative discards and later revoke or certify them. This work finds application in optimal subroutines that compute approximations to convex polygons, dense packings, and Voronoi vertices for Euclidean and polygonal distance functions.

[1]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Günter Rote,et al.  Maintaining the Approximate Width of a Set of Points in the Plane , 1993, CCCG.

[4]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[5]  Leonidas J. Guibas,et al.  A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  Leonidas J. Guibas,et al.  Compact interval trees: a data structure for convex hulls , 1991, SODA '90.

[7]  Helmut Alt,et al.  Approximation of Convex Polygons , 1990, ICALP.

[8]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[9]  Herbert Edelsbrunner,et al.  Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane , 1985, Inf. Process. Lett..

[10]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[11]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[12]  David G. Kirkpatrick,et al.  A compact piecewise-linear voronoi diagram for convex sites in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[13]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[14]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[15]  David M. Mount,et al.  The Densest Double-Lattice Packing of a Convex Polygon , 1991, Discrete and Computational Geometry.

[16]  S. A. Vavasis.  Complexity of fixed point computations , 1989 .

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  Günter Rote,et al.  Approximation of Convex Figures by Pairs of Rectangles , 1990, STACS.

[19]  Kim C. Border,et al.  Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .