Reprint of: Memory-constrained algorithms for simple polygons

A constant-work-space algorithm has read-only access to an input array and may use only O(1) additional words of O(logn) bits, where n is the input size. We show how to triangulate a plane straight-line graph with n vertices in O(n^2) time and constant work-space. We also consider the problem of preprocessing a simple polygon P for shortest path queries, where P is given by the ordered sequence of its n vertices. For this, we relax the space constraint to allow s words of work-space. After quadratic preprocessing, the shortest path between any two points inside P can be found in O(n^2/s) time.

[1]  Timothy M. Chan,et al.  Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection , 2010, Comput. Geom..

[2]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[3]  Leonidas J. Guibas,et al.  Optimal Shortest Path Queries in a Simple Polygon , 1989, J. Comput. Syst. Sci..

[4]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[5]  Kunihiko Sadakane,et al.  Space–Time Trade-offs for Stack-Based Algorithms , 2012, Algorithmica.

[6]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[7]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[8]  Timothy M. Chan,et al.  Towards in-place geometric algorithms and data structures , 2004, SCG '04.

[9]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

[10]  Raimund Seidel.  Convex hull computations , 1997 .

[11]  Kunihiko Sadakane,et al.  Space-Time Trade-offs for Stack-Based Algorithms , 2013, STACS.

[12]  Hazel Everett,et al.  Slicing an ear using prune-and-search , 1993, Pattern Recognit. Lett..

[13]  Timothy M. Chan.  Comparison-based time-space lower bounds for selection , 2009, TALG.

[14]  Bernard Chazelle,et al.  Triangulation and shape-complexity , 1984, TOGS.

[15]  Greg N. Frederickson,et al.  Upper Bounds for Time-Space Trade-Offs in Sorting and Selection , 1987, J. Comput. Syst. Sci..

[16]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[17]  Timothy M. Chan,et al.  Multi-Pass Geometric Algorithms , 2007, Discret. Comput. Geom..

[18]  Timothy M. Chan,et al.  Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time , 2004, Comput. Geom..

[19]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[20]  Yajun Wang,et al.  Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons , 2011, J. Graph Algorithms Appl..

[21]  Günter Rote,et al.  Constant-Working-Space Algorithms for Geometric Problems , 2009, CCCG.

[22]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[23]  Venkatesh Raman,et al.  Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage , 1998, SWAT.

[24]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[25]  Pat Morin,et al.  Space-efficient planar convex hull algorithms , 2004, Theor. Comput. Sci..

[26]  Luis Barba,et al.  Computing the Visibility Polygon Using Few Variables , 2011, ISAAC.

[27]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[28]  Guy Joseph Jacobson,et al.  Succinct static data structures , 1988 .

[29]  Venkatesh Raman,et al.  Selection from Read-Only Memory and Sorting with Minimum Data Movement , 1996, Theor. Comput. Sci..