메뉴 건너뛰기




Volumn , Issue , 2001, Pages 142-147

Fast spatial clustering with different metrics and in the presence of obstacles

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DATA MINING; GRAPH THEORY;

EID: 0035758233     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512161.512193     Document Type: Conference Paper
Times cited : (15)

References (28)
  • 2
    • 0003490458 scopus 로고
    • Spatial data analysis with GIS: An introduction to application in the social sciences
    • T. Report 92-10, NCGIA, U. California
    • (1992)
    • Anselin, L.1
  • 10
    • 4244187545 scopus 로고    scopus 로고
    • Fast spatial clustering with different metrics and in the presence of obstacles
    • T. Report 2001-02. D. of CS & SE. U. of Newcastle
    • Estivill-Castro, V.1    Lee, I.2
  • 11
    • 0010337969 scopus 로고
    • Computing delaunay triangulations in Manhattan and maximum metric
    • T. Report 94.124, Institut für Informatik, Universität zu Köln
    • (1994)
    • Jünger, M.1    Kaibel, V.2    Thienel, S.3
  • 14
    • 84976713672 scopus 로고
    • The delauney triangulation closely approximates the complete graph
    • LNCS 382
    • (1989) WADS-89 , pp. 47-56
    • Keil, M.1    Gutwin, G.2
  • 20


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