| Title: | An Efficient Algorithm for Line Clipping by Convex and Non-covex Polyhedrons in E3 |
| Authors: | Skala, Václav |
| Citation: | Computer Graphics Forum. 1996, vol. 15, is. 1, p. 61-68. |
| Issue Date: | 1996 |
| Publisher: | Wiley |
| Document type: | preprint preprint |
| URI: | http://dx.doi.org/10.1111/1467-8659.1510061 http://hdl.handle.net/11025/11831 |
| ISSN: | 0167-7055 |
| Keywords: | ořezávání přímek;mnohostěny;počítačová grafika;složitost algoritmů;geometrické algoritmy;analýza algoritmů |
| Keywords in different language: | line clipping;polyhedra;computer graphics;algorithm complexity;geometric algorithms;algorithm analysis |
| Abstract: | A new algorithm for clipping lines againts convex polyhedron with O(N) complexity is given with modification for non-convex polyhedron. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's algorithm. Some principal results of comparison of all algorithms are shown and give some imagination how the proposed algorithm could be used effectively. |
| Rights: | This is the pre-peer reviewed version of the following article: SKALA, Václav. An Efficient Algorithm for Line Clipping by Convex and Non-covex Polyhedrons in E3. Computer Graphics Forum. 1996, vol. 15, is. 1, p. 61-68., which has been published in final form at http://dx.doi.org/10.1111/1467-8659.1510061. |
| Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_1996_Non-convex-clipping-E3.pdf | Plný text | 655,63 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11831Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.