A hierarchical spatial data structure for global geographic information systems

Michael Goodchild, Yang Shiren

Research output: Contribution to journalArticle

137 Citations (Scopus)

Abstract

Hierarchical spatial data structures offer the distinct advantages of data compression and fast access, but are difficult to adapt to the globe. Following Dutton, we propose projecting the globe onto an octahedron and then recursively subdividing each of its eight triangular faces into four triangles. We provide procedures for addressing the hierarchy and for computing addresses in the hierarchical structure from latitude and longitude and vice versa. At any level in the hierarchy the finite elements are all triangles, but are only approximately equal in area and shape; we provide methods for computing area and for finding the addresses of neighboring triangles.

Original languageEnglish (US)
Pages (from-to)31-44
Number of pages14
JournalCVGIP: Graphical Models and Image Processing
Volume54
Issue number1
DOIs
StatePublished - Jan 1 1992
Externally publishedYes

Fingerprint

Data compression
spatial data
Geographic information systems
Data structures
compression
geographic information system
method
longitude

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A hierarchical spatial data structure for global geographic information systems. / Goodchild, Michael; Shiren, Yang.

In: CVGIP: Graphical Models and Image Processing, Vol. 54, No. 1, 01.01.1992, p. 31-44.

Research output: Contribution to journalArticle

@article{a3eb3902666849e28d70a3e9309048f4,
title = "A hierarchical spatial data structure for global geographic information systems",
abstract = "Hierarchical spatial data structures offer the distinct advantages of data compression and fast access, but are difficult to adapt to the globe. Following Dutton, we propose projecting the globe onto an octahedron and then recursively subdividing each of its eight triangular faces into four triangles. We provide procedures for addressing the hierarchy and for computing addresses in the hierarchical structure from latitude and longitude and vice versa. At any level in the hierarchy the finite elements are all triangles, but are only approximately equal in area and shape; we provide methods for computing area and for finding the addresses of neighboring triangles.",
author = "Michael Goodchild and Yang Shiren",
year = "1992",
month = "1",
day = "1",
doi = "10.1016/1049-9652(92)90032-S",
language = "English (US)",
volume = "54",
pages = "31--44",
journal = "CVGIP: Graphical Models and Image Processing",
issn = "1049-9652",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - A hierarchical spatial data structure for global geographic information systems

AU - Goodchild, Michael

AU - Shiren, Yang

PY - 1992/1/1

Y1 - 1992/1/1

N2 - Hierarchical spatial data structures offer the distinct advantages of data compression and fast access, but are difficult to adapt to the globe. Following Dutton, we propose projecting the globe onto an octahedron and then recursively subdividing each of its eight triangular faces into four triangles. We provide procedures for addressing the hierarchy and for computing addresses in the hierarchical structure from latitude and longitude and vice versa. At any level in the hierarchy the finite elements are all triangles, but are only approximately equal in area and shape; we provide methods for computing area and for finding the addresses of neighboring triangles.

AB - Hierarchical spatial data structures offer the distinct advantages of data compression and fast access, but are difficult to adapt to the globe. Following Dutton, we propose projecting the globe onto an octahedron and then recursively subdividing each of its eight triangular faces into four triangles. We provide procedures for addressing the hierarchy and for computing addresses in the hierarchical structure from latitude and longitude and vice versa. At any level in the hierarchy the finite elements are all triangles, but are only approximately equal in area and shape; we provide methods for computing area and for finding the addresses of neighboring triangles.

UR - http://www.scopus.com/inward/record.url?scp=0026454316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026454316&partnerID=8YFLogxK

U2 - 10.1016/1049-9652(92)90032-S

DO - 10.1016/1049-9652(92)90032-S

M3 - Article

AN - SCOPUS:0026454316

VL - 54

SP - 31

EP - 44

JO - CVGIP: Graphical Models and Image Processing

JF - CVGIP: Graphical Models and Image Processing

SN - 1049-9652

IS - 1

ER -