Computing the maximum overlap of two convex polygons under translations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 127-135

  de Berg, Mark ^a   Devillers, Olivier ^b   van Kreveld, Marc ^a   Schwarzkopf, Otfried ^c   Teillaud, Monique ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b INRIA   (France)

^c Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONVEX POLYGON; UPPER BOUND;

GEOMETRY;

EID: 84990232250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009488     Document Type: Conference Paper

References (20)

1. Pankaj K. Agarwal, Micha Sharir, and Sivan Toledo. Applications of parametric searching in geometric optimization. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 72-82, 1992.
2. H. Alt, B. Behrends, and J. BlSmer. Approximate matching of polygonal shapes. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 186-193, 1991.
3. H. Alt and M. Godau. Measuring the resemblance of polygonal curves, In Proc. 8th Annu. ACM Sympos. 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 Annu. ACM Sympos. Comput. Geom., pages C11-C12, 1996.
5. F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. In Proc. 5th Sympos. Theoret. Aspects Comput. Sci., volume 294 of Lecture Notes in Computer Science, pages 322-333. Springer-Verlag, 1988.
6. B. Chazelle. The polygon containment problem. In F. P. Preparata, editor, Computational Geometry, volume 1 of Advances in Computing Research, pages 1-33. JAI Press, London, England, 1983.
7. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM 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, Waterloo, Canada, 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., volume 194 of Lecture Notes in Computer Science, pages 189-198. Springer-Verlag, 1985.
12. G. Frederickson and D. Johnson. Generalized selection and ranking: sorted matrices. SIAM J. Comput., 13:14-30, 1984.
13. B. Griinbaum. Convex Polytopes. Wiley, New York, NY, 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 Annu. ACM Sympos. 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 Academic Publishers, Boston, 1991.
18. D.M. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. SPIE Vision Geometry II, 2060:254-264, 1993.
19. M. Sharir, R. Cole, K. Kedem, D. Leven, R. Pollack, and S. Sifrony. Geometric applications of Davenport-Schinzel sequences. In Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., pages 77-86, 1986.
20. R. Venkatasubramanian. On the area of intersection of two closed 2D objects. Information Sciences, 82:25-44, 1995.