A note on the unsolvability of the weighted region shortest path problem
From MaRDI portal
Publication:2249044
DOI10.1016/j.comgeo.2014.02.004zbMath1292.65016arXiv1305.5209OpenAlexW2012691739MaRDI QIDQ2249044
Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Megan Owen, Michiel H. M. Smid
Publication date: 27 June 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5209
Related Items (6)
An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Path planning in a weighted planar subdivision under the Manhattan metric ⋮ Similarity of polygonal curves in the presence of outliers ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Path refinement in weighted regions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geodesics in CAT(0) cubical complexes
- A survey of geodesic paths on 3D surfaces
- The algebraic degree of semidefinite programming
- The algebraic degree of geometric optimization problems
- Similarity of polygonal curves in the presence of outliers
- Determining approximate shortest paths on weighted polyhedral surfaces
- The weighted region problem
- Galois group computation for rational polynomials
This page was built for publication: A note on the unsolvability of the weighted region shortest path problem