Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Skala, Václav | |
| dc.contributor.author | Bui, Duc Hui | |
| dc.date.accessioned | 2015-01-06T07:06:07Z | |
| dc.date.available | 2015-01-06T07:06:07Z | |
| dc.date.issued | 2000 | |
| dc.identifier.citation | Machine Graphics & Vision. 2000, vol. 9, no. 1/2, p. 297-306. | en |
| dc.identifier.issn | 1230-0535 | |
| dc.identifier.uri | http://hdl.handle.net/11025/11803 | |
| dc.description.abstract | New efficient algorithms for the line clipping by the given rectangle in E2 are presented. The first algorithm is based on the line direction evaluation, the second one is based on a new coding technique of clipping rectangle’s vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too. | cs |
| dc.format | 6 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | Machine Graphics & Vision | cs |
| dc.rights | © Warsaw University of Life Sciences | en |
| dc.subject | ořezávání přímky | cs |
| dc.subject | počítačová grafika | cs |
| dc.subject | složitost algoritmů | cs |
| dc.subject | geometrické algoritmy | cs |
| dc.title | Two New Algorithms for Line Clipping in E2 and Their Comparison | en |
| dc.type | článek | cs |
| dc.type | article | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.subject.translated | line clipping | 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: | Články / Articles (KIV) | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| Skala_2000_Clipping-SF_2D_GKPO.pdf | Plný text | 364,36 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/11803Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.