Live briefing
Everything about Newell's algorithm
3D computer graphics procedure
Newell's Algorithm is a 3D computer graphics procedure for elimination of polygon cycles in the depth sorting required in hidden-surface removal. It was proposed in 1972 by brothers Martin Newell and Dick Newell, and Tom Sancha, while all three were working at CADCentre. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Newell's algorithmA 5-minute orientation
- Pick up a classic book: Concept formationThe most-reprinted book on the subject
- Go sideways: Painter's algorithmA closely related topic
- Go sideways: Hidden-surface determinationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Concept formationDouglas H. Fisher, Pat Langley · 1991
Progress in artificial intelligence (Ellis Horwood series in artificial intelligence)Luc Steels, J.A. Campbell · 1985
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Painter's algorithm The painter's algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works…
- Hidden-surface determination In 3D computer graphics, hidden-surface determination (also known as shown-surface determination, hidden-surface removal (HSR), occlusion culling (OC)…
- Scanline rendering Scanline rendering (also scan line rendering and scan-line rendering) is an algorithm for visible surface determination, in 3D computer graphics, that…
- Topological sorting In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge…
- Z-buffering A z-buffer, also known as a depth buffer, is a type of data buffer used in computer graphics to store the depth information of fragments. The values stored…
- Geometry processing Geometry processing is an area of research that uses concepts from applied mathematics, computer science and engineering to design efficient algorithms…
- A-buffer In computer graphics, A-buffer, also known as anti-aliased, area-averaged or accumulation buffer, is a general hidden surface mechanism suited to medium…
- Planar graph In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect…