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

Authors

20

  1. SY
    Sung‐Eui Yoon

    Korea Advanced Institute of Science and Technology, South Korea

    2 publications · 52 citations

    2

    h-index

  2. KB
    Kevin Buchin

    Eindhoven University of Technology, Netherlands

    1 publications · 31 citations

    1

    h-index

  3. MB
    Maike Buchin

    Eindhoven University of Technology, Netherlands

    1 publications · 31 citations

    1

    h-index

  4. MG
    M. Gopi

    University of California, Irvine, United States

    1 publications · 12 citations

    1

    h-index

  5. HH
    Herman Haverkort

    Eindhoven University of Technology, Netherlands

    1 publications · 17 citations

    1

    h-index

1–5 of 20

Venues

  1. Computational Geometry

    2 publications · 49 citations

    2

    h-index

  2. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 40 citations

    1

    h-index

  3. Journal of graphics tools

    JGT · 1 publications · 10 citations

1–3