Jump to content

Talk:Warnock algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Image to use

An illustration at File:Warnock algorithm.svg, but I wouldn't know how to caption it. AnonMoos (talk) 00:21, 14 May 2011 (UTC)[reply]

Done in Special:Diff/543424924. --CiaPan (talk) 13:27, 12 March 2013 (UTC)[reply]

Efficiency of the algorithm

According to lecture notes from CS488/688 of the University of Waterloo (http://medialab.di.unipi.it/web/IUM/Waterloo/node68.html#SECTION001140000000000000000) the Warnock algorithm is indeed O(np) where p=number of pixels and n=number of polygons. Pipythonmc (talk) 00:56, 24 August 2023 (UTC)[reply]