| Title: | O(lg N) Line Clipping Algorithm in E2 |
| Authors: | Skala, Václav |
| Citation: | Computers and Graphics. 1994, vol. 18, no. 4, p. 517-524. |
| Issue Date: | 1994 |
| Publisher: | Pergamon Press |
| Document type: | preprint preprint |
| URI: | http://dx.doi.org/10.1016/0097-8493(94)90064-7 http://hdl.handle.net/11025/11830 |
| ISSN: | 0097-8493 |
| Keywords: | ořezávání přímky;konvexní polygon;počítačová grafika;složitost algoritmů |
| Keywords in different language: | line clipping;convex polygon;computer graphics;algorithm complexity |
| Abstract: | A new O(lg N) line clipping algorithm in E2 against a convex window 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. |
| Rights: | Original article published under copyright licence: © 1997, Elsevier. Citation of an original article: Skala,Václav. O(lg N) Line Clipping Algorithm in E2. Computers & Graphics. 1994, vol. 18, is. 4, p. 517-524. doi: http://dx.doi.org/10.1016/0097-8493(94)90064-7. ISSN 0097-8493. |
| Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_1994_LOG-CLIP.pdf | Plný text | 356,49 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11830Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.