Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Broader (1)

Convex analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Disjunctive Programming: Properties of the Convex Hull of Feasible Points
  • E. Balas
  • Discret. Appl. Math.
  • 1998
    • Corpus ID: 11152491
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes… Expand
  • figure I
Is this relevant?
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… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
  • figure 3.1
  • figure 3.2
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Finding the convex hull of a simple polygon
We describe a new algorithm for finding the convex hull of any simple polygon specified by a sequence of m vertices. An earlier… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1972
Highly Cited
1972
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
  • R. Graham
  • Inf. Process. Lett.
  • 1972
    • Corpus ID: 45778703
Step Find a point Pin the plane w%ch is in &he In&$x of Cl-l(s). At worst, this can be done in clfl sQp9 by te dting 3 element… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE