title: A triangulation-invariant method for anisotropic geodesic map computation on surface meshes.
abstract: This paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial differential equations, we present a framework for computing an anisotropic geodesic map using a curvature-based speed function. An ordered upwind method (OUM)-based solver for these equations is available for unstructured planar meshes. We adopt this OUM-based solver for surface meshes and present a triangulation-invariant method for the solver. Our basic idea is to explore proximity among the vertices on a surface while locally following the characteristic direction at each vertex. We also propose two speed functions based on classical curvature tensors and show that the resulting anisotropic geodesic maps reflect surface geometry well through several experiments, including isocontour generation, offset curve computation, medial axis extraction, and ridge/valley curve extraction. Our approach facilitates surface analysis and processing by defining speed functions in an application-dependent manner.
authors.affiliation: Computer Graphics Laboratory, Korea Advanced Institute of Science and Technology-KAIST, 291 Daehak-ro, Yuseong-gu, Daejeon 305-701, Korea. ysw81@jupiter.kaist.ac.kr
authors.forename: Sang Wook
authors.initials: SW
authors.lastname: Yoo
authors.forename: Joon-Kyung
authors.initials: JK
authors.lastname: Seong
authors.forename: Min-Hyuk
authors.initials: MH
authors.lastname: Sung
authors.forename: Sung Yo
authors.initials: SY
authors.lastname: Shin
authors.forename: Elaine
authors.initials: E
authors.lastname: Cohen