|
|
| Line 1: |
Line 1: |
| [[File:Warnock1.svg|thumb|200px|Polygon visibility in a given viewport: a) polygon fills the viewport, b) polygon partially and c) completely visible, d) polygon invisible.]]
| | The name of the author is Jayson. For a while I've been in Alaska but I will have to move in a year or two. To play lacross is something I really appreciate performing. Office supervising is exactly where my main income comes from but I've always needed my own company.<br><br>my web site free psychic ([http://chungmuroresidence.com/xe/reservation_branch2/152663 http://chungmuroresidence.com/]) |
| [[File:Warnock algorithm.svg|thumb|200px|Four steps of a viewport divisions for a simple scene]]
| |
| The '''Warnock algorithm''' is a [[Hidden surface determination|hidden surface algorithm]] invented by [[John Warnock]] that is typically used in the field of [[computer graphics]].<ref>{{cite web
| |
| |title=A hidden surface algorithm for computer generated halftone pictures
| |
| |last=Warnock
| |
| |first= John
| |
| |authorlink=John Warnock
| |
| |url=http://portal.acm.org/citation.cfm?id=905316&dl=ACM
| |
| |publisher=University of Utah
| |
| |format=HTML gateway to [[PDF]]
| |
| |year=1969
| |
| |quote=The algorithm was Warnock's doctoral thesis.}}, 32 pages </br/>Also: http://www.dtic.mil/cgi-bin/GetTRDoc?AD=AD753671&Location=U2&doc=GetTRDoc.pdf</ref>
| |
| It solves the problem of rendering a complicated image by recursive subdivision of a scene until areas are obtained that are trivial to compute. In other words, if the scene is simple enough to compute efficiently then it is rendered; otherwise it is divided into smaller parts which are likewise tested for simplicity.<ref>{{cite book | last=Daintith | first=John | coauthors= Wright, Edmund | year=2009 | title=Oxford Dictionary of Computing | publisher=Oxford University Press |isbn=978-0-19-923400-4}}, 608 pages</ref>
| |
| | |
| This is a [[divide and conquer algorithm]] with [[analysis of algorithms|run-time]] of <math>O(np)</math>, where ''n'' is the number of polygons and ''p'' is the number of pixels in the viewport.
| |
| | |
| The inputs are a list of polygons and a viewport. The best case is that if the list of polygons is simple, then draw the polygons in the viewport. Simple is defined as one polygon (then the polygon or its part is drawn in appropriate part of a viewport) or a viewport that is one pixel in size (then that pixel gets a color of the polygon closest to the observer). The continuous step is to split the viewport into 4 equally sized quadrants and to recursively call the algorithm for each quadrant, with a polygon list modified such that it only contains polygons that are visible in that quadrant.
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| | |
| ==External links==
| |
| * [http://medialab.di.unipi.it/web/IUM/Waterloo/node68.html A summary of the Warnock Algorithm]
| |
| | |
| {{DEFAULTSORT:Warnock Algorithm}}
| |
| [[Category:Computer graphics algorithms]]
| |
| | |
| | |
| {{compu-prog-stub}}
| |
The name of the author is Jayson. For a while I've been in Alaska but I will have to move in a year or two. To play lacross is something I really appreciate performing. Office supervising is exactly where my main income comes from but I've always needed my own company.
my web site free psychic (http://chungmuroresidence.com/)