This Article 
 Bibliographic References 
 Add to: 
A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces
September 1989 (vol. 11 no. 9)
pp. 1005-1008

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.

[1] G. J. Carman and D. Van Essen, "Computational algorithms for the production of two-dimensional maps of cerebral cortex,"Neurosci. Abstracts, vol. 11, p. 1243, 1985.
[2] W. K. Kaplow and E. L. Schwartz, "Measuring mean and Gaussian curvature on triangulated brain surfaces: The differential geometry of macaque striate cortex," Computat. Neurosci. Lab., NYU Med. Center, Tech. Rep. CNS-TR-1-86, 1986.
[3] J. B. Kruskal, "Nonmetric multidimensional scaling: A numerical method,"Psychometrika, vol. 29, pp. 1-27, 115-129, 1964.
[4] B. Merker and E. L. Schwartz, "Computer aided neuro-anatomy: Reconstruction and characterization of the opercular surface of Macaque striate cortex,"Investigative Ophthal. and Vis. Res. (Supplement), vol. 26, no. 3, p. 164, 1985.
[5] J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitrious, "The Discrete Geodesic Problem,"SIAM J. Computation, Aug. 1987, pp. 647-668.
[6] J. O'Rourke, S. Suri, and H. Booth, "Shortest paths on polyhedral surfaces," inProc. Second Symp. Theoretical Aspects of Computer Science, Aug. 1984.
[7] J. W. Sammon, "A nonlinear mapping for data-structure analysis,"IEEE Trans. Comput., vol. C-18, pp. 401-409, 1969.
[8] S. S. Schiffman, M. L. Reynolds, and F. W. Young,Introduction to Multidimensional Scaling. New York: Academic, 1981.
[9] E. L. Schwartz and B. Merker, "Flattening cortex: An optimal computer algorithm and comparisons with physical flattening of the opercular surface of striate cortex,"Soc. Neurosci. Abstracts, vol. 15, 1985.
[10] M. Sharir, "On shortest paths amidst convex polyhedra,"SIAM J. Comput., vol. 16, no. 3, pp. 561-572, June 1987.
[11] M. Sharir and A. Schorr, "On shortest paths in polyhedral spaces,"SIAM J. Comput., vol. 15, no. 1, pp. 193-215, Feb. 1986.
[12] E. Wolfson and E. L. Schwartz, "Computing minimal distances on arbitrary two-dimensional polyhedral surfaces,"IEEE Pattern Anal. Machine Intell., see this issue, pp. 1001-1005.
[13] M. P. do Carmo,Differential Geometry of Curves and Surfaces. Englewood Cliffs, NJ: Prentice-Hall, 1975.

Index Terms:
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.L. Schwartz, A. Shaw, E. Wolfson, "A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 9, pp. 1005-1008, Sept. 1989, doi:10.1109/34.35506
Usage of this product signifies your acceptance of the Terms of Use.