ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
From MaRDI portal
Publication:2931158
DOI10.1142/S0218195914500010zbMath1308.68137arXiv1306.5796MaRDI QIDQ2931158
Publication date: 24 November 2014
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5796
shortest path; geodesic; convex hull; \(l_{2}\)-distance; global non-positive curvature; planar complex
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Geodesics in CAT(0) cubical complexes
- Shortest path problem in rectangular complexes of global nonpositive curvature
- On approximating the Riemannian 1-center
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- Computing minimum length paths of a given homotopy class
- Curvature and geometry of tessellating plane graphs
- Geometry of the space of phylogenetic trees
- Optimal shortest path queries in a simple polygon
- Graphs of some CAT(0) complexes
- The geometry and topology of reconfiguration
- Special cube complexes
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Euclidean shortest paths in the presence of rectilinear barriers
- Distance and routing labeling schemes for non-positively curved plane graphs
- Convex hulls of finite sets of points in two and three dimensions
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Shortest paths in the plane with polygonal obstacles
- Geodesics in non-positively curved plane tessellations
- SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
