Title: Fast Algorithms for Line Segment and Line Clipping in E2
Authors: Bui, Duc Huy
Skala, Václav
Citation: SSCG'97 International Conference, p. 1-8.
Issue Date: 1997
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/11733
Keywords: počítačová grafika;komplexita algoritmů;geometrické algoritmy
Keywords in different language: computer graphics;algorithm complexity;geometric algorithms
Abstract: New modifications of the Cohen-Sutherland algorithm for the line and line segment clipping in E2 are presented. The suggested algorithms are based on a new coding technique based on coding of the line direction together with coding of end-points of the clipped line segment. It allows to solve all cases more effectively. The proposed algorithms are convenient for line or line segment clipping by the rectangle. Theoretical considerations and experimental results are also presented.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
1997_LSSB-clipping.pdfPlný text340,63 kBAdobe PDFView/Open    Request a copy

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

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