### Evolutionary Morphing

@inproceedings{Wiley:2005:EM,

| title | = | "Evolutionary Morphing", |

| booktitle | = | "Proceedings of IEEE Visualization 2005", |

| author | = | "David
F. Wiley AND Nina
Amenta AND Dan
A. Alcantara AND Deboshmita
Ghosh AND Yong
J Kil AND Eric
Delson AND Will
Harcourt-Smith AND F.
James Rohlf AND Katherine
St. John AND Bernd
Hamann ", |

| year | = | "2005", |

| keywords | = | "morphometrics, morphing, surface blending, merging, warping, distance fields, extremal surface", |

| url | = | "http://graphics.idav.ucdavis.edu/research/EvoMorph", |

| location | = | "Minneapolis, Minnesota", |

| eventtime | = | "October 23--25, 2005", |

| abstract | = | "We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer models of anatomical shapes for some collection of specimens - here the skulls of the some of the extant members of a family of monkeys - an evolutionary tree for the group implies a hypothesis about the way in which the shape changed through time. We use a statistical method which expresses the value of some variable - in this case the shape - at an internal point in the tree as a weighted average of the values at the leaves. The framework of geometric morphometrics
can then be used to define a shape-space, based on the correspondences of landmark points on the surfaces, within which these weighted averages can be realized as actual surfaces. Our software provides tools for performing and visualizing such an analysis in three dimensions. Beginning with laser range surfaces
scans of skulls, we use our landmark editor to interactively place landmark points on the surface. We use these to compute a treemorph which smoothly interpolates the shapes across the tree. Each intermediate shape in the morph is a linear combination of all of the input surfaces. We create a surface model for an intermediate shape by warping all the input meshes towards the correct shape and then merging them together. Our merging procedure is novel. Given several similar surface meshes, we compute a weighted average between them by averaging their associated trivariate squared distance functions, and then extract the extremal surface which traces out the "valleys" along which the averaged function is nearly zero.", |

}

back to publication