## Discrete Geometric Shapes: Matching, Interpolation, and Approximation: A Survey (1996)

Venue: | Handbook of Computational Geometry |

Citations: | 125 - 9 self |

### BibTeX

@TECHREPORT{Alt96discretegeometric,

author = {Helmut Alt and Leonidas J. Guibas},

title = {Discrete Geometric Shapes: Matching, Interpolation, and Approximation: A Survey},

institution = {Handbook of Computational Geometry},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this survey we consider geometric techniques which have been used to measure the similarity or distance between shapes, as well as to approximate shapes, or interpolate between shapes. Shape is a modality which plays a key role in many disciplines, ranging from computer vision to molecular biology. We focus on algorithmic techniques based on computational geometry that have been developed for shape matching, simplification, and morphing. 1 Introduction The matching and analysis of geometric patterns and shapes is of importance in various application areas, in particular in computer vision and pattern recognition, but also in other disciplines concerned with the form of objects such as cartography, molecular biology, and computer animation. The general situation is that we are given two objects A, B and want to know how much they resemble each other. Usually one of the objects may undergo certain transformations like translations, rotations or scalings in order to be matched with th...