Hausdorff distance under translation for points and balls

ACM Transactions on Algorithms

Volumn 6, Issue 4, 2010, Pages

  Agarwal, Pankaj K ^a   Har Peled, Sariel ^b   Sharir, Micha ^c,d   Wang, Yusu ^e  

^a Duke University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

^e The Ohio State University   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

1-MEDIAN; DYNAMIC DATA STRUCTURE; FAST ALGORITHMS; HAUSDORFF DISTANCE; INSERTIONS AND DELETIONS; POINT SET; ROOT MEAN SQUARES; SHAPE MATCHING; STANDARD SETTING; THEORY; TWO-POINT;

DATA STRUCTURES; GEOMETRY; SPHERES;

APPROXIMATION ALGORITHMS;

EID: 77956556230     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1824777.1824791     Document Type: Conference Paper

References (27)

1. AGARWAL, P. K., HAR-PELED, S., AND VARADARAJAN, K. R. 2004. Approximating extent measures of points. J. Assoc. Comput. Mach. 51, 4, 606-635.
2. AGARWAL, P. K. AND MATOUSEK, J. 1993. Ray shooting and parametric search. SIAM J. Comput. 22, 540-570.
3. AGARWAL, P. K., SHARIR, M., AND TOLEDO, S. 1994. Applications of parametric searching in geometric optimization. J. Algor. 17, 292-318.
4. AlCHHOLZER, O., ALT, H., AND ROTE, G. 1997. Matching shapes with a reference point. Int. J. Comput. Geom. Appl. 7, 349-363. (Pubitemid 127528038)
5. ALT, H., BEHRENDS, B., AND BLOMER, J. 1995. Approximate matching of polygonal shapes. Ann. Math. Artif.Intell. 13, 251-266.
6. ALT, H., BRASS, P., GODAU, M., KNAUER, C., AND WENK, C. 2003. Computing the Hausdorff distance of geometric patterns and shapes. In Discrete and Computational Geometry-The Goodman-Pollack Festchrift, B. Aronov, S. Basu, J. Pach, and M. Sharir, Eds. Springer-Verlag, Berlin, 65-76.
7. ALT, H. ANDGUIBAS, L. J. 2000. Discrete geometric shapes: Matching, interpolation, and approximation. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds. Elsevier Science Publishers B. V. North-Holland, Amsterdam, 121-153.
8. AMENTA, N. AND KOLLURI, R. 2001. The medial axis of a union of balls. Comput. Geom. Theory Appl. 20, 25-37.
9. AMIR, A., PORAT, E., AND LEWENSTEIN, M. 2001. Approximate subset matching with Don't Cares. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. 305-306.
10. ARYA, S. AND MALAMATOS, T. 2002. Linear-Size approximate Voronoi diagrams. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms. 147-155.
11. ARYA, S., MOUNT, D.M., NETANYAHU, N. S., SILVERMAN, R., AND WU, A. Y. 1998. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. Assoc. Comput. Mach. 45, 6, 891-923.
12. ATALLAH, M. J. 1983. A linear time algorithm for the Hausdorff distance between convex polygons. Inf. Process. Lett. 17, 207-209.
13. CARDOZE, D. AND SCHULMAN, L. 1998. Pattern matching for spatial point sets. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. 156-165.
14. CHEW, L.P., DOR, D., EFRAT, A., AND KEDEM, K. 1999. Geometric pattern matching in d-dimensional space. Discr. Comput. Geom. 21, 257-274.
15. CHEW, L.P., GOODRICH, M.T., HUTTENLOCHER, D.P., KEDEM, K., KLEINBERG, J.M., AND KRAVETS, D. 1997. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl. 7, 113-124.
16. GoODRICH, M.T., MITCHELL, J.S.B., AND ORLETSKY, M. W. 1994. Practical methods for approximate geometric pattern matching under rigid motion. In Proceedings of the 10th Annual ACM Symposium on Computational Geometry. 103-112.
17. HALPERIN, I., MA, B., WOLFSON, H., AND NUSSINOV, R. 2002. Principles of docking: An overview of search algorithms and a guide to scoring functions. Proteins: Structure, Function, and Genetics 47, 409-443.
18. HAR-PELED, S. 2001. A replacement for Voronoi diagrams of near linear size. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. 94-103.
19. HAR-PELED, S. 2005. Class notes on compressed quadtrees. Computer Science Dept, University of Illinois. http://valis.cs.uiuc.edu/~sariel/teach/2004/a- aprx/lec/.
20. HAR-PELED, S. AND MAZUMDAR, S. 2004. Coresets for k-means and k-median clustering and their applications. In Proceedings of the 36th Annual ACM Symposium on Theory Computing. 291-300.
21. HUTTENLOCHER, D.P., KEDEM, K., AND SHARIR, M. 1993. The upper envelope of Voronoi surfaces and its applications. Discr. Comput. Geom. 9, 267-291.
22. INDYK, P., MOTWANI, R., AND VENKATASUBRAMANIAN, S. 1999. Geometric matching under noise: Combinatorial bounds and algorithms. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms. 457-465.
23. KEDEM, K., LIVNE, R., PACH, J., AND SHARIR, M. 1986. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discr. Comput. Geom. 1, 59-71.
24. MEGIDDO, N. 1983. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30, 4, 852-865.
25. SARNAK, N. AND TARJAN, R. E. 1986. Planar point location using persistent search trees. Comm. ACM 29, 7, 669-679.
26. SEEGER, S. AND LABOUREUX, X. 2002. Feature extraction and registration: An overview. In Principles of 3D Image Analysis andSynthesis. Kluwer Academic Publishers, 153-166.
27. SHARIR, M. AND AGARWAL, P. K. 1995. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, UK.