论文信息 - Matching Convex Shapes with Respect to the Symmetric Difference

Matching Convex Shapes with Respect to the Symmetric Difference

Abstract. This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex figure over another, minimizing the area of their symmetric difference. We show that if we just let the two centers of gravity coincide, the resulting symmetric difference is within a factor of 11/3 of the optimum. This leads to efficient approximate matching algorithms for convex figures.

[1] Helmut Alt,et al. Approximation of Convex Polygons , 1990, ICALP.

[2] Günter Rote,et al. Matching shapes with a reference point , 1994, SCG '94.

[3] Mark de Berg,et al. Computing the Maximum Overlap of Two Convex Polygons under Translations , 1996, Theory of Computing Systems.

[4] Prosenjit Bose,et al. On the sectional area of convex polytopes , 1996, SCG '96.

[5] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.

[6] P. Gruber. Aspects of Approximation of Convex Bodies , 1993 .

[7] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.

[8] Helmut Alt,et al. Approximate matching of polygonal shapes , 1995, SCG '91.

[9] Gerald Weber,et al. Matching Convex Shapes with Respect to the Symmetric Difference , 1996, ESA.

[10] Michael T. Goodrich,et al. Geometric Pattern Matching Under Euclidean Motion , 1993, Comput. Geom..

[11] Mark de Berg,et al. Computing the Maximum Overlap of Two Convex Polygons Under Translations , 1996, ISAAC.

[12] Arnold Schönhage,et al. The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .

[13] P. Gruber. Approximation of convex bodies , 1983 .