Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Skala, Václav | |
| dc.contributor.author | Bui, Duc Huy | |
| dc.date.accessioned | 2015-01-05T14:57:16Z | |
| dc.date.available | 2015-01-05T14:57:16Z | |
| dc.date.issued | 2000 | |
| dc.identifier.citation | Machine Graphics & Vision. 2000, vol. 9, no. 4, p. 841-850. | en |
| dc.identifier.issn | 1230-0535 | |
| dc.identifier.uri | http://hdl.handle.net/11025/11802 | |
| dc.description.abstract | A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms. | cs |
| dc.format | 7 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | Machine Graphics & Vision | cs |
| dc.subject | počítačová grafika | cs |
| dc.subject | ořezávání přímek | cs |
| dc.subject | geometrické algoritmy | cs |
| dc.title | A New Algorithm for Pyramidal Clipping of Line Segments in E3 | cs |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.subject.translated | computer graphics | en |
| dc.subject.translated | line clipping | en |
| dc.subject.translated | geometric algorithms | en |
| dc.type.status | Peer-reviewed | en |
| Vyskytuje se v kolekcích: | Články / Articles (KIV) | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| Skala_2000_3D-Pyramidal-clip.pdf | Plný text | 556,45 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/11802Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.