HTML Microdata document

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

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

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n15	http://portal.acm.org/
n13	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Subject Item: dbr:Nicholl–Lee–Nicholl_algorithm
rdfs:label: Nicholl–Lee–Nicholl algorithm
rdfs:comment: In computer graphics, the Nicholl–Lee–Nicholl algorithm is a fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen–Sutherland algorithm.
dcterms:subject: dbc:Line_clipping_algorithms
dbo:wikiPageID: 3478118
dbo:wikiPageRevisionID: 1099533241
dbo:wikiPageWikiLink: dbr:Algorithm dbr:Cyrus–Beck_algorithm dbr:Line_clipping dbr:Liang–Barsky_algorithm dbr:Fast_clipping dbr:Cohen–Sutherland_algorithm dbc:Line_clipping_algorithms dbr:Computer_graphics
dbo:wikiPageExternalLink: n15:citation.cfm%3Fid=37432
owl:sameAs: n13:fjmG wikidata:Q17117009
dbp:wikiPageUsesTemplate: dbt:Compu-graphics-stub dbt:Short_description dbt:Cite_journal
dbo:abstract: In computer graphics, the Nicholl–Lee–Nicholl algorithm is a fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen–Sutherland algorithm.
prov:wasDerivedFrom: wikipedia-en:Nicholl–Lee–Nicholl_algorithm?oldid=1099533241&ns=0
dbo:wikiPageLength: 1849
foaf:isPrimaryTopicOf: wikipedia-en:Nicholl–Lee–Nicholl_algorithm