Arrangement Data Structures
Arrangement Data Structures is a geometric data organization scheme that systematically represents the planar subdivision induced by the relative positions and intersections of a finite set of geometric objects, distinguishing it from other spatial data structures by its explicit encoding of combinatorial adjacencies and incidence relationships among vertices, edges, and faces in an arrangement.
8
Publications
3.5K
Citations
11
Authors
7
Institutions
Publications per year
2017–2026
1
Parents
8
Ad-hoc top-k query answering for data streams
Gautam Das, Dimitrios Gunopulos, Nick Koudas et al. · 2007 · 85 citations
1–5 of 8
11
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
7
University of California, Riverside
Riverside, United States
1 h-index
1 publications
85 citations
Xinjiang University
Ürümqi, China
1 h-index
2 publications
32 citations
University of Kansas
Lawrence, United States
1 h-index
1 publications
17 citations
Stanford University
Stanford, United States
1 h-index
1 publications
10 citations

University of Toronto
Toronto, Canada
1 h-index
2 publications
170 citations
IBM (United States)
Armonk, United States
1 h-index
1 publications
18 citations
The University of Texas at Arlington
Arlington, United States
1 h-index
1 publications
85 citations
1–7 of 7
2 publications · 3.3K citations
2
h-index
Repository · 1 publications · 11 citations
1
h-index
1 publications · 16 citations
1
h-index
1 publications · 17 citations
1
h-index
1 publications · 18 citations
1
h-index
1–5