An incremental Hausdorff distance calculation algorithm

Proceedings of the VLDB Endowment

Volumn 4, Issue 8, 2011, Pages 506-517

  Nutanong, Sarana ^a   Jacox, Edwin H ^a   Samet, Hanan ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC SOLUTIONS; HAUSDORFF DISTANCE; MAX-MIN DISTANCE; MEASURE OF SIMILARITIES; NEAREST NEIGHBORS; SIMILARITY MEASURE; TOTAL RESPONSE; TRADITIONAL APPROACHES;

GEOMETRY;

EID: 84856465878     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2002974.2002978     Document Type: Article

References (29)

1. P. K. Agarwal, S. Har-Peled, M. Sharir, and Y. Wang. Hausdorff distance under translation for points and balls. In SCG, pages 282-291, 2003.
2. H. Alt, O. Aichholzer, and G. Rote. Matching shapes with a reference point. In SCG, pages 85-92, 1994.
3. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes (extended abstract). In SCG, pages 186-193, 1991.
4. C. And́ujar, P. Brunet, and D. Ayala. Topology-reducing surface simplification using a discrete solid representation. ACM Trans. Graph., 21(2):88-105, 2002.
5. W. G. Aref and I. F. Ilyas. An extensible index for spatial databases. In SSDBM, pages 49-58, 2001.
6. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, 1991.
7. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
8. N. Beckmann and B. Seeger. A revised R*-tree in comparison with related index structures. In SIGMOD, pages 799-812, 2009.
9. D. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. AAAI Workshop on Knowledge Discovery in Databases, pages 229-248, 1994.
10. L. Chen and R. Ng. On the marriage of lp-norms and edit distance. VLDB, pages 792-803, 2004.
11. L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. SIGMOD, pages 491-502, 2005.
12. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest pair queries in spatial databases. In SIGMOD, pages 189-200, 2000.
13. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
14. J. Hershberger and J. Snoeyink. Speeding up the douglas-peucker line-simplification algorithm. In Intl. Symp. on Spatial Data Handling, pages 134-143, 1992.
15. G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD, pages 237-248, 1998.
16. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
17. 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 SCG, pages 110-119, 1992.
18. D. P. Huttenlocher, G. A. Klanderman, and W. Rucklidge. Comparing images using the hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell., 15(9):850-863, 1993.
19. P. Indyk and S. Venkatasubramanian. Approximate congruence in nearly linear time. In SODA, pages 354-360, 2000.
20. E. J. Keogh and C. Ratanamahatana. Exact indexing of dynamic time warping. Knowl. Inf. Syst., 7(3):358-386, 2005.
21. P.-F. Marteau. Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans. Pattern Anal. Mach. Intell., 31(2):306-318, 2009.
22. D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui. Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst., 30(2):529-576, 2005.
23. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD, pages 71-79, 1995.
24. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, 2006.
25. H. Shin, B. Moon, and S. Lee. Adaptive multi-stage distance join processing. In SIGMOD, pages 343-354, 2000.
26. M. Vlachos, D. Gunopulos, and G. Kollios. Discovering similar multidimensional trajectories. In ICDE, pages 673-684, 2002.
27. C. Xia, H. Lu, B. C. Ooi, and J. Hu. Gorder: An efficient method for KNN join processing. In VLDB, pages 756-767, 2004.
28. Y. Zheng, Q. Li, Y. Chen, X. Xie, and W.-Y. Ma. Understanding mobility based on gps data. In UbiComp, pages 312-321, 2008.
29. Y. Zheng, L. Zhang, X. Xie, and W.-Y. Ma. Mining interesting locations and travel sequences from gps trajectories. In WWW, pages 791-800, 2009.