Title: A New Algorithm for Pyramidal Clipping of Line Segments in E3
Authors: Skala, Václav
Bui, Duc Huy
Citation: Machine Graphics & Vision. 2000, vol. 9, no. 4, p. 841-850.
Issue Date: 2000
Document type: článek
URI: http://hdl.handle.net/11025/11802
ISSN: 1230-0535
Keywords: počítačová grafika;ořezávání přímek;geometrické algoritmy
Keywords in different language: computer graphics;line clipping;geometric algorithms
Abstract: A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms.
Appears in Collections:Články / Articles (KIV)

Files in This Item:
File Description SizeFormat 
Skala_2000_3D-Pyramidal-clip.pdfPlný text556,45 kBAdobe PDFView/Open

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

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