Upper bounds for time-space trade-offs in sorting and selection
Journal of Computer and System Sciences
Optimal shortest path queries in a simple polygon
Journal of Computer and System Sciences
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Slicing an ear using prune-and-search
Pattern Recognition Letters - Special issue on computational geometry
Selection from read-only memory and sorting with minimum data movement
Theoretical Computer Science
Handbook of discrete and computational geometry
Triangulation and shape-complexity
ACM Transactions on Graphics (TOG)
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Multi-Pass Geometric Algorithms
Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
A theorem on polygon cutting with applications
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection
Computational Geometry: Theory and Applications
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
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.