70 search results - page 3 / 14 » Convex Hulls in a 3-Dimensional Space |
COMPGEOM
1991
ACM
13 years 11 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
SIAMJO
2002
13 years 7 months ago
2002
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
IPPS
2002
IEEE
14 years 13 days ago
2002
IEEE
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
BMVC
2000
13 years 9 months ago
2000
A new object recognition method, the Invariant Pixel Set Signature (IPSS), is introduced. Objects are represented with a probability density on the space of invariants computed fr...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...