141 search results - page 1 / 29 » Self-improving Algorithms for Convex Hulls |
IWCIA
2004
Springer
13 years 10 months ago
2004
Springer
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
DAWAK
2001
Springer
13 years 9 months ago
2001
Springer
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
ICPP
2002
IEEE
13 years 10 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...