Editing Geodesic (section)

==Computational methods==
Efficient solvers for the minimal geodesic problem on surfaces have been proposed by Mitchell,<ref>{{cite journal |first1=J. |last1=Mitchell |first2=D. |last2=Mount|first3=C.|last3=Papadimitriou|url=https://epubs.siam.org/doi/10.1137/0216045 |title=The Discrete Geodesic Problem |journal=[[SIAM Journal on Computing]] |volume=16 |issue=4 |pages=647–668 |year=1987 |doi=10.1137/0216045 }}</ref> Kimmel,<ref>{{cite journal |first1=R. |last1=Kimmel |first2=J. A. |last2=Sethian|url=https://www.pnas.org/content/pnas/95/15/8431.full.pdf |archive-url=https://ghostarchive.org/archive/20221009/https://www.pnas.org/content/pnas/95/15/8431.full.pdf |archive-date=2022-10-09 |url-status=live|title=Computing Geodesic Paths on Manifolds |journal=[[Proceedings of the National Academy of Sciences]] |volume=95 |issue=15 |pages=8431–8435 |year=1998 |doi=10.1073/pnas.95.15.8431 |pmid=9671694 |pmc=21092 |bibcode=1998PNAS...95.8431K |doi-access=free }}</ref> Crane,<ref>{{cite journal |first1=K. |last1=Crane |first2=C. |last2=Weischedel|first3=M. |last3=Wardetzky|url=https://dl.acm.org/doi/10.1145/3131280 |title=The Heat Method for Distance Computation |journal=[[Communications of the ACM]] |volume=60 |issue=11 |pages=90–99 |year=2017 |doi=10.1145/3131280 |s2cid=7078650 }}</ref> and others.