Title: A Comparison of a New O(1) and the Cyrus-Beck Line Clipping Algorithms in E2
Authors: Skala, Václav
Citation: Compugraphics '96: Fifth International Conference on Computational Graphics and Visualization Techniques: Proceedings, p. 281-287.
Issue Date: 1996
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/11808
ISBN: 972-8342-01-2
Keywords: ořezávání přímky;konvexní polygon;počítačová grafika;geometrické algoritmy
Keywords in different language: line clipping;convex polygon;computer graphics;geometric algorithms
Abstract: A comparison of a new algorithm for line clipping in E2 for convex polygons with O(1) processing complexity and the Cyrus-Beck algorithm is presented. The algorithm is based on the dual space representation and a space subdivision technique. The algorithm demonstrates that preprocessing can be used to speed up line clipping significantly. Theoretical analysis and detailed experimental results are also presented.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1996_Comparison_PGR96-O_1_.pdfPlný text386,04 kBAdobe PDFView/Open    Request a copy

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

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