164 search results - page 4 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
ICPR
2006
IEEE
14 years 8 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...
ICCSA
2004
Springer
14 years 28 days 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...
ISVD
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
ALGORITHMICA
2010
13 years 7 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...