Newell's algorithm: Difference between revisions

Revision as of 03:33, 11 September 2007

Revision as of 03:34, 11 September 2007

Line 1:

'''Newell's Algorithm''' is a [[3D computer graphics]] procedure for elimination of [[polygon]] cycles in the depth sorting required in [[Hidden surface determination |hidden surface removal]]. It was proposed in 1972 by brothers [[MatrinMartin Newell]] and [[Dick Newell], and Tom Sancha, while all three were working at the [[CADCentre]].

In the depth sorting phase of hidden surface removal, if two polygons have no overlapping '''extents''' or extreme minimum and maximum values in the x, y, and z directions, then they can be easily sorted. If two polygons, Q and P do have overlapping extents in the Z direction then it is possible that cutting is necessary.