Skip to search formSkip to main contentSkip to account menu

Convex hull

Known as: Minimum convex polygon, Convex, Closed convex hull 
In mathematics, the convex hull or convex envelope of a set X of points in the Euclidean plane or Euclidean space is the smallest convex set that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
All nearest smaller valuesAlpha shapeAnalog computerAngular resolution (graph drawing)

Broader (1)

Convex analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1996
Highly Cited
1996
The quickhull algorithm for convex hulls
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex… 
Highly Cited
1994
Highly Cited
1994
The Visual Hull Concept for Silhouette-Based Image Understanding
  • A. Laurentini
  • IEEE Trans. Pattern Anal. Mach. Intell.
  • 1994
  • Corpus ID: 27660563
Many algorithms for both identifying and reconstructing a 3-D object are based on the 2-D silhouettes of the object. In general… 
Highly Cited
1993
Highly Cited
1993
An optimal convex hull algorithm in any fixed dimension
  • B. Chazelle
  • Discret. Comput. Geom.
  • 1993
  • Corpus ID: 26605267
We present a deterministic algorithm for computing the convex hull ofn points inEd in optimalO(n logn+n⌞d/2⌟) time. Optimal… 
Highly Cited
1991
Highly Cited
1991
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
AbstractWe present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the… 
Highly Cited
1990
Highly Cited
1990
A hierarchy of relaxation between the continuous and convex hull representations
In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a… 
Highly Cited
1990
Highly Cited
1990
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems
In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a… 
Highly Cited
1986
Highly Cited
1986
The Ultimate Planar Convex Hull Algorithm?
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input… 
Highly Cited
1977
Highly Cited
1977
Convex hulls of finite sets of points in two and three dimensions
The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented… 
Highly Cited
1977
Highly Cited
1977
A New Convex Hull Algorithm for Planar Sets
A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented. It… 
Highly Cited
1964
Highly Cited
1964
Convex programming in Hilbert space
This note gives a construction for minimizing certain twice-differentiable functions on a closed convex subset C, of a Hubert… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)