Polygon-based Data Structures
Polygon-Based Data Structures is a geographic data structure that organizes spatial information using polygons as the fundamental geometric unit, distinguished by its explicit representation of areal phenomena through bounded, contiguous regions defined by ordered sequences of vertices.
43
Publications
2K
Citations
92
Authors
48
Institutions
Publications per year
2017–2026
7
Parents
43
Storing a collection of polygons using quadtrees
Hanan Samet, Robert E. Webber · ACM Transactions on Graphics · 1985 · 182 citations · Full text
OpenMesh: A Generic and Efficient Polygon Mesh Data Structure
Mario Botsch, Stefan Steinberg, Stefan Bischoff et al. · 2002 · 155 citations
Dan E. Willard · SIAM Journal on Computing · 1982 · 112 citations
1–5 of 43
92
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 92
48
Kansai University
Suita, Japan
3 h-index
7 publications
832 citations

Hokkaido University
Sapporo, Japan
2 h-index
2 publications
30 citations
University of Houston
Houston, United States
2 h-index
7 publications
88 citations
State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing
Wuhan, China
1 h-index
1 publications
85 citations
Ericsson (Sweden)
Kista, Sweden
1 h-index
1 publications
15 citations
Universität Hamburg
Hamburg, Germany
1 h-index
2 publications
20 citations
California Institute of Technology
Pasadena, United States
1 h-index
1 publications
10 citations
Ericsson (Finland)
Kirkkonummi, Finland
1 h-index
1 publications
15 citations
1–8 of 48
2 publications · 99 citations
2
h-index
2 publications · 338 citations
2
h-index
2 publications · 28 citations
2
h-index
1 publications · 35 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1–5