| Title: | Line Clipping in E2 with O(1) Processing Complexity |
| Authors: | Skala, Václav |
| Citation: | Computers and Graphics. 1996, vol. 20, is. 4, p. 523-530. |
| Issue Date: | 1996 |
| Publisher: | Elsevier |
| Document type: | preprint preprint |
| URI: | http://dx.doi.org/10.1016/0097-8493(96)00024-6 http://hdl.handle.net/11025/11805 |
| ISSN: | 0097-8493 |
| Keywords: | ořezávání přímek;konvexní polygon;počítačová grafika;složitost algoritmů;geometrické algoritmy |
| Keywords in different language: | line clipping;convex polygon;computer graphics;algorithm complexity;geometric algorithms |
| Abstract: | A new algorithm for line clipping by convex polygon with O(1) processing complexity is presented. It is based on dual space representation and space subdivision technique. The suggested algorithm also demonstrates that pre-processing can be used in order to speed up solution of some problems in computer graphics applications significantly. Theoretical considerations and experimental results are also presented. |
| Rights: | Original article published under copyright licence: © 1997, Elsevier. Citation of an original article: Skala,Václav. Line Clipping in E2 with O(1) Processing Complexity. Computers & Graphics. 1997, vol. 20, is. 4, p. 523-530. doi: http://dx.doi.org/10.1016/0097-8493(96)00024-6. |
| Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_1996_CLIP95-1.pdf | Plný text | 560,54 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11805Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.