Cache-oblivious Geometric Data Structures
Cache-Oblivious Geometric Data Structures is a class of geometric data structures designed to optimize memory access patterns across multiple levels of a memory hierarchy without explicit knowledge of cache parameters, by recursively partitioning geometric space in a way that inherently exploits spatial and temporal locality.
6
Publications
151
Citations
20
Authors
13
Institutions
Publications per year
2017–2026
0
6
Topraj Gurung, Jarek Rossignac · 2009 · 33 citations
Memory-constrained algorithms for simple polygons
Tetsuo Asano, Kevin Buchin, Maike Buchin et al. · Computational Geometry · 2013 · 31 citations · Full text
Lars Arge, Mark de Berg, Herman Haverkort · 2005 · 17 citations
1–5 of 6
20
Korea Advanced Institute of Science and Technology, South Korea
2 publications · 52 citations
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 20
13
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
3 publications
79 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
2 h-index
2 publications
52 citations
Institute of Electrical and Electronics Engineers
Piscataway, United States
1 h-index
1 publications
40 citations
FC Barcelona
Barcelona, Spain
1 h-index
1 publications
31 citations

University of Waterloo
Waterloo, Canada
1 h-index
2 publications
36 citations
Freie Universität Berlin
Berlin, Germany
1 h-index
2 publications
62 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
2 publications
66 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
1 publications
31 citations
1–8 of 13
2 publications · 49 citations
2
h-index
TVCG · 1 publications · 40 citations
1
h-index
JGT · 1 publications · 10 citations
1–3