Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Computing minimal distances on polyhedral surfaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wolfson, E. ; Dept. of Psychiatry, New York Univ. Sch. of Med., NY, USA ; Schwartz, E.L.

The authors implement an algorithm that finds minimal (geodesic) distances on a three-dimensional polyhedral surface. The algorithm is intrinsically parallel, in as much as it deals with all nodes simultaneously, and is simple to implement. Although exponential in complexity, it can be used with a companion gradient-descent surface-flattening algorithm that produces an optimal flattening of a polyhedral surface. Together, these two algorithms have made it possible to obtain accurate flattening of biological surfaces consisting of several thousand triangular faces (monkey visual cortex) by providing a characterization of the distance geometry of these surfaces. The authors propose this approach as a pragmatic solution to characterizing the surface geometry of the complex polyhedral surfaces which are encountered in the cortex of vertebrates

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:11 ,  Issue: 9 )