| Download | - View accepted manuscript: Approximations of geodesic distances for incomplete triangular manifolds (PDF, 404 KiB)
|
|---|
| Author | Search for: Ben Azouz, Zouhour; Search for: Bose, P.; Search for: Shu, Chang; Search for: Wuhrer, Stefanie |
|---|
| Format | Text, Article |
|---|
| Conference | Canadian Conference on Computational Geometry, August 20-22, 2007, Ottawa, Ontario, Canada |
|---|
| Abstract | We present a heuristic algorithm to compute approximate geodesic distances on 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). Wederive a new heuristic method to add an object to the embedding computed via least-squares MDS. |
|---|
| Publication date | 2007 |
|---|
| In | |
|---|
| Language | English |
|---|
| NRC number | NRCC 49831 |
|---|
| NPARC number | 5764997 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 8eae5e8b-63de-4126-a5bf-5078a6d9025d |
|---|
| Record created | 2009-03-29 |
|---|
| Record modified | 2020-08-12 |
|---|
