Translating a convex polygon to contain a maximum number of points

Computational Geometry: Theory and Applications

Volumn 8, Issue 4, 1997, Pages 167-179

  Barequet, Gill ^a   Dickerson, Matthew ^b   Pau, Petru ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MIDDLEBURY COLLEGE   (United States)

^c WEST UNIVERSITY OF TIMISOARA   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347551311     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00011-9     Document Type: Article

References (15)

1. B. Chazelle, The polygon placement problem, in: F. Preparata, ed., Advances in Computing Research 1 (JAI Press, 1983) 1-34.
2. S. Chandran and D. Mount, A parallel algorithm for enclosed and enclosing triangles, Internat. J. Comput. Geom. Appl. 2 (2) (1992) 191-214.
3. M. Dickerson and D. Scharstein, Optimal placement of convex polygons to maximize point containment, in: Proc. 7th ACM-SIAM Symp. Discrete Algorithms 1996, to appear.
4. D. Eppstein and J. Erickson, Iterated nearest neighbors and finding minimal polytopes, Discrete Comput. Geom. 11 (1994) 321-350.
5. A. Efrat, M. Sharir and A. Ziv, Computing the smallest k-enclosing circle and related problems, Computational Geometry 4 (1994) 119-136.
6. D.P. Huttenlocher and S. Ullman, Object recognition using alignment, in: Proc. 1st Internat. Conf. Computer Vision (IEEE Computer Science Press, 1987) 102-111.
7. V. Klee and M.L. Laskowski, Finding the smallest triangles containing a given convex polygon, J. Algorithms 6 (1985) 359-375.
8. D. Kirkpatrick and J. Snoeyink, Tentative prune-and-search for computing fixed-points with applications to geometric computing, in: Proc. 9th ACM Symp. Comput. Geom. (1993) 133-142.
9. H.P. Lenhof and M. Smid, Sequential and parallel algorithms for the k closest pairs problem, Internat. J. Comput. Geom. Appl. 5 (1995) 273-288.
10. Y. Lamdan, J.T. Schwartz and H.J. Wolfson, Object recognition by affine invariant matching, in: Proc. IEEE Conf. on Computer Vision and Pattern Recognition (IEEE Computer Science Press, 1988).
11. J. O'Rourke, A. Aggarwal, S. Maddila and M. Baldwin, An optimal algorithm for finding minimal enclosing triangles, J. Algorithms 7 (1986) 258-269.
12. M.H. Overmars and C.K. Yap, New upper bounds in Klee's measure problem, SIAM J. Comput. 20 (1991) 1034-1045.
13. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, Berlin, 1985).
14. M. Sharir, On k-sets in arrangements of curves and surfaces, Discrete Comput. Geom. 6 (1991) 593-613.
15. G.T. Toussaint, Solving geometric problems with the rotating calipers, in: Proc. IEEE MELECON (1983).