Title: New Fast Line Clipping Algorithm in E2 With O(IgN) Complexity
Authors: Huy, Bui Duc
Skala, Václav
Citation: Spring Conference on Computer Graphics SCCG 1999: Conference Proceedings, p. 221-228.
Issue Date: 1999
Publisher: Univerzita Komenského
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/11729
ISBN: 80-223-1357-2
Keywords: algoritmy;počítačová grafika;komplexita algoritmů;konvexní polygon
Keywords in different language: algorithms;computer graphics;algoritms complexity;convex polygon
Abstract: New faster line clipping algorithm in E2 against a convex polygon with O(lgN) complexity is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
1999_SCCG-LOG-CLIP-Mod.pdfPlný text386,5 kBAdobe PDFView/Open    Request a copy

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

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