D.M. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. SPIE Vision Geometry II,  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Computing the Maximum Overlap of Two Convex.. - de Berg.. (1996) (5 citations) (Correct)
....to maximizing the area of overlap of the polygons. An algorithm with O(n(n m) time complexity is known for nding the maximum overlap area for two convex polygons, one of which is allowed to rotate with one point on its boundary sliding on the other polygon s boundary [21] Mount et al. [18] studied the behavior of the area of overlap for two simple polygons under translations of one polygon. They pose the case of two convex polygons as an open problem. We consider the matching problem for convex polygons in the plane, and the rigid motions that we allow are translations. In other ....
D.M. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. SPIE Vision Geometry II,
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC