Skip to search formSkip to main contentSkip to account menu

Convex hull algorithms

Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a multi-objective… 
2006
2006
• Sd: A d-Simplex The simplest convex polytope in R. A d-simplex is always the convex hull of some d + 1 affinely independent… 
2004
2004
The creating of convex hull for simple polygon is the basic application for computer graphics that can be developed to more… 
1996
1996
In a previous paper (Neptune & Hull, 1995), a new video-based method (ASIS) for locating the hip joint center (HJC) in seated… 
1995
1995
This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull… 
1995
1995
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in… 
1989
1989
1988
1988
  • A. M. Day
  • 1988
  • Corpus ID: 12730586
Sequential and parallel planar convex hull algorithms, their applications and some of the problems encountered on implementations…