Jump to content

Talk:Dynamic convex hull

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 01:51, 16 June 2007 (New paper). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Dynamic_convex_hull&oldid=138472941"