On finding a shortest isothetic path and its monotonicity inside a digital object
From MaRDI portal
Publication:499711
DOI10.1007/s10472-014-9421-yzbMath1341.68292OpenAlexW2010334175MaRDI QIDQ499711
Arindam Biswas, Mousumi Dutt, Partha Bhowmick, Bhargab Bikram Bhattacharya
Publication date: 6 October 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9421-y
shortest pathshape analysisdigital geometryManhattan pathmonotone pathmonotonicity numbershortest isothetic path
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rectilinear link distance
- Planar rectilinear shortest path computation using corridors
- Minimum-link watchman tours
- Finding shortest safari routes in simple polygons
- Watchman routes under limited visibility
- The zookeeper route problem
- New approximation algorithms for the Steiner tree problems
- Approximation algorithms for the watchman route and zookeeper's problems.
- Orthogonally convex covering of orthogonal polygons without holes
- On Shortest Paths in Polyhedral Spaces
- Finding minimum rectilinear distance paths in the presence of barriers
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Approximation algorithms for TSP with neighborhoods in the plane
- On Finding Shortest Isothetic Path inside a Digital Object
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- Visibility Algorithms in the Plane
This page was built for publication: On finding a shortest isothetic path and its monotonicity inside a digital object