Approximate straightest path computation and its application in parameterization

Zhong Li

doi:10.1007/s00371-011-0600-0

Approximate straightest path computation and its application in parameterization

2011-05-17

5

PRE

AI

DOI：10.1007/s00371-011-0600-0

Original

Original request for help

Save

Abstract

En 中文

This paper proposes an approaching method to compute the straightest path between two vertices on meshes. An initial cutting plane is first constructed using the normal information of the source and destination vertices. Then an optimal cutting plane is iteratively created by comparing with previous path distance. Our study shows that the final straightest path based on this optimal cutting plane is more accurate and insensitive to the mesh boundary. Furthermore, we apply the straightest path result to compute the measured boundary in the parameter domain for mesh parameterization, and we obtain a new computing formula for vertex stretch in the planar parameterization. Experimental results show that our parameterization method can effectively reduce distortions.

Keywords:

Optimal cutting plane

Straightest path

Mesh parameterization

Vertex stretch

Measured boundary

Approximate straightest path computation and its application in parameterization

Abstract

Journal

Organization