Title: A Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3
Authors: Skala, Václav
Lederbuch, Pavel
Sup, Bohumír
Citation: SCCG96 Conference Proceedings, p. 27-44.
Issue Date: 1996
Publisher: Univerzita Komenského
Document type: preprint
URI: http://hdl.handle.net/11025/11806
Keywords: ořezávání přímky;konvexní polygon;konvexní polyhedron;počítačová grafika;složitost algoritmů;geometrické algoritmy
Keywords in different language: line clipping;convex polygon;convex polyhedron;computer graphics;algorithm complexity;geometric algorithms
Abstract: A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and space subdivision technique. The principle of algorithm in E3 is based on the projection of polyhedron to three orthogonal E2 coordinate systems. Algorithms have optimal complexities O(1) and demonstrates that preprocessing can be used to speed up the line clipping significantly. Obvious applications are for one polygon and/or polyhedron and many clipped lines. Detailed theoretical estimations and experimental results are also presented.
Rights: Plný text není přístupný.
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_1996_Clip-O(1)-E3-SCCG96.pdfPlný text792,32 kBAdobe PDFView/Open    Request a copy

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

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