Rectilinear path problems in restricted memory setup
From MaRDI portal
Publication:2357163
DOI10.1016/j.dam.2016.05.031zbMath1365.05149OpenAlexW2472646614MaRDI QIDQ2357163
Sasanka Roy, Anil Maheshwari, Minati De, Binay K. Bhattacharya, Subhas C. Nandy
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.031
Cites Work
- Unnamed Item
- Selection from read-only memory and sorting with minimum data movement
- Space-efficient geometric divide-and-conquer algorithms
- Rectilinear shortest paths in the presence of rectangular barriers
- An in-place min-max priority search tree
- Memory-constrained algorithms for simple polygons
- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
- Rectilinear Path Problems in Restricted Memory Setup
- Towards in-place geometric algorithms and data structures