A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces Export

@article{schwartz1989numerical, abstract = {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}, author = {Schwartz, E. L. and Shaw, A. and Wolfson, E.}, citeulike-article-id = {1112753}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=35506}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, keywords = {algorithm, cortex, flattening}, number = {9}, pages = {1005--1008}, posted-at = {2008-12-15 00:13:14}, priority = {2}, title = {A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=35506}, volume = {11}, year = {1989} }

TY - JOUR ID - schwartz1989numerical L3 - citeulike-article-id:1112753 N2 - 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 IS - 9 JF - Pattern Analysis and Machine Intelligence, IEEE Transactions on EP - 1008 TI - A numerical solution to the generalized mapmaker's problem: flattening nonconvex polyhedral surfaces VL - 11 SP - 1005 KW - algorithm KW - cortex KW - flattening AU - Schwartz, EL AU - Shaw, A AU - Wolfson, E PY - 1989/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=35506 ER -