Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Skala, Václav | |
dc.contributor.author | Lederbuch, Pavel | |
dc.contributor.author | Sup, Bohumír | |
dc.date.accessioned | 2015-01-07T09:53:05Z | |
dc.date.available | 2015-01-07T09:53:05Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | SCCG96 Conference Proceedings, p. 27-44. | en |
dc.identifier.uri | http://hdl.handle.net/11025/11806 | |
dc.description.abstract | A comparison of a new algorithm for line clipping in E2 and E3 by convex polygon and/or polyhedron with O(1) processing complexity and Cyrus- Beck algorithm is presented. The new algorithm in E2 is based on dual space representation and space subdivision technique. The principle of algorithm in E3 is based on the projection of polyhedron to three orthogonal E2 coordinate systems. Algorithms have optimal complexities O(1) and demonstrates that preprocessing can be used to speed up the line clipping significantly. Obvious applications are for one polygon and/or polyhedron and many clipped lines. Detailed theoretical estimations and experimental results are also presented. | en |
dc.format | 17 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Univerzita Komenského | cs |
dc.relation.ispartofseries | SCCG96 Conference Proceedings | en |
dc.rights | Plný text není přístupný. | cs |
dc.subject | ořezávání přímky | cs |
dc.subject | konvexní polygon | 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 Comparison of O(1) and Cyrus-Beck Line Clipping Algorithms in E2 and E3 | en |
dc.type | preprint | cs |
dc.type | preprint | en |
dc.rights.access | closedAccess | en |
dc.type.version | draft | en |
dc.subject.translated | line clipping | en |
dc.subject.translated | convex polygon | 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_1996_Clip-O(1)-E3-SCCG96.pdf | Plný text | 792,32 kB | Adobe PDF | Zobrazit/otevřít Vyžádat kopii |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11806
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.