Computing minimal distances on polyhedral surfaces
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 11 (9) , 1001-1005
- https://doi.org/10.1109/34.35505
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986
- Voronoi Diagrams on the Surface of a Polyhedron.Published by Defense Technical Information Center (DTIC) ,1985
- Computational GeometryPublished by Springer Nature ,1985
- Deoxyglucose Analysis of Retinotopic Organization in Primate Striate CortexScience, 1982