메뉴 건너뛰기




Volumn 44, Issue 2, 2011, Pages 110-120

Fréchet distance with speed limits

Author keywords

Fr chet distance; Speed constraints

Indexed keywords

APPLICATIONS; COMPUTATIONAL GEOMETRY;

EID: 78349311516     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2010.09.008     Document Type: Conference Paper
Times cited : (37)

References (14)
  • 2
    • 0003140383 scopus 로고
    • Computing the fréchet distance between two polygonal curves
    • H. Alt, M. Godau, Computing the Fréchet distance between two polygonal curves, Internat. J. Comput. Geom. Appl. 5 (1995) 75-91.
    • (1995) Internat. J. Comput. Geom. Appl. , vol.5 , pp. 75-91
    • Alt, H.1    Godau, M.2
  • 4
    • 0023271105 scopus 로고
    • Slowing down sorting networks to obtain faster sorting algorithms
    • R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM 34 (1) (1987) 200-208.
    • (1987) J. ACM , vol.34 , Issue.1 , pp. 200-208
    • Cole, R.1
  • 5
    • 45749097808 scopus 로고    scopus 로고
    • Geodesic fréchet distance inside a simple polygon
    • Proc. 25th Sympos. Theoret. Aspects Comput. Sci.
    • A.F. Cook, C. Wenk, Geodesic Fréchet distance inside a simple polygon, in: Proc. 25th Sympos. Theoret. Aspects Comput. Sci., in: Lecture Notes in Comput. Sci., vol. 5664, 2008, pp. 193-204.
    • (2008) Lecture Notes in Comput. Sci. , vol.5664 , pp. 193-204
    • Cook, A.F.1    Wenk, C.2
  • 6
    • 69949164192 scopus 로고    scopus 로고
    • Shortest path problems on a polyhedral surface
    • Proc. 11th Workshop Algorithms Data Struct.
    • A.F. Cook, C. Wenk, Shortest path problems on a polyhedral surface, in: Proc. 11th Workshop Algorithms Data Struct., in: Lecture Notes in Comput. Sci., vol. 5664, 2009, pp. 156-167.
    • (2009) Lecture Notes in Comput. Sci. , vol.5664 , pp. 156-167
    • Cook, A.F.1    Wenk, C.2
  • 7
    • 0036973020 scopus 로고    scopus 로고
    • New similarity measures between polylines with applications to morphing and polygon sweeping
    • DOI 10.1007/s00454-002-2886-1
    • A. Efrat, L.J. Guibas, S. Har-Peled, J.S.B. Mitchell, T.M. Murali, New similarity measures between polylines with applications to morphing and polygon sweeping, Discrete Comput. Geom. 28 (4) (2002) 535-569. (Pubitemid 36161397)
    • (2002) Discrete and Computational Geometry , vol.28 , Issue.4 , pp. 535-569
    • Efrat, A.1    Guibas, L.J.2    Har-Peled, S.3    Mitchell, J.S.B.4    Murali, T.M.5
  • 8
    • 44049091870 scopus 로고    scopus 로고
    • Protein structure-structure alignment with discete frechet distance
    • DOI 10.1142/S0219720008003278, PII S0219720008003278
    • M. Jiang, Y. Xu, B. Zhu, Protein structure-structure alignment with discrete Fréchet distance, J. Bioinform. Comput. Biol. 6 (1) (2008) 51-64. (Pubitemid 351711900)
    • (2008) Journal of Bioinformatics and Computational Biology , vol.6 , Issue.1 , pp. 51-64
    • Jiang, M.1    Xu, Y.2    Zhu, B.3
  • 10
    • 57349109010 scopus 로고    scopus 로고
    • On computing fréchet distance of two paths on a convex polyhedron
    • A. Maheshwari, J. Yi, On computing Fréchet distance of two paths on a convex polyhedron, in: Proc. 21st European Workshop Comput. Geom., 2005, pp. 41-44.
    • (2005) Proc. 21st European Workshop Comput. Geom. , pp. 41-44
    • Maheshwari, A.1    Yi, J.2
  • 11
    • 0020828745 scopus 로고
    • Applying parallel computation algorithms in the design of serial algorithms
    • N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (4) (1983) 852-865.
    • (1983) J. ACM , vol.30 , Issue.4 , pp. 852-865
    • Megiddo, N.1


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