Translating a planar object to maximize point containment

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

Volumn 2461, Issue , 2002, Pages 42-53

  Agarwal, Pankaj K ^a   Hagerup, Torben ^b   Ray, Rahul ^c   Sharir, Micha ^d,e   Smid, Michiel ^f   Welzl, Emo ^g  

^a Duke University   (United States)

^b GOETHE UNIVERSITY   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d TEL AVIV UNIVERSITY   (Israel)

^e NEW YORK UNIVERSITY   (United States)

^f CARLETON UNIVERSITY   (Canada)

^g ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY CONSTANTS; DETERMINISTIC ALGORITHMS; HIGH PROBABILITY; MONTE CARLO ALGORITHMS; NEAR-LINEAR TIME; OPTIMAL PLACEMENTS; POINT CONTAINMENT; RANDOM SAMPLING;

MONTE CARLO METHODS;

EID: 84938067527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_8     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri. Selecting distances in the plane. Algorithmica, 9:495-514, 1993. 52
2. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 705-706, 2000. 45
3. G. Barequet, M. Dickerson, and P. Pau. Translating a convex polygon to contain a maximum number of points. Comput. Geom. Theory Appl., 8:167-179, 1997. 43
4. H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 50-61, 1991. 46
5. H. Bronnimann, B. Chazelle, and J. Matousek. Product range spaces, sensitive sampling, and derandomization. SIAM J. Comput., 28:1552-1575, 1999. 51
6. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Com-put. Geom., 9:145-158, 1993. 44, 51
7. B. Chazelle and D.T. Lee. On a circle placement problem. Computing, 36:1-16, 1986. 43
8. A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for fc-point clustering problems. J. Algorithms, 19:474-503, 1995. 46
9. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Algorithms, 25:19-51, 1997. 46
10. A. Efrat, M. Sharir, and A. Ziv. Computing the smallest fc-enclosing circle and related problems. Comput. Geom. Theory Appl., 4:119-136, 1994. 43, 45
11. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321-350, 1994. 43
12. A. Gajentaan and M. H. Overmars. On a class of O(n2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165-185, 1995. 48
13. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Inform. Process. Lett., 33:305-308, 1990. 47
14. D.P. Huttenlocher and S. Ullman. Object recognition using alignment. In Proc. 1st Internat. Conf. Comput. Vision, pages 102-111, 1987. 43
15. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Com-put. Geom., 1:59-71, 1986. 45
16. Y. Lamdan, J. T. Schwartz, and H. J. Wolfson. Object recognition by affine invariant matching. In Proc.IEEE Internat.Conf. Comput.Vision Pattern. Recogn., pages 335-344, 1988. 43
17. H. P. Lenhof and M. Smid. Sequential and parallel algorithms for the fc closest pairs problem. Internat. J. Comput. Geom. Appl., 5:273-288, 1995. 46
18. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985. 45
19. O. Schwarzkopf, U. Fuchs, G. Rote, and E. Welzl. Approximation of convex figures by pairs of rectangles. Comput. Geom. Theory Appl., 10:77-87, 1998. 43, 52
20. M. Sharir. On c-sets in arrangements of curves and surfaces. Discrete Com-put. Geom., 6:593-613, 1991. 51