| Title: | An Algorithm for Line Clipping by Convex Polyhedron in E3 with O(N1/2) Complexity |
| Authors: | Skala, Václav |
| Issue Date: | 1994 |
| Document type: | preprint preprint |
| URI: | http://hdl.handle.net/11025/11832 |
| Keywords: | ořezávání přímek;konvexní polyhedron;počítačová grafika;složitost algoritmů;geometrciké algoritmy |
| Keywords in different language: | line clipping;convex polyhedron;computer graphics;algorithm complexity;geometric algorithms |
| Abstract: | A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O(N). The suggested algorithm has O(N) complexity. The suggested algorithm has O(N) complexity in worst case and expected O(N1/2) complexity. The speed up is achieved because of "known order" of triangles. Some principal results of comparisons of selected algorithms are presented and give some idea how the proposed algorithm could be used effectively. |
| Rights: | Plný text není přístupný. |
| Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_1994_Clip-SQRT-TR.pdf | Plný text | 534,33 kB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11832Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.