J. Mitchell. Comment at MSI Workshop, October 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Containment Algorithms for Nonconvex Polygons with Applications.. - Daniels (1995) (11 citations) (Correct)
....of U hi (U hj u ji ) is maximized. If U hi and U jh are simple polygons with a and b vertices, respectively, then the optimal u ij can be found exactly in polynomial time using a brute force configuration space method, by solving O(a 2 b 2 ) two dimensional convex optimization problems [Mit94]. Solutions to some closely related problems often provide large intersection area in practice. One possibility is to align the centroids of the polygons. Another is to maximize the Hausdorff distance between the polygons. An inexpensive approximation to this is given in [ABB91] Their result ....
J. Mitchell. Comment at MSI Workshop, October 1994.
Multiple Translational Containment Part I: An Approximate.. - Daniels, Milenkovic (1995) (1 citation) (Correct)
....of U 0i (U 0j u ji ) is maximized. If U 0i and U j0 are simple polygons with a and b vertices, respectively, then the optimal u ij can be found exactly in polynomial time using a brute force configuration space method, by solving O(a 2 b 2 ) two dimensional convex optimization problems [27]. Solutions to some closely related problems often provide large intersection area in practice. One possibility is to align the centroids of the polygons. Another is to maximize the Hausdorff distance between the polygons. An inexpensive approximation to this is given in [1] That result states ....
J. Mitchell. Comment at MSI Workshop, October 1994.
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