| Title: | O(lg N) Line Clipping Algorithm in E2 |
| Authors: | Skala, Václav |
| Citation: | Winter School of Computer Graphics and CAD Systems 94: University of West Bohemia: Pilsen, Czech Republic, January 19-20, 1994, p. 174-191. |
| Issue Date: | 1994 |
| Publisher: | Západočeská univerzita |
| Document type: | článek konferenční příspěvek article conferenceObject |
| URI: | http://wscg.zcu.cz/wscg1994/papers94/Skala_94.pdf http://hdl.handle.net/11025/15403 |
| ISBN: | 80-7082-192-2 |
| 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: | © Západočeská univerzita v Plzni |
| Appears in Collections: | Winter School of Computer Graphics and CAD Systems 94 Sborník referátů semináře Zimní škola počítačové grafiky a CAD systémů 1992 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_94.pdf | Plný text | 1,24 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/15403Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.