Jump to content

Talk:Warnock algorithm

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Cewbot (talk | contribs) at 23:07, 10 February 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computer science}}.). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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]

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