Extreme Point Computation
Extreme Point Computation is a methodological framework in computational geometry that identifies the minimal set of vertices forming the convex hull of a finite point set by determining those points that cannot be expressed as convex combinations of others.
276
Publications
13.8K
Citations
475
Authors
269
Institutions
Publications per year
2017–2026
24
Parents
276
On Finding the Maxima of a Set of Vectors
H. T. Kung, Fabrizio Luccio, F. P. Preparata · Journal of the ACM · 1975 · 913 citations · Full text
On extreme points of regular convex sets
D. Milman · Studia Mathematica · 1940 · 328 citations · Full text
Solving the Fixed Charge Problem by Ranking the Extreme Points
Katta G. Murty · Operations Research · 1968 · 231 citations
1–5 of 276
475
6
h-index
6
h-index
5
h-index
4
h-index
3
h-index
1–5 of 475
269
Technion – Israel Institute of Technology
Haifa, Israel
9 h-index
13 publications
580 citations
University of Florida
Gainesville, United States
7 h-index
8 publications
297 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
9 publications
454 citations
University of Wisconsin–Madison
Madison, United States
5 h-index
9 publications
458 citations
University of California, Berkeley
Berkeley, United States
5 h-index
5 publications
372 citations
Stanford University
Stanford, United States
5 h-index
5 publications
381 citations

Sorbonne Université
Paris, France
5 h-index
5 publications
221 citations

Pennsylvania State University
State College, United States
4 h-index
4 publications
155 citations
1–8 of 269
PROC · 12 publications · 218 citations
10
h-index
9 publications · 845 citations
9
h-index
9 publications · 843 citations
9
h-index
8 publications · 497 citations
8
h-index
8 publications · 244 citations
8
h-index
1–5