A1 Refereed original research article in a scientific journal
Shortest paths in planar domains with hyperbolic type metrics; 
Authors: Gao, Shuliang; Hakanen, Anni; Rasila, Antti; Vuorinen, Matti
Publisher: Elsevier BV
Publication year: 2026
Journal: Journal of Mathematical Analysis and Applications
Article number: 130801
Volume: 563
Issue: 2
ISSN: 0022-247X
eISSN: 1096-0813
DOI: https://doi.org/10.1016/j.jmaa.2026.130801
Publication's open availability at the time of reporting: Open Access
Publication channel's open availability : Partially Open Access publication channel
Web address : https://doi.org/10.1016/j.jmaa.2026.130801
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/526482386
Self-archived copy's licence: CC BY
Self-archived copy's version: Publisher`s PDF
We study planar domains G equipped with a hyperbolic type metric and approximate geodesics that join two points x,y∈G and their lengths. We present an algorithm that enables one to approximate the shortest distance in polygonal domains taken with respect to the quasihyperbolic metric. The method is based on Dijkstra's algorithm, and we give several examples demonstrating how the algorithm works and analyze its accuracy. We experimentally demonstrate several previously theoretically observed features of geodesics, such as the relationship between hyperbolic and quasihyperbolic distance in the unit disk. We also investigate bifurcation of geodesics and the connection of this phenomenon to the medial axis of the domain.
Keywords:
Dijkstra's algorithm, Discrete conformal geometry, Geodesic, geometric function theory
Downloadable publication This is an electronic reprint of the original article. |  |
Funding information in the publication:
S.G. and A.R. were supported by Natural Science Foundation of Guangdong Province (No. 2024A1515010467), Li Ka Shing Foundation GTIIT-STU Joint Research Grant (No. 2024LKSFG06), and GTIIT Education Foundation.
