Talk:Dynamic convex hull

Inanity

Well, it was not inanity. It was careless unfinished writing. The lower bound is Omega(n) if one is required to report a convex hull in traditional way, as a convex polygon. I am not completely senile yet (although steadily moving in this direction :-) `'юзырь:mikka 01:29, 16 June 2007 (UTC)[reply]

New paper

Erik D. Demaine and Mihai Pǎtraşcu, ``Tight Bounds for Dynamic Convex Hull Queries (Again), in Proceedings of the 23rd Annual ACM Symposium on Computational Geometry (SoCG 2007), Gyeongju, South Korea, June 6-8, 2007

It's not on Erik's web site yet, but should be available through ACM when ACM's web site comes back up. —David Eppstein 01:51, 16 June 2007 (UTC)[reply]

"The convex hull becomes a triangle"?

"It is easy to construct an example for which the convex hull contains all input points, but after the insertion of a single point the convex hull becomes a triangle."

What is this supposed to mean? I cannot come up with any interpretation that makes sense.