Convex Hull Complexity
Convex Hull Complexity is a computational geometry metric that quantifies the minimal descriptive complexity required to represent the convex hull of a given point set in Euclidean space, distinguishing it by characterizing the intrinsic algorithmic and structural intricacy associated with the hull's shape, dimensionality, and vertex configuration.
61
Publications
4.4K
Citations
105
Authors
65
Institutions
Publications per year
2017–2026
2
Parents
61
The Ultimate Planar Convex Hull Algorithm?
David Kirkpatrick, Raimund Seidel · SIAM Journal on Computing · 1986 · 385 citations
How good are convex hull algorithms?
David Avis, Raimund Seidel · Computational Geometry · 1997 · 259 citations
Gerth Stølting Brodal, Riko Jacob · 2003 · 199 citations
1–5 of 61
105
5
h-index
3
h-index
2
h-index
2
h-index
University of Illinois Urbana-Champaign, United States
2 publications · 43 citations
2
h-index
1–5 of 105
65

McGill University
Montreal, Canada
6 h-index
10 publications
745 citations

University of Waterloo
Waterloo, Canada
5 h-index
5 publications
190 citations
University of Michigan
Ann Arbor, United States
3 h-index
5 publications
173 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
5 publications
211 citations

Aarhus University
Aarhus, Denmark
2 h-index
3 publications
441 citations

Australian Defence Force Academy
Canberra, Australia
2 h-index
2 publications
111 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
2 publications
43 citations
University of Illinois System
Urbana, United States
2 h-index
2 publications
831 citations
1–8 of 65
5 publications · 565 citations
5
h-index
3 publications · 533 citations
3
h-index
3 publications · 301 citations
3
h-index
TPAMI · 3 publications · 298 citations
3
h-index
3 publications · 99 citations
3
h-index
1–5