<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605541337</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100916.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00371-014-1041-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00371-014-1041-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Geodesic bifurcation on smooth surfaces</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Hannes Thielhelm, Alexander Vais, Franz-Erich Wolter]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Within Riemannian geometry the geodesic exponential map is an essential tool for various distance-related investigations and computations. Several natural questions can be formulated in terms of its preimages, usually leading to quite challenging non-linear problems. In this context we recently proposed an approach for computing multiple geodesics connecting two arbitrary points on two-dimensional surfaces in situations where an ambiguity of these connecting geodesics is indicated by the presence of focal curves. The essence of the approach consists in exploiting the structure of the associated focal curve and using a suitable curve for a homotopy algorithm to collect the geodesic connections. In this follow-up discussion we extend those constructions to overcome a significant limitation inherent in the previous method, i.e. the necessity to construct homotopy curves artificially. We show that considering homotopy curves meeting a focal curve tangentially leads to a singularity that we investigate thoroughly. Solving this so-called geodesic bifurcation analytically and dealing with it numerically provides not only theoretical insights, but also allows geodesics to be used as homotopy curves. This yields a stable computational tool in the context of computing distances. This is applicable in common situations where there is a curvature induced non-injectivity of the exponential map. In particular we illustrate how applying geodesic bifurcation approaches the distance problem on compact manifolds with a single closed focal curve. Furthermore, the presented investigations provide natural initial values for computing cut loci using the medial differential equation which directly leads to a discussion on avoiding redundant computations by combining the presented concepts to determine branching points.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Geodesic exponential map</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Focal curves</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Connecting geodesics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Distance computation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Cut locus</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Voronoi diagram</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Thielhelm</subfield>
   <subfield code="D">Hannes</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Vais</subfield>
   <subfield code="D">Alexander</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wolter</subfield>
   <subfield code="D">Franz-Erich</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">The Visual Computer</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">31/2(2015-02-01), 187-204</subfield>
   <subfield code="x">0178-2789</subfield>
   <subfield code="q">31:2&lt;187</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">371</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00371-014-1041-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00371-014-1041-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Thielhelm</subfield>
   <subfield code="D">Hannes</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Vais</subfield>
   <subfield code="D">Alexander</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Wolter</subfield>
   <subfield code="D">Franz-Erich</subfield>
   <subfield code="u">Welfenlab, Leibniz University of Hannover, Hannover, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">The Visual Computer</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">31/2(2015-02-01), 187-204</subfield>
   <subfield code="x">0178-2789</subfield>
   <subfield code="q">31:2&lt;187</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">371</subfield>
  </datafield>
 </record>
</collection>
