Newell's algorithm: Difference between revisions

Revision as of 20:20, 11 February 2020

Latest revision as of 01:20, 8 May 2023

(2 intermediate revisions by 2 users not shown)

Line 5:

[[Image:Painters_problem.png|right|frame|Cyclic polygons must be eliminated to correctly sort them by depth]]

In that case, Newell's algorithm tests the following:

# Test for Z overlap; implied in the selection of the face {{var|Q}} from the sort list

# The extreme coordinate values in X of the two faces do not overlap ([[minimax]] test in X)

Line 28:

| title = A characterization of ten hidden-surface algorithms

| volume = 6

| year = 1974| citeseerx = 10.1.1.132.8222 | s2cid = 14222390 }}.

*{{citation

| last1 = Newell | first1 = M. E. | author1-link = Martin Newell (computer scientist)

Line 46:

[[Category:3D computer graphics]]

[[Category:Computer graphics algorithms]]

[[Category:History of computing in the United Kingdom]]

[[Category:Science and technology in Cambridgeshire]]