Maximizing the area of overlap of two unions of disks under rigid motion

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

Volumn 3111, Issue , 2004, Pages 138-149

  De Berg, Mark ^a   Cabello, Sergio ^b   Giannopoulos, Panos ^c   Knauer, Christian ^d   Van Oostrum, René ^c   Veltkamp, Remco C ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

^c UTRECHT UNIVERSITY   (Netherlands)

^d FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

NON-EMPTY INTERSECTIONS; RIGID MOTIONS; UNIT DISK;

APPROXIMATION ALGORITHMS;

EID: 35048828890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_13     Document Type: Article

References (13)

1. P. K. Agarwal, S. Har-Peled, M. Sharir, and Y. Wang. Hausdorff distance under translation for points, disks, and balls. In Proceedings of the 19th Annual ACM Symposium on Computational Geometry, pages 282-291, 2003.
2. T. Akutsu, H. Tamaki, and T. Tokuyama. Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discrete and Computational Geometry, 20(3):307-331, 1998.
3. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Algorithmica, 21:89-103, 1998.
4. H. Alt and L. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In J.R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 121-153. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.
5. N. Amenta and R. Kolluri. Accurate and efficient unions of balls. In Proceedings of the 16th Annual ACM Symposium on Computational Geometry, pages 119-128, 2000.
6. O. Cheong, A. Efrat, and S. Har-Peled. On finding a guard that sees most and a shop that sells most. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 1098-1107, 2004.
7. P. Chew, M. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under euclidean motion. Computational Geometry: Theory and Applications, 7:113-124, 1997.
8. M. de Berg, O. Devillers, M. van Kreveld, O. Schwarzkopf, and M. Teillaud. Computing the maximum overlap of two convex polygons under translations. Theory Comput. Systems, 31:613-628, 1998.
9. M. Gavrilov, P. Indyk, R. Motwani, and S. Venkatasubramanian. Combinatorial and experimental methods for approximate point pattern matching. Algorithmica, 38(2):59-90, 2003.
10. D. Halperin and M. H. Overmars. Spheres, molecules, and hidden surface removal. Computational Geometry: Theory and Applications, 11(2):83-102, 1998.
11. D. M. Mount, R. Silverman, and A. Y. Wu. On the area of overlap of translated polygons. Computer Vision and Image Understanding, 64:53-61, 1996.
12. J. O'Rourke and N. Badler. Decomposition of three dimensional objects into spheres. IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI), 1(3):295-305, July 1979.
13. V. Ranjan and A. Fournier. Matching and interpolation of shapes using unions of circles. Computer Graphics Forum, 15(3):129-142, August 1996.