The local matching problem on surfaces is: Given a pair of oriented surfaces in 3-space, find subsurfaces that are identical or complementary in shape. A heuristic method is presented for local matching that is intended for use on complex curved surfaces (rather than such surfaces as as cubes and cylinders). The method proceeds as follows: (1) Find a small set of points-called "critical points" -on the two surfaces with the property that if p is a critical point and p matches q, then q is also a critical point. The critical points are taken to be local extrema of either Gaussian or mean curvature. (2) Construct a rotation invariant representation around each critical point by intersecting the surface with spheres of standard radius centered around the critical point. For each of the resulting curves of intersection, compute a "distance map" function equal to the distance from a point on the curve to the center of gravity of the curve as a. function of arc length (normalized so that the domain of the function is the interval [0,1]). Cll the set of contours for a given critical point a "distance profile." (3) Match distance profiles by computing a "correlation" between corresponding distance contours. (4) Use maximal compatible subsets of the set of matching profiles to induce a transformation that maps corresponding critical points together, then use a cellular spatial partitioning technique to find all points on each surface that are within a tolerance of the other surface. Disciplines Computer Engineering | Computer Sciences Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-84-13. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/1007 LOCAL MATCHING OF SURFACES USING CRITICAL POINTS Gerald M. Rada.ck Norman I. Badler A1S-CIS-84-13 Department of Computer and Information Science Moore School/D2 University of Pennsylvania Philadelphia, P A 19104: May 1984 Local Matching of Surfaces Using Critical Points Gerald M. Radack Norman I. Badler
[1]
Linda G. Shapiro,et al.
Identification of Space Curves from Two-Dimensional Perspective Views
,
1982,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2]
H. Freeman,et al.
Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition
,
1964,
IEEE Trans. Electron. Comput..
[3]
Yoshiaki Shirai,et al.
Object Recognition Using Three-Dimensional Information
,
1981,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4]
J. Janin,et al.
Computer analysis of protein-protein interaction.
,
1978,
Journal of molecular biology.
[5]
Norman I. Badler,et al.
Jigsaw puzzle matching using a boundary-centered polar encoding
,
1982,
Comput. Graph. Image Process..
[6]
Norman I. Badler,et al.
Three-dimensional representations for computer graphics and computer vision
,
1978,
SIGGRAPH.
[7]
Herbert Freeman,et al.
Shape description via the use of critical points
,
1978,
Pattern Recognit..