Computing the maximum overlap of two convex polygons under translations

Theory of Computing Systems

Volumn 31, Issue 5, 1998, Pages 613-628

  De Berg, M ^a   Cheong, O ^b   Devillers, O ^c   Van Kreveld, M ^a   Teillaud, M ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

CONVEX POLYGON; UPPER BOUND;

GEOMETRY;

EID: 0032394908     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/PL00005845     Document Type: Article

References (21)

1. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. In Proc. 3rd ACM-SIAM Symp. Discrete Algorithms, pages 72-82, 1992.
2. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. In Proc. 7th Ann. ACM Symp. Comput. Geom., pages 186-193, 1991.
3. H. Alt and M. Godau. Measuring the resemblance of polygonal curves. In Proc. 8th Ann. ACM Symp. Comput. Geom., pages 102-109, 1992.
4. D. Avis, P. Bose, T. Shermer, J. Snoeyink, G. Toussaint, and B. Zhu. On the sectional area of convex polytopes. In Proc. 12th Ann. ACM Symp. Comput. Geom., pages C-11-C-12, 1996.
5. F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. In Proc. 5th Symp. Theoret. Aspects Comput. Sci., pages 322-333. Volume 294 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1988.
6. B. Chazelle. The polygon containment problem. In F. P. Preparata, editor, Computational Geometry, pages 1-33. Volume 1 of Advances in Computing Research. JAI Press, London, 1983.
7. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SlAM J. Comput, 21(4):671-696, 1992.
8. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145-158, 1993.
9. L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. In Proc. 5th Canad. Conf. Comput. Geom., pages 151-156, 1993.
10. L. P. Chew and K. Kedem. Placing the largest similar copy of a convex polygon among polygonal obstacles. Comput. Geom. Theory Appl., 3(2):59-89, 1993.
11. S. J. Fortune. A fast algorithm for polygon containment by translation. In Proc. 12th Internat. Colloq. Automata Lang. Program., pages 189-198. Volume 194 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1985.
12. G. N. Frederickson and D. B. Johnson. Generalized selection and ranking: sorted matrices. SIAM J. Comput., 13:14-30, 1984.
13. B. Grübaum. Convex Polytopes. Wiley, New York, 1967.
14. D. Halperin. Algorithmic Motion Planning via Arrangements of Curves and of Surfaces. Ph.D. thesis, Computer Science Department, Tel-Aviv University, Tel Aviv, 1992.
15. D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. 8th Ann. ACM Symp. Comput. Geom., pages 110-120, 1992.
16. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267-291, 1993.
17. J.-C. Latombe. Robot Motion Planning. Kluwer, Boston, 1991.
18. D. M. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. SPIE Vision Geom. II, 2060:254-264, 1993.
19. D. Parson and C. Torras. The combinatorics of overlapping convex polygons in contact. In Proc. 4th Canad. Conf. Comput. Geom., pages 83-92, 1992.
20. M. Sharir, R. Cole, K. Kedem, D. Leven, R. Pollack, and S. Sifrony. Geometric applications of Davenport - Schinzel sequences. In Proc. 27th Ann. IEEE Symp. Found. Comput. Sci., pages 77-86, 1986.
21. R. Venkatasubramanian. On the area of intersection of two closed 2D objects. Inform. Sci., 82:25-44, 1995.