메뉴 건너뛰기




Volumn 181, Issue 1, 1997, Pages 3-15

Space-filling curves and their use in the design of geometric data structures

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; RECURSIVE FUNCTIONS; THEOREM PROVING;

EID: 0031190710     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00259-9     Document Type: Article
Times cited : (168)

References (22)
  • 2
    • 0020970242 scopus 로고
    • A data structure and algorithm based on a linear key for a rectangle retrieval problem
    • D.J. Abel and J.L. Smith, A data structure and algorithm based on a linear key for a rectangle retrieval problem, Computer Vision Graphics Image Processing 24 (1983) 1-13.
    • (1983) Computer Vision Graphics Image Processing , vol.24 , pp. 1-13
    • Abel, D.J.1    Smith, J.L.2
  • 3
    • 0346377982 scopus 로고
    • Optimal and approximate digital halftoning algorithms and their experimental evaluation
    • Extended Abstract, Osaka
    • T. Asano, A. Hasegawa, D. Ranjan and T. Roos, Optimal and approximate digital halftoning algorithms and their experimental evaluation, Extended Abstract, in: Proc. Asian Conf. on Computer Vision ACCV'93, Osaka, 1993.
    • (1993) Proc. Asian Conf. on Computer Vision ACCV'93
    • Asano, T.1    Hasegawa, A.2    Ranjan, D.3    Roos, T.4
  • 7
    • 0024089394 scopus 로고
    • Gray codes for partial match and range queries
    • C. Faloutsos, Gray codes for partial match and range queries, IEEE Trans. Software Eng. 14 (1988) 1381-1393.
    • (1988) IEEE Trans. Software Eng. , vol.14 , pp. 1381-1393
    • Faloutsos, C.1
  • 9
    • 0016353777 scopus 로고
    • Quad trees: A data structure for retrieval on composite keys
    • R.A. Finkel and J.L. Bentley, Quad trees: a data structure for retrieval on composite keys, Acta Inform. 4 (1974) 1-9.
    • (1974) Acta Inform. , vol.4 , pp. 1-9
    • Finkel, R.A.1    Bentley, J.L.2
  • 16
    • 0025446367 scopus 로고
    • A comparison of spatial query processing techniques for native and parameter spaces
    • Atlantic City, NJ
    • J.A. Orenstein, A comparison of spatial query processing techniques for native and parameter spaces, in: Proc. ACM SIGMOD Internat. Conf. on the Management of Data, Atlantic City, NJ (1990) 343-352.
    • (1990) Proc. ACM SIGMOD Internat. Conf. on the Management of Data , pp. 343-352
    • Orenstein, J.A.1
  • 19
    • 0019525462 scopus 로고
    • Multidimensional range search in dynamically balanced trees
    • H. Tropf and H. Herzog, Multidimensional range search in dynamically balanced trees, Angewandte Informatik 2 (1981) 71-77.
    • (1981) Angewandte Informatik , vol.2 , pp. 71-77
    • Tropf, H.1    Herzog, H.2


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