Jump to content
Wikipedia The Free Encyclopedia

Talk:Warnock algorithm

Page contents not supported in other languages.
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:
WikiProject icon Computer science Low‐importance
WikiProject icon This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
Low This article has been rated as Low-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

Image to use

[edit ]

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

[edit ]

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 ]

AltStyle によって変換されたページ (->オリジナル) /