17 search results - page 1 / 4 » Convex Hull of Planar H-Polyhedra |
COMPUTING
2004
13 years 4 months ago
2004
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
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...
FAW
2010
Springer
13 years 6 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE