메뉴 건너뛰기




Volumn 4040 LNCS, Issue , 2006, Pages 415-429

Shortest paths in a cuboidal world

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LARGE SCALE SYSTEMS; MODIFICATION; PROBLEM SOLVING;

EID: 33746257417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11774938_33     Document Type: Conference Paper
Times cited : (4)

References (22)
  • 1
    • 0036647192 scopus 로고    scopus 로고
    • Digital curves in 3D space and a linear-time length estimation algorithm
    • T. Bülow and R. Klette. Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intell., 24:962-970, 2002.
    • (2002) IEEE Trans. Pattern Analysis Machine Intell. , vol.24 , pp. 962-970
    • Bülow, T.1    Klette, R.2
  • 7
    • 0032071499 scopus 로고    scopus 로고
    • Length estimation in 3-D using cube quantization
    • A. Jonas and N. Kiryati. Length estimation in 3-D using cube quantization, J. Math. Imaging and Vision, 8: 215-238, 1998.
    • (1998) J. Math. Imaging and Vision , vol.8 , pp. 215-238
    • Jonas, A.1    Kiryati, N.2
  • 9
    • 33646161125 scopus 로고    scopus 로고
    • Critical edges in simple cube-curves
    • LNCS 1953, Springer, Berlin
    • R. Klette and T. Bülow. Critical edges in simple cube-curves. In Proc. Discrete Geometry Comp. Imaging, LNCS 1953, pages 467-478, Springer, Berlin, 2000.
    • (2000) Proc. Discrete Geometry Comp. Imaging , pp. 467-478
    • Klette, R.1    Bülow, T.2
  • 11
    • 35048848942 scopus 로고    scopus 로고
    • Minimum-length polygon of a simple cube-curve in 3D space
    • LNCS 3322, Springer, Berlin
    • F. Li and R. Klette. Minimum-length polygon of a simple cube-curve in 3D space. In Proc. Int. Workshop Combinatorial Image Analysis, LNCS 3322, pages 502-511, Springer, Berlin, 2004.
    • (2004) Proc. Int. Workshop Combinatorial Image Analysis , pp. 502-511
    • Li, F.1    Klette, R.2
  • 12
    • 24344454366 scopus 로고    scopus 로고
    • The class of simple cube-curves whose MLPs cannot have vertices at grid points
    • LNCS 3429, Springer, Berlin
    • F. Li and R. Klette. The class of simple cube-curves whose MLPs cannot have vertices at grid points. In Proc. Discrete Geometry Computational Imaging, LNCS 3429, pages 183-194, Springer, Berlin, 2005.
    • (2005) Proc. Discrete Geometry Computational Imaging , pp. 183-194
    • Li, F.1    Klette, R.2
  • 13
    • 33646142546 scopus 로고    scopus 로고
    • Minimum-length polygons of first-class simple cube-curve
    • LNCS 3691, Springer, Berlin
    • F. Li and R. Klette. Minimum-Length Polygons of First-Class Simple Cube-Curve. In Proc. Computer Analysis Images Patterns, LNCS 3691, pages 321-329, Springer, Berlin, 2005.
    • (2005) Proc. Computer Analysis Images Patterns , pp. 321-329
    • Li, F.1    Klette, R.2
  • 14
    • 33746243093 scopus 로고    scopus 로고
    • Analysis of the rubberband algorithm
    • Computer Science Department, The University of Auckland, Auckland, New Zealand
    • F. Li and R. Klette. Analysis of the rubberband algorithm. Technical Report CITR-TR-175, Computer Science Department, The University of Auckland, Auckland, New Zealand, 2006 (www.citr.auckland.ac.nz).
    • (2006) Technical Report , vol.CITR-TR-175
    • Li, F.1    Klette, R.2
  • 15
    • 0344896737 scopus 로고    scopus 로고
    • Motion for humanoid walking in a layered environment
    • T.-Y, Li, P.-F. Chen, and P.-Z. Huang. Motion for humanoid walking in a layered environment. In Proc. Conf. Robotics Automation, Volume 3, pages 3421-3427, 2003.
    • (2003) Proc. Conf. Robotics Automation , vol.3 , pp. 3421-3427
    • Li, T.-Y.1    Chen, P.-F.2    Huang, P.-Z.3
  • 16
    • 0036450860 scopus 로고    scopus 로고
    • Rubberband: An improved graph search algorithm for interactive object segmentation
    • H. Luo and A. Eleftheriadis. Rubberband: an improved graph search algorithm for interactive object segmentation. In Proc. Int. Conf. Image Processing, Volume 1, pages 101-104, 2002.
    • (2002) Proc. Int. Conf. Image Processing , vol.1 , pp. 101-104
    • Luo, H.1    Eleftheriadis, A.2
  • 19
    • 0002092264 scopus 로고    scopus 로고
    • On approximation of planar one-dimensional grid continua
    • R. Klette, A. Rosenfeld, and F. Sloboda, editors, Springer, Singapore
    • F. Sloboda, B. Zatko, and J. Stoer. On approximation of planar one-dimensional grid continua. In R. Klette, A. Rosenfeld, and F. Sloboda, editors, Advances in Digital and Computational Geometry, pages 113-160. Springer, Singapore, 1998.
    • (1998) Advances in Digital and Computational Geometry , pp. 113-160
    • Sloboda, F.1    Zatko, B.2    Stoer, J.3
  • 20
    • 21844463661 scopus 로고    scopus 로고
    • Circular shortest path on regular grids
    • CSIRO Math. Information Sciences, Australia
    • C. Sun and S. Pallottino. Circular shortest path on regular grids. CSIRO Math. Information Sciences, CMIS Report No. 01/76, Australia, 2001.
    • (2001) CMIS Report No. 01/76 , vol.1 , Issue.76
    • Sun, C.1    Pallottino, S.2
  • 21
    • 33746193705 scopus 로고    scopus 로고
    • A dynamical programming solution for shortest path itineraries in robotics
    • M. Talbot. A dynamical programming solution for shortest path itineraries in robotics. Electr. J. Undergrad. Math., 9:21-35, 2004.
    • (2004) Electr. J. Undergrad. Math. , vol.9 , pp. 21-35
    • Talbot, M.1


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