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 SineBot (talk | contribs) at 23:54, 5 November 2011 (Signing comment by 98.245.129.154 - "→The pseudo code is wrong: new section"). 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)

Answer: the outer loop runs K times (since it finds one point on the convex hull during each iteration) while the inner loop (which is not spelled out in the article) runs up to N-1 times. Hence O(K*N).

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 extensions, does anyone know about this 129.78.64.106 01:50, 1 February 2007 (UTC)[reply]

Jarvis name

What is the name of Mr/Mrs Jarvis? Wojciech mula (talk) 18:49, 8 May 2011 (UTC)[reply]

The pseudo code is wrong

The algorithm needs to take the smallest angle, not simple the point to the left of all the other points. — Preceding unsigned comment added by 98.245.129.154 (talk) 23:53, 5 November 2011 (UTC)[reply]

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