Jump to content

Talk:Gift wrapping algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 129.78.64.106 (talk) at 01:50, 1 February 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I think this article needs an explanation why it's supposedly O(NK). I don't see why that would be the case. It seems O(N²K) to me. -- Timwi 22:07, 9 Feb 2004 (UTC)

Where did you get N² from? `'mikka (t) 23:40, 21 July 2006 (UTC)[reply]
The cited Introduction To Algorithms (a must have!) explains the performance. Wouter Lievens 22:59, 21 July 2006 (UTC)[reply]

The citationd doesn't outline higher dimensional extentions, does anyone know about this 129.78.64.106 01:50, 1 February 2007 (UTC)[reply]

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