Vertical Decomposition

Vertical Decomposition is a computational geometry method that partitions a plane containing an arrangement of curves into vertical trapezoidal or rectangular cells by drawing vertical segments through each vertex, thereby simplifying point location queries by reducing the complexity of navigating curved structures.

37

Publications

3.1K

Citations

84

Authors

57

Institutions

Publications per year

2017–2026

12

Authors

84

  1. DH
    Dan Halperin

    Tel Aviv University, Israel

    3 publications · 78 citations

    3

    h-index

  2. LQ
    Liping Qian

    Zhejiang University of Technology, China

    3 publications · 357 citations

    3

    h-index

  3. SH
    Steven H. Low

    California Institute of Technology, United States

    3 publications · 1.4K citations

    3

    h-index

  4. VK
    Vladlen Koltun

    Intel (United States), United States

    3 publications · 94 citations

    3

    h-index

  5. AC
    A.R. Calderbank

    Princeton University, United States

    3 publications · 1.4K citations

    3

    h-index

1–5 of 84

Venues

  1. Discrete & Computational Geometry

    3 publications · 74 citations

    3

    h-index

  2. Tellus A Dynamic Meteorology and Oceanography

    3 publications · 67 citations

    3

    h-index

  3. IEEE Access

    2 publications · 50 citations

    2

    h-index

  4. IEEE Internet of Things Journal

    2 publications · 194 citations

    2

    h-index

  5. IEEE Transactions on Mobile Computing

    TMCCI · 2 publications · 185 citations

    2

    h-index

1–5