Title: A Fast Algorithm for Line Clipping by Convex Polyhedron in E3
Authors: Skala, Václav
Citation: Computers and Graphics. 1997, vol. 21, is. 2, p. 209-214.
Issue Date: 1997
Publisher: Elsevier
Document type: preprint
URI: http://dx.doi.org/10.1016/S0097-8493(96)00084-2
ISSN: 0097-8493
Keywords: ořezávání přímky;konvexní polyhedron;počítačová grafika;složitost algoritmů;geometrické algoritmy
Keywords in different language: line clipping;convex polyhedron;computer graphics;algorithm complexity;geometric algorithms
Abstract: A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N) . The suggested algorithm has O(N) complexity in the worst case and expected O(N) complexity. The speed up is achieved because of "known order" of triangles. Some principal results of comparisons of selected algorithms are presented and give some imagination how the proposed algorithm could be used effectively.
Rights: Original article published under copyright licence: © 1997, Elsevier. Citation of an original article: Skala,Václav. A Fast Algorithm for Line Clipping by Convex Polyhedron in E3. Computers & Graphics. 1997, vol. 21, is. 2, p. 209-214. doi: http://dx.doi.org/10.1016/S0097-8493(96)00084-2. ISSN 0097-8493. 
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1997_SQRTCLIP.pdfPlný text463,61 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11804

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.