This HTML5 document contains 3 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n2http://dbpedia.org/resource/Newell'
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n7http://commons.wikimedia.org/wiki/Special:FilePath/Painters_problem.png?width=
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://commons.wikimedia.org/wiki/Special:FilePath/Painters_problem.
xsdhhttp://www.w3.org/2001/XMLSchema#
Subject Item
n2:s_algorithm
rdfs:comment
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.
foaf:depiction
n5:png
dbpedia-owl:thumbnail
n7:300