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)