Linked Life Data

19372606

Source:http://linkedlifedata.com/resource/pubmed/id/19372606

Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
6
pubmed:dateCreated
2009-4-17
pubmed:abstractText
We present two algorithms for computing distances along convex and non-convex polyhedral surfaces. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the surface. Both algorithms have been extended to compute the exact minimal-geodesic paths and shortest paths. These algorithms have been implemented and validated on surfaces for which the correct solutions are known, in order to verify the accuracy and to measure the run-time performance, which is cubic or less for each algorithm. The exact-distance computations carried out by these algorithms are feasible for large-scale surfaces containing tens of thousands of vertices, and are a necessary component of near-isometric surface flattening methods that accurately transform curved manifolds into flat representations.
pubmed:grant
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:status
MEDLINE
pubmed:month
Jun
pubmed:issn
0162-8828
pubmed:author
pubmed:issnType
Print
pubmed:volume
31
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
1006-16
pubmed:meshHeading
pubmed:year
2009
pubmed:articleTitle
Exact geodesics and shortest paths on polyhedral surfaces.
pubmed:affiliation
Department of Cognitive and Neural Systems, Boston University, 677 Beacon Street, Boston, MA 02215, USA. mukundb@cns.bu.edu
pubmed:publicationType
Journal Article, Research Support, N.I.H., Extramural