Convex hull algorithms

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

Topic mentions per year

Topic mentions per year

1980-2017
024619802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We present two algorithms to efficiently determine the value of two grasp quality metrics formerly proposed in literature. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
  • 2004
A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convex… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Review
2004
Review
2004
In this paper, various convex hull algorithms are being analyzed. Various algorithms are compared 
  • figure 2
  • figure 4
  • figure 3
  • table 3
  • figure 5
Is this relevant?
2002
2002
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in… (More)
  • figure 1
Is this relevant?
1996
1996
This paper will present the implementation and comparison of new parallel algorithms for the convex hull problem. These… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A convex polytope P can be speci ed in two ways as the convex hull of the vertex set V of P or as the intersection of the set H… (More)
  • table I
Is this relevant?
1993
1993
A point set S is said to be convex if for any two points p, q in S, the line segment pq is also in S. Any point r on the segment… (More)
Is this relevant?
1991
1991
We present a number of efficient parallel algorithms for constructing 2and 3-dimensional convex hulls on a randomized CRCW PRAM… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?