Talk:Warnock algorithm
From Wikipedia, the free encyclopedia
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
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)
- Done in Special:Diff/543424924. --CiaPan (talk) 13:27, 12 March 2013 (UTC)
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)