Newell's algorithm: Difference between revisions

Revision as of 23:37, 20 December 2005

Revision as of 04:45, 11 January 2006

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 M.E Newell, R . Newell and T. Sancha.

In the depth sorting phase of hidden surface removal, if two polygons have no overlaping '''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 overlaping extents in the Z direction then it is possible that cutting is necessary.