Ear Decomposition is a method in computational geometry that partitions a simple polygon into non-overlapping triangles by iteratively removing "ears," defined as triangular subregions bounded by two consecutive edges of the polygon boundary and a single diagonal, until only a triangle remains.
26
Publications
1.1K
Citations
53
Authors
37
Institutions
Publications per year
2017–2026
1
Parents
Publications
26
1–5 of 26
Authors
53
- VR
3
h-index
- DB
2
h-index
- LL
2
h-index
- MH
2
h-index
- LA
2
h-index
1–5 of 53
Institutions
37
Tel Aviv University
Tel Aviv, Israel
3 h-index
6 publications
484 citations
Duke University
Durham, United States
3 h-index
4 publications
115 citations
The University of Texas at Austin
Austin, United States
3 h-index
4 publications
153 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
3 publications
144 citations
University of Waterloo
Waterloo, Canada
2 h-index
3 publications
77 citations
Universidade Federal de Campina Grande
Campina Grande, Brazil
1 h-index
1 publications
49 citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
76 citations
University of Illinois System
Urbana, United States
1 h-index
1 publications
76 citations
1–8 of 37
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 37 citations
2
h-index
- COMBINATORICA
2 publications · 152 citations
2
h-index
- University of Zagreb University Computing Centre (SRCE)
Repository · 1 publications · 15 citations
1
h-index
- Symposium on Discrete Algorithms
Conference · 1 publications · 14 citations
1
h-index
- Transactions of the American Mathematical Society
TRAN · 1 publications · 73 citations
1
h-index
1–5