A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces
Issue No. 09 - September (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.35506
<p>Methods are described to unfold and flatten the curved, convoluted surfaces of the brain in order to study the functional architectures and neural maps embedded in them. In order to do this, it is necessary to solve the general mapmaker's problem for representing curved surfaces by planar models. This algorithm has applications in areas other than computer-aided neuroanatomy, such as robotics motion planning and geophysics. The algorithm maximizes the goodness of fit distances in these surfaces to distances in a planar configuration of points. It is illustrated with a flattening of monkey visual cortex, which is an extremely complex folded surface. Distance errors in the range of several percent are found, with isolated regions of larger error, for the class of cortical surfaces studied so far.</p>
brain surface; picture processing; mapmaker's problem; flattening nonconvex polyhedral surfaces; functional architectures; neural maps; curved surfaces; neuroanatomy; goodness of fit distances; visual cortex; complex folded surface; computational geometry; computerised picture processing; neurophysiology
E. Wolfson, E. Schwartz and A. Shaw, "A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 1005-1008, 1989.