2-D Shape Analysis

4/19/00


Click here to start


Table of Contents

2-D Shape Analysis

Comparing polygonal shapes using turning function

PPT Slide

Turning function (continued)

A polygon distance function

Distance function (continued)

Distance function (continued)

Critical events

Complexity of the algorithm

Comparing polygons with graph matching

G-graph

PPT Slide

G-graph (continued)

Simplified contours

Reduction to simplified contour similarity

PPT Slide

Simplified contour similarity (continued)

Elementary morphism

Lattice of morphisms

PPT Slide

Top-down greedy algorithm

Comparing polygons by signature

Shape comparison algorithm

Snapping rules

Snapping rules (continued)

Snapping rules (continued)

Pathline

Postprocessing

Signature file

Comparison

Summary

Author: mzhang

Email: mzhang@cs.princeton.edu

Home Page: http://www.cs.princeton.edu/~mzhang