메뉴 건너뛰기




Volumn 2538, Issue , 2002, Pages 46-58

Modeling moving objects for location based services

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; INVESTMENTS; LOCATION; TELECOMMUNICATION SERVICES; TRAJECTORIES;

EID: 84949221000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36257-6_5     Document Type: Conference Paper
Times cited : (16)

References (13)
  • 6
    • 0001489753 scopus 로고
    • Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
    • D.H. Douglas and T. K Peucker Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Canad, Cartog. 10(2):112-122, Dec. 1973
    • (1973) Canad, Cartog , vol.10 , Issue.2 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2
  • 7
    • 84937476061 scopus 로고
    • Automated information distribution in bandwidth-constrained environments
    • S. Chamberlain. Automated information distribution in bandwidth-constrained environments. MILCON-94 conference, 1994
    • (1994) MILCON-94 Conference
    • Chamberlain, S.1
  • 8
    • 84949247189 scopus 로고
    • Model-based battle command: A paradigm whose time has come
    • Research & Technology, NDU, June
    • S. Chamberlain. Model-based battle command: A paradigm whose time has come. 1995 Symposium on C2 Research & Technology, NDU, June 1995
    • (1995) 1995 Symposium On
    • Chamberlain, S.1
  • 13
    • 0034420984 scopus 로고    scopus 로고
    • Efficient Algorithms for Approximating Polygonal Chains
    • P.K. Agarwal and K.R. Varadarajan. Efficient Algorithms for Approximating Polygonal Chains. Discrete Comput. Geom., 23:273-291(2000).
    • (2000) Discrete Comput. Geom. , vol.23 , pp. 273-291
    • Agarwal, P.K.1    Varadarajan, K.R.2


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