Computing a maxian point of a simple rectilinear polygon
From MaRDI portal
Publication:2643818
DOI10.1016/j.orl.2005.12.006zbMath1278.90217MaRDI QIDQ2643818
Publication date: 27 August 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.12.006
52B55: Computational aspects related to convexity
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
90B80: Discrete location and assignment
Cites Work
- Unnamed Item
- On rectilinear link distance
- Computing a median point of a simple rectilinear polygon
- Rectilinear decompositions with low stabbing number
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
- Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric