The directed hausdorff distance between imprecise point sets

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

Volumn 5878 LNCS, Issue , 2009, Pages 720-729

  Knauer, Christian ^a   Löffler, Maarten ^b   Scherfenberg, Marc ^a   Wolle, Thomas ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

HAUSDORFF DISTANCE; LOWER BOUNDS; NP-HARD; POINT SET; RUNNING TIME;

COMPUTATIONAL COMPLEXITY; GEOMETRY;

APPROXIMATION ALGORITHMS;

EID: 75649097834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_73     Document Type: Conference Paper

References (14)

1. Alt, H., Behrends, B., Blömer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251-266 (1995)
2. Alt, H., Guibas, L.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey. In: Handbook on Computational Geometry, pp. 251-265 (1995)
3. Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th Ann. ACM Symp. on Theory of Comp., pp. 434-444 (1988)
4. Fortune, S.J.: A sweepline algorithm for Voronoi diagrams. Algorithmica 2, 153-174 (1987)
5. Goodrich, M.T., Mitchell, J.S.B., Orletsky, M.W.: Practical methods for approximate geometric pattern matching under rigid motion. In: Proc. 10th Annu. ACM Sympos. Comput. Geom, pp. 103-112 (1994)
6. Goodrich, M.T., Snoeyink, J.: Stabbing parallel segments with a convex polygon. Comput. Vision Graph. Image Process. 49, 152-170 (1990)
7. Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th Annu. ACM Sympos. Comput. Geom, pp. 208-217 (1989)
8. Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Comput. Geom. Theory Appl. 4, 137-156 (1994)
9. Knauer, C., Löffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets (Preprint, 2009), http://arXiv.org/abs/0909.4642
10. Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329-343 (1982)
11. Mukhopadhyay, A., Greene, E., Rao, S.V.: On intersecting a set of isothetic line segments with a convex polygon of minimum area. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part I. LNCS, vol. 4705, pp. 41-54. Springer, Heidelberg (2007)
12. Mukhopadhyay, A., Kumar, C., Greene, E., Bhattacharya, B.: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Proc. Let. 105(2), 58-64 (2008)
13. Nagai, T., Tokura, N.: Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. In: Japanese Conference on Discrete and Computational Geometry, pp. 252-263 (2000)
14. van Kreveld, M., Löffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 446-457. Springer, Heidelberg (2007)