Sciweavers

CCCG
2007

Approximations of Geodesic Distances for Incomplete Triangular Manifolds

13 years 11 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 computes an approximation of the geodesic distance between two vertices pi and pj on S and provides an upper bound of the geodesic distance that is shown to be optimal in the worst case. This yields a relative error bound of the estimate that is worst-case optimal. The algorithm approximates the geodesic distance without trying to reconstruct the missing data by embedding the surface in a low dimensional space via multi-dimensional scaling (MDS). We derive a new heuristic method to add an object to the embedding computed via least-squares MDS.
Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where CCCG
Authors Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer
Comments (0)