Show simple item record

dc.contributor.authorBurghard, Oliveren_US
dc.contributor.authorKlein, Reinharden_US
dc.contributor.editorDavid Bommes and Tobias Ritschel and Thomas Schultzen_US
dc.description.abstractIn this paper we exploit redundant information in geodesic distance fields for a quick approximation of all-pair distances. Starting with geodesic distance fields of equally distributed landmarks we analyze the lower and upper bound resulting from the triangle inequality and show that both bounds converge reasonably fast to the original distance field. The lower bound has itself a bounded relative error, fulfills the triangle equation and under mild conditions is a distance metric. While the absolute error of both bounds is smaller than the maximal landmark distances, the upper bound often exhibits smaller error close to the cut locus. Both the lower and upper bound are simple to implement and quickly to evaluate with a constant-time effort for point-to-point distances, which are often required by various algorithms.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectLine and curve generationen_US
dc.titleSimple, Robust, Constant-Time Bounds on Surface Geodesic Distances using Point Landmarksen_US
dc.description.seriesinformationVision, Modeling & Visualizationen_US

Files in this item


This item appears in the following Collection(s)

  • VMV15
    ISBN 978-3-905674-95-8

Show simple item record