Issue No. 09 - September (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.35505
<p>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.</p>
3D polyhedral surfaces; shortest path; computational geometry; picture processing; pattern recognition; minimal distances; flattening; biological surfaces; distance geometry; surface geometry; biological techniques and instruments; biology computing; computational geometry; computerised pattern recognition; computerised picture processing
E. Schwartz and E. Wolfson, "Computing Minimal Distances on Polyhedral Surfaces," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 1001-1005, 1989.