141 search results - page 2 / 29 » Self-improving Algorithms for Convex Hulls |
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
IPPS
2002
IEEE
13 years 10 months 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...
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
COMPGEOM
2009
ACM
13 years 12 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
