Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

75

COMPGEOM
2007
ACM

82views Discrete Geometry» more COMPGEOM 2007»

Tight bounds for dynamic convex hull queries (again)

15 years 6 months ago

Tight bounds for dynamic convex hull queries (again)

Download people.csail.mit.edu

Erik D. Demaine, Mihai Patrascu

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry |

claim paper

Related Content

» Three problems about dynamic convex hulls

» Kinetic sorting and kinetic convex hulls

» Lotsizing with production and delivery time windows

» Deformable Proximity Queries and Their Application in Mobile Manipulation Planning

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Erik D. Demaine, Mihai Patrascu

Comments (0)