Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Selection from read-only memory and sorting with minimum data movement
Theoretical Computer Science
Multi-Pass Geometric Algorithms
Discrete & Computational Geometry
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Undirected connectivity in log-space
Journal of the ACM (JACM)
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Computing the visibility polygon using few variables
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., O(logn) bits in total for the work space, where n is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to O(n1+ε) for any positive constant ε. Second, we describe how to compute a shortest path between two points in a simple n-gon. Although the shortest path problem in general graphs is NL-complete, this constrained problem can be solved in quadratic time using only constant work space.