Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Nicholl–Lee–Nicholl> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Nicholl–Lee–Nicholl abstract "The Nicholl–Lee–Nicholl algorithm is a fast line clipping algorithm that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen-Sutherland algorithm.".
- Nicholl–Lee–Nicholl wikiPageExternalLink citation.cfm?id=37432.
- Nicholl–Lee–Nicholl wikiPageID "3478118".
- Nicholl–Lee–Nicholl wikiPageLength "1741".
- Nicholl–Lee–Nicholl wikiPageOutDegree "7".
- Nicholl–Lee–Nicholl wikiPageRevisionID "602523608".
- Nicholl–Lee–Nicholl wikiPageWikiLink Algorithm.
- Nicholl–Lee–Nicholl wikiPageWikiLink Category:Clipping_(computer_graphics).
- Nicholl–Lee–Nicholl wikiPageWikiLink Cohen-Sutherland.
- Nicholl–Lee–Nicholl wikiPageWikiLink Cohen–Sutherland_algorithm.
- Nicholl–Lee–Nicholl wikiPageWikiLink Cyrus–Beck_algorithm.
- Nicholl–Lee–Nicholl wikiPageWikiLink Fast_clipping.
- Nicholl–Lee–Nicholl wikiPageWikiLink Liang–Barsky_algorithm.
- Nicholl–Lee–Nicholl wikiPageWikiLink Line_clipping.
- Nicholl–Lee–Nicholl wikiPageWikiLinkText "Nicholl–Lee–Nicholl".
- Nicholl–Lee–Nicholl hasPhotoCollection Nicholl–Lee–Nicholl.
- Nicholl–Lee–Nicholl wikiPageUsesTemplate Template:Cite_journal.
- Nicholl–Lee–Nicholl wikiPageUsesTemplate Template:Compu-graphics-stub.
- Nicholl–Lee–Nicholl subject Category:Clipping_(computer_graphics).
- Nicholl–Lee–Nicholl comment "The Nicholl–Lee–Nicholl algorithm is a fast line clipping algorithm that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen-Sutherland algorithm.".
- Nicholl–Lee–Nicholl label "Nicholl–Lee–Nicholl".
- Nicholl–Lee–Nicholl sameAs m.09fmmz.
- Nicholl–Lee–Nicholl sameAs Q17117009.
- Nicholl–Lee–Nicholl sameAs Q17117009.
- Nicholl–Lee–Nicholl wasDerivedFrom Nicholl–Lee–Nicholl?oldid=602523608.
- Nicholl–Lee–Nicholl isPrimaryTopicOf Nicholl–Lee–Nicholl.