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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1939-2018
010020030019392017

Related topics

Related topics

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

Broader (1)

Convex analysis

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
Convex hull
Randomized algorithm
Data structure
Geographic information system
Quantization (signal processing)
Mixture model

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
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes… (More)
  • 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… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems
This paper is concerned with the generation of tight equivalent representations for mixedinteger zero-one programming problems… (More)
  • table 1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The convex hull of two core capacitated network design problems
The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand… (More)
  • table I
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… (More)
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 set and… (More)
  • figure 3.1
  • figure 3.2
  • figure 5.1
  • figure 5.2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Finding the Convex Hull Facet by Facet
Finding the convex hull of a finite set of points in Euclidean space was one of the first problems explored in the field of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Point pattern matching using convex hull edges
Algorithms for matching two sets of points in a plane are given. These algorithms search in the parameter space and find the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
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… (More)
  • figure 1
  • table I
  • figure 2
  • table II
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Convex Hulls of Finite Sets of Poin ts 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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?