Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Skala, Václav | |
| dc.date.accessioned | 2015-01-07T08:45:22Z | |
| dc.date.available | 2015-01-07T08:45:22Z | |
| dc.date.issued | 1997 | |
| dc.identifier.citation | Computers and Graphics. 1997, vol. 21, is. 2, p. 209-214. | en |
| dc.identifier.issn | 0097-8493 | |
| dc.identifier.uri | http://dx.doi.org/10.1016/S0097-8493(96)00084-2 | |
| dc.identifier.uri | http://hdl.handle.net/11025/11804 | |
| dc.description.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 in the worst case and expected O(N) 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 imagination how the proposed algorithm could be used effectively. | en |
| dc.format | 8 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.relation.ispartofseries | Computers and Graphics | en |
| dc.rights | Original article published under copyright licence: © 1997, Elsevier. Citation of an original article: Skala,Václav. A Fast Algorithm for Line Clipping by Convex Polyhedron in E3. Computers & Graphics. 1997, vol. 21, is. 2, p. 209-214. doi: http://dx.doi.org/10.1016/S0097-8493(96)00084-2. ISSN 0097-8493. | en |
| dc.subject | ořezávání přímky | cs |
| dc.subject | konvexní polyhedron | cs |
| dc.subject | počítačová grafika | cs |
| dc.subject | složitost algoritmů | cs |
| dc.subject | geometrické algoritmy | cs |
| dc.title | A Fast Algorithm for Line Clipping by Convex Polyhedron in E3 | en |
| dc.type | preprint | cs |
| dc.type | preprint | en |
| dc.rights.access | openAccess | en |
| dc.type.version | draft | en |
| dc.subject.translated | line clipping | en |
| dc.subject.translated | convex polyhedron | en |
| dc.subject.translated | computer graphics | en |
| dc.subject.translated | algorithm complexity | en |
| dc.subject.translated | geometric algorithms | en |
| dc.type.status | Peer-reviewed | en |
| Vyskytuje se v kolekcích: | Preprinty / Preprints (KIV) | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| Skala_1997_SQRTCLIP.pdf | Plný text | 463,61 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11804Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.