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.
2010
2010
An approach for risk reduction (methodology) based on optimizing the facility layout and siting in toxic gas release scenarios
2010
2010
Controlling Four Agent Formations
Abstract This paper considers formation shape control of a team of four point agents, for the most part in the plane. Control… 
2009
2009
Spatial Skyline Queries: An Efficient Geometric Algorithm
As more data-intensive applications emerge, advanced retrieval semantics, such as ranking and skylines, have attracted attention… 
Review
2008
Review
2008
A theoretical and experimental study of geometric networks
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important… 
Highly Cited
2005
Highly Cited
2005
Home Range Analysis of Perodicticus potto edwardsi and Sciurocheirus cameronensis
Because the spatial arrangements of nocturnal prosimians are often used to indicate their social systems, it is important to… 
Highly Cited
2001
Highly Cited
2001
A hybrid method for recognition of undercut features from moulded parts
Highly Cited
1996
Highly Cited
1996
Toward image-based scene representation using view morphing
  • S. SeitzC. Dyer
  • Proceedings of 13th International Conference on…
  • 1996
  • Corpus ID: 9521086
The question of which views map be inferred from a set of basis images is addressed. Under certain conditions, a discrete set of… 
Highly Cited
1994
Highly Cited
1994
More facets from fences for linear ordering and acyclic subgraph polytopes
Highly Cited
1989
Highly Cited
1989
On clustering problems with connected optima in euclidean spaces
Highly Cited
1982
Highly Cited
1982
Some facets of the simple plant location polytope
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their… 
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)