The Warnock algorithm is a hidden surface algorithm invented by John Warnock that is typically used in the field of computer graphics. 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.
This is a divide and conquer algorithm with run-time of , 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.

This is an excerpt from the article Warnock algorithm from the Wikipedia free encyclopedia. A list of authors is available at Wikipedia.

The article Warnock algorithm at en.wikipedia.org was accessed 541 times in the last 30 days. (as of: 10/31/2013)

7.6 Warnock and Weiler-Atherton Area Subdivision 273 it was sufficient to
choose the best from a few chosen at random (five seemed to work well). We
have just described the original BSP algorithms. Variants have been developed
since then ...

Masterminds of Programming features exclusive interviews with the creators of several historic and highly influential programming languages. In this unique collection, you'll learn about the processes that led to specific design decisions, including the goals they had in mind, the trade-offs they had to make, and how their experiences have lef...

From the reviews:“It is dedicated to ‘the thousands of people over thousands of years who have developed the building blocks and made the discoveries in mathematics and science to make such 3D magic possible.’ … The brilliant timing of The History of Visual Magic in Computer … provides a new magical dimension on the time span to the topic, both fas...

Warnock introduced this method in the year 1969. This is a very primitive and
basic algorithm and it is also a very lengthy algorithm. Also, the process
increases with the increased resolution of the scene. This algorithm divides the
scene into ...

X Figure 12.11: Incremental method for depth calculation. 12.3 Warnock's Algorithm Warnock's algorithm makes use of area coherence. Here, coherent
area in the image space is found out by the repeated area subdivision method.
Hence, the ...

John Warnock (co-founder of Adobe) is not just known for being the mind behind Adobe, PostScript, and Acrobat. Prior to Adobe, he worked for Xerox PARC and was one of the foremost scientists in leading the effort for JaM (“J” being John; “M” being Martin Newell, famous for the Utah Teapot), the precursor to PostScript.