Extension of the Nicholls-Lee-Nichols algorithm to three dimensions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00065368" target="_blank" >RIV/49777513:23520/01:00065368 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Extension of the Nicholls-Lee-Nichols algorithm to three dimensions
Original language description
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points that are not end points of the outputline segment. It also solves all cases more effectively. The performance of this algorithmis shown to be consistently better than that of existing algorithms, including the Cohen-Sutherland, Liang-Barsky, and Cyrus-Beck algorithms.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
The Visual Computer
ISSN
01782789
e-ISSN
—
Volume of the periodical
Vol. 17
Issue of the periodical within the volume
leden
Country of publishing house
DE - GERMANY
Number of pages
7
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—