Bounded Approximations of Geodesics for Triangular Manifolds with Partially Missing Data

Download
  1. (PDF, 1 MB)
DOIResolve DOI: http://doi.org/10.4224/8913812
AuthorSearch for: ; Search for: ; Search for: ; Search for:
TypeTechnical Report
AbstractIn this paper we present an 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 a maximum relative error bound of the approximation. The error bound is shown to be 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 method to add an object to the embedding computed via least-squares MDS.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number49316
NPARC number8913812
Export citationExport as RIS
Report a correctionReport a correction
Record identifierb58d8ca8-1774-4ca6-959a-6a69bf0ca616
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)