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

Authors

11

  1. MH
    M.O. Hill

    Technion – Israel Institute of Technology, Israel

    3 publications · 6.5K citations

    2

    h-index

  2. EF
    Efi Fogel

    Tel Aviv University, Israel

    1 publications · 11 citations

    1

    h-index

  3. DG
    Dimitrios Gunopulos

    University of California, Riverside, United States

    1 publications · 85 citations

    1

    h-index

  4. MH
    Michael H. Goldwasser

    Saint Louis University, United States

    1 publications · 10 citations

    1

    h-index

  5. NS
    Nikos Sarkas

    University of Toronto, Canada

    1 publications · 85 citations

    1

    h-index

1–5 of 11

Venues

  1. Medical Entomology and Zoology

    2 publications · 3.3K citations

    2

    h-index

  2. ArXiv.org

    Repository · 1 publications · 11 citations

    1

    h-index

  3. Applied Mathematics and Computation

    1 publications · 16 citations

    1

    h-index

  4. Pattern Recognition

    1 publications · 17 citations

    1

    h-index

  5. Information Sciences

    1 publications · 18 citations

    1

    h-index

1–5