# high performance computing on graphics processing units: hgpu.org

## Saddle Vertex Graph (SVG): A Novel Solution to the Discrete Geodesic Problem

Xiang Ying, Xiaoning Wang, Ying He
Nanyang Technological University
Nanyang Technological University, 2013

title={Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem},

author={Ying, Xiang and Wang, Xiaoning and He, Ying},

journal={ACM Transactions on Graphics (TOG)},

volume={32},

number={6},

pages={170},

year={2013},

publisher={ACM}

}

2188

views

This paper presents the Saddle Vertex Graph (SVG), a novel solution to the discrete geodesic problem. The SVG is a sparse undirected graph that encodes complete geodesic distance information: a geodesic path on the mesh is equivalent to a shortest path on the SVG, which can be solved efficiently using the shortest path algorithm (e.g., Dijkstra algorithm). The SVG method solves the discrete geodesic problem from a local perspective. We have observed that the polyhedral surface has some interesting and unique properties, such as the fact that the discrete geodesic exhibits a strong local structure, which is not available on the smooth surfaces. The richer the details and complicated geometry of the mesh, the stronger such local structure will be. Taking advantage of the local nature, the SVG algorithm breaks down the discrete geodesic problem into significantly smaller sub-problems, and elegantly enables information reuse. It does not require any numerical solver, and is numerically stable and insensitive to the mesh resolution and tessellation. Users can intuitively specify a model-independent parameter K, which effectively balances the SVG complexity and the accuracy of the computed geodesic distance. More importantly, the computed distance is guaranteed to be a metric. The experimental results on real-world models demonstrate significant improvement to the existing approximate geodesic methods in terms of both performance and accuracy.
* * *

* * *
* * *