Sciweavers

154 search results - page 1 / 31
» Computing geodesics on triangular meshes
Sort
View
CG
2005
Springer
13 years 4 months ago
Computing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
Dimas Martínez Morera, Luiz Velho, Paulo Ce...
CAD
2004
Springer
13 years 4 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
CCCG
2007
13 years 6 months ago
Approximations of Geodesic Distances for Incomplete Triangular Manifolds
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...
SI3D
2010
ACM
13 years 10 months ago
Real-time multi-agent path planning on arbitrary surfaces
Path planning is an active topic in the literature, and efficient navigation over non-planar surfaces is an open research question. In this work we present a novel technique for ...
Rafael P. Torchelsen, Luiz F. Scheidegger, Guilher...
ICPR
2006
IEEE
14 years 6 months ago
A Novel Volumetric Shape from Silhouette Algorithm Based on a Centripetal Pentahedron Model
In this paper we present a novel volumetric shape from silhouette algorithm based on a centripetal pentahedron model. The algorithm first partitions the space with a set of infini...
Xin Liu, Hongxun Yao, Guilin Yao, Wen Gao