3 search results - page 1 / 1 » An O((log log n)2) Time Convex Hull Algorithm on Reconfigura... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
ALGORITHMICA
1998
13 years 4 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...