Sciweavers

763 search results - page 55 / 153
» Engineering Shortest Path Algorithms
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 3 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
14 years 3 months ago
Straightest Paths on Meshes by Cutting Planes
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 c...
Sungyeol Lee, Joonhee Han, Haeyoung Lee
CGIM
2003
13 years 10 months ago
A Novel Method for 3D Surface Mesh Segmentation
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...
Thitiwan Srinark, Chandra Kambhamettu
AOR
2010
13 years 6 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean