5 search results - page 1 / 1 » Tight bounds for dynamic convex hull queries (again) |
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
MP
2006
13 years 4 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
ISVC
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...