| Title: | Line Clipping in E3 with Expected Complexity O(1) |
| Authors: | Skala, Václav |
| Citation: | Machine Graphics and Vision. 1996, vol. 5, no. 4, p. 551-562. |
| Issue Date: | 1996 |
| Publisher: | Polska Akademia Nauk |
| Document type: | preprint preprint |
| URI: | http://hdl.handle.net/11025/11807 |
| ISSN: | 1230-0535 |
| Keywords: | ořezávání přímek;konvexní mnohostěn;počítačová grafika;složitost algoritmů |
| Keywords in different language: | line clipping;convex tetrahedron;computer graphics;algorithm complexity |
| Abstract: | A new line clipping algorithm against convex polyhedron in E3 with an expected complexity O(1) is presented. The suggested approach is based on two orthogonal projections to E2 co-ordinate system and on pre-processing of the given polyhedron. The pre-processing enables to speed up solution significantly. The proposed method is convenient for those applications when many lines are clipped against constant convex polyhedron. Theoretical considerations and experimental results are also presented. |
| Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_1996_CLIPE3-1.pdf | Plný text | 886,04 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11807Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.