메뉴 건너뛰기




Volumn 43, Issue 6, 2011, Pages 687-698

Polyline approach for approximating Hausdorff distance between planar free-form curves

Author keywords

Free form curves; Hausdorff distance; Polylines; Pruning; Voronoi diagram

Indexed keywords

FREE FORM CURVE; HAUSDORFF DISTANCE; POLYLINES; PRUNING; VORONOI DIAGRAMS;

EID: 79953044483     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2011.02.008     Document Type: Article
Times cited : (36)

References (38)
  • 4
    • 21144453588 scopus 로고    scopus 로고
    • Comparison of distance measures for planar curves
    • DOI 10.1007/s00453-003-1042-5
    • H. Alt, C. Knauer, and C. Wenk Comparison of distance measures for planar curves Algorithmica 38 1 2003 45 58 (Pubitemid 40877160)
    • (2003) Algorithmica (New York) , vol.38 , Issue.1 , pp. 45-58
    • Alt, H.1    Knauer, C.2    Wenk, C.3
  • 6
    • 0011981779 scopus 로고    scopus 로고
    • Discrete geometric shapes: Matching, interpolation, and approximation: A survey
    • EVL-1996-142. Berlin. Institute of Computer Science. Freie Universitàä;t
    • Alt H, Guibas LJ. Discrete geometric shapes: matching, interpolation, and approximation: a survey. tech. Rep. B 96-11, EVL-1996-142. Berlin. Institute of Computer Science. Freie Universitàt.
    • Tech. Rep. B 96-11
    • Alt, H.1    Guibas, L.J.2
  • 8
    • 40649112821 scopus 로고    scopus 로고
    • Text image matching without language model using a Hausdorff distance
    • H.J. Son, S.H. Kim, and J.S. Kim Text image matching without language model using a Hausdorff distance Information Processing & Management 44 3 2008 1189 1200
    • (2008) Information Processing & Management , vol.44 , Issue.3 , pp. 1189-1200
    • Son, H.J.1    Kim, S.H.2    Kim, J.S.3
  • 18
    • 10644296951 scopus 로고    scopus 로고
    • Computing the Hausdorff Distance of Geometric Patterns and Shapes
    • Discrete and Computational Geometry: The Goodman-Pollack Festschrift
    • H. Alt, P. Braß, M. Godau, C. Knauer, and C. Wenk Computing the Hausdorff distance of geometric patterns and shapes Discrete & Computational Geometry 25 2003 65 76 (Pubitemid 36795469)
    • (2003) ALGORITHMS AND COMBINATORICS , vol.25 , pp. 65-76
    • Alt, H.1    Brass, P.2    Godau, M.3    Knauer, C.4    Wenk, C.5
  • 19
    • 0030500847 scopus 로고    scopus 로고
    • Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
    • W.J. Rucklidge Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation Discrete & Computational Geometry 16 1996 135 153 (Pubitemid 126317746)
    • (1996) Discrete and Computational Geometry , vol.16 , Issue.2 , pp. 135-153
    • Rucklidge, W.J.1
  • 22
    • 70449758952 scopus 로고
    • Computation of the Hausdorff distance between plane vector polylines
    • Hangout JF. Computation of the Hausdorff distance between plane vector polylines. In: AUTO-CARTO 12. 1995. p. 110.
    • (1995) AUTO-CARTO 12 , pp. 1-10
    • Hangouët, J.F.1
  • 23
    • 0021098062 scopus 로고
    • A linear time algorithm for computing the Hausdorff distance between convex polygons
    • M.J. Atallah A linear time algorithm for computing the Hausdorff distance between convex polygons Information Processing Letters 17 4 1983 207 209
    • (1983) Information Processing Letters , vol.17 , Issue.4 , pp. 207-209
    • Atallah, M.J.1
  • 24
    • 70349656317 scopus 로고    scopus 로고
    • Interactive Hausdorff distance computation for general polygonal models
    • M. Tang, M. Lee, and Y.J. Kim Interactive Hausdorff distance computation for general polygonal models ACM Transactions on Graphics 28 3 2009 1 9
    • (2009) ACM Transactions on Graphics , vol.28 , Issue.3 , pp. 1-9
    • Tang, M.1    Lee, M.2    Kim, Y.J.3
  • 26
    • 0010359261 scopus 로고    scopus 로고
    • Calculating the Hausdorff distance between curves
    • B. Eugene, and C. Carlos Calculating the Hausdorff distance between curves Information Processing Letters 64 1 1997 17 22
    • (1997) Information Processing Letters , vol.64 , Issue.1 , pp. 17-22
    • Eugene, B.1    Carlos, C.2
  • 27
    • 0141758654 scopus 로고    scopus 로고
    • Bounding the Hausdorff distance of implicitly defined and/or parametric curves
    • Jttler B. Bounding the Hausdorff distance of implicitly defined and/or parametric curves. In: Mathematical methods for curves and surfaces. 2000. p. 22332.
    • (2000) Mathematical Methods for Curves and Surfaces , pp. 223-232
    • Jttler, B.1
  • 30
    • 79955754429 scopus 로고    scopus 로고
    • IRIT
    • Elber G. IRIT. http://www.cs.technion.ac.il/~irit/.
    • Elber, G.1
  • 31
    • 79955781297 scopus 로고    scopus 로고
    • Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer
    • Y.-J. Kim, Y.-T. Oh, S.-H. Yoon, M.-S. Kim, and G. Elber Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer The Visual Computer 26 68 2010 1007 1016
    • (2010) The Visual Computer , vol.26 , Issue.6-8 , pp. 1007-1016
    • Kim, Y.-J.1    Oh, Y.-T.2    Yoon, S.-H.3    Kim, M.-S.4    Elber, G.5
  • 32
    • 77957919105 scopus 로고    scopus 로고
    • Computing the Hausdorff distance between two B-spline curves
    • X.D. Chen, W.Y. Ma, G. Xu, and J.-C. Paul Computing the Hausdorff distance between two B-spline curves Computer Aided Design 42 12 2010 1197 1206
    • (2010) Computer Aided Design , vol.42 , Issue.12 , pp. 1197-1206
    • Chen, X.D.1    Ma, W.Y.2    Xu, G.3    Paul, J.-C.4
  • 34
    • 0019032952 scopus 로고
    • Inserting new knots into B-Spline curves
    • W. Boehm Inserting new knots into B-Spline curves Computer Aided Design 12 1980 199 201 (Pubitemid 11445726)
    • (1980) CAD Computer Aided Design , vol.12 , Issue.4 , pp. 199-201
    • Boehm Wolfgang1
  • 36
    • 77955473436 scopus 로고    scopus 로고
    • Completeness and total boundedness of the Hausdorff metric
    • J. Henrikson Completeness and total boundedness of the Hausdorff metric MIT Undergraduate Journal of Mathemetics 1 1999 69 79
    • (1999) MIT Undergraduate Journal of Mathemetics , vol.1 , pp. 69-79
    • Henrikson, J.1
  • 37


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.