Straightest paths on meshes by cutting planes

Authors:
Sungyeol Lee;Joonhee Han;Haeyoung Lee
Affiliations:
Dept. of Computer Engineering, Hongik University, Seoul, Korea;Dept. of Computer Engineering, Hongik University, Seoul, Korea;Dept. of Computer Engineering, Hongik University, Seoul, Korea
Venue:
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Year:
2006

Citing 8
Cited 0

The discrete geodesic problem

SIAM Journal on Computing
Parametrization and smooth approximation of surface triangulations

Computer Aided Geometric Design
Texture mapping progressive meshes

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Mean value coordinates

Computer Aided Geometric Design
Meshes on fire

Proceedings of the Eurographic workshop on Computer animation and simulation
Approximate Shortest Path on Polyhedral Surface Based on Selective Refinement of the Discrete Graph and Its Applications

GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Geodesics-Based One-to-One Parameterization of 3D Triangle Meshes

IEEE MultiMedia
Fast exact and approximate geodesics on meshes

ACM SIGGRAPH 2005 Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geodesic paths and distances on meshes are used for many applications such as parameterization, remeshing, mesh segmentation, and simulations of natural phenomena. Noble works to compute shortest geodesic paths have been published. In this paper, we present a new approach to compute the straightest path from a source to one or more vertices on a manifold mesh with a boundary. A cutting plane with a source and a destination vertex is first defined. Then the straightest path between these two vertices is created by intersecting the cutting plane with faces on the mesh. We demonstrate that our straightest path algorithm contributes to reducing distortion in a shape-preserving linear parameterization by generating a measured boundary.