Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alan Shaw

dblp:20/3709 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 50% Medical and health informatics · 50%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › surface parameterization
surface flattening
0.011989
A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Medical and health informatics › neuroimaging
cortical surface analysis
0.011989
A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Bioinformatics and computational biology › neuroscience
neuroanatomy
0.011989
A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces · IEEE Trans. Pattern Anal. Mach. Intell. 1989

Methods — techniques the papers use, named apart from their topics

multidimensional scaling · 0.0distance error minimization · 0.0
YearPublicationVenuePosition
1989 A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces
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.>
Eric L. Schwartz, Alan Shaw, Estarose Wolfson
IEEE Trans. Pattern Anal. Mach. Intell.2