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
37
1–5 of 37
84
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 84
57

Tel Aviv University
Tel Aviv, Israel
5 h-index
8 publications
412 citations
Princeton University
Princeton, United States
4 h-index
8 publications
2.9K citations

Zhejiang University of Technology
Hangzhou, China
3 h-index
7 publications
907 citations
New York University
New York, United States
3 h-index
3 publications
190 citations
Dynamic Systems (United States)
Austin, United States
3 h-index
3 publications
1.4K citations
Courant Institute of Mathematical Sciences
New York, United States
3 h-index
3 publications
77 citations
California Institute of Technology
Pasadena, United States
3 h-index
6 publications
2.8K citations
Utrecht University
Utrecht, The Netherlands
2 h-index
2 publications
67 citations
1–8 of 57
3 publications · 74 citations
3
h-index
3 publications · 67 citations
3
h-index
2 publications · 50 citations
2
h-index
2 publications · 194 citations
2
h-index
TMCCI · 2 publications · 185 citations
2
h-index
1–5