Newell's Algorithm: 3D Computer Graphics, Alpha Compositing, Back-Face Culling - Brossura

 
9786133677166: Newell's Algorithm: 3D Computer Graphics, Alpha Compositing, Back-Face Culling

Sinossi

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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. 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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.