Computing a visibility polygon using few variables

Abrahamsen, 2013 Abrahamsen, 2013, An optimal algorithm computing edge-to-edge visibility in a simple polygon, 157 Aichholzer, 2012, Geodesic order types, 216 Arora, 2009 Asano Asano, 2011, Constant-work-space algorithms for geometric problems, J. Comput. Geom., 2, 46 Asano, 2010, Constant-work-space algorithm for a shortest path in a simple polygon, 9 Asano, 2009, Constant-working-space algorithms for geometric problems, 87 Barba, 2013, Space-time trade-offs for stack-based algorithms, 281 Barba, 2011, Computing the visibility polygon using few variables, 70 Bose, 2011, A generalized Winternitz theorem, J. Geom., 100, 29, 10.1007/s00022-011-0076-0 Bose, 2007, Geodesic ham-sandwich cuts, Discrete Comput. Geom., 37, 325, 10.1007/s00454-006-1287-2 Chan, 2007, Multi-pass geometric algorithms, Discrete Comput. Geom., 37, 79, 10.1007/s00454-006-1275-6 Chan, 2010, Comparison-based time-space lower bounds for selection, ACM Trans. Algorithms, 6, 10.1145/1721837.1721842 De Frederickson, 1987, Upper bounds for time-space trade-offs in sorting and selection, J. Comput. Syst. Sci., 34, 19, 10.1016/0022-0000(87)90002-X Ghosh, 2007 Greenwald, 2001, Space-efficient online computation of quantile summaries, 58 Jarvis, 1973, On the identification of the convex hull of a finite set of points in the plane, Inf. Process. Lett., 2, 18, 10.1016/0020-0190(73)90020-3 Joe, 1987, Corrections to Lee's visibility polygon algorithm, BIT Numer. Math., 27, 458, 10.1007/BF01937271 Munro, 1980, Selection and sorting with limited storage, Theor. Comput. Sci., 12, 315, 10.1016/0304-3975(80)90061-4 Munro, 1996, Selection from read-only memory and sorting with minimum data movement, Theor. Comput. Sci., 165, 311, 10.1016/0304-3975(95)00225-1 O'Rourke, 2004, Visibility, 643 Raman, 1998, Improved upper bounds for time-space tradeoffs for selection with limited storage, 131