Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Kolcun, Alexej | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2013-01-22T12:11:04Z | - |
| dc.date.available | 2013-01-22T12:11:04Z | - |
| dc.date.issued | 2005 | |
| dc.identifier.citation | WSCG '2005: Posters: The 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005 in co-operation with EUROGRAPHICS, University of West Bohemia, Plzen, Czech Republic, p. 35-36. | en |
| dc.identifier.isbn | 80-903100-8-7 | |
| dc.identifier.uri | http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/!WSCG2005_Poster_Proceedings_Final.pdf | |
| dc.identifier.uri | http://hdl.handle.net/11025/899 | |
| dc.description.abstract | In mathematics we can easily generalize Euclidean 3D space to n-dimensional one for arbitrary n>3. The task, how one can express n-dimensional objects in 3D or even in 2D, arises. In the paper the generalization of the back-volume culling algorithm is analyzed. | en |
| dc.format | 2 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Václav Skala - UNION Agency | en |
| dc.relation.ispartofseries | WSCG '2005: Posters | en |
| dc.rights | © Václav Skala - UNION Agency | cs |
| dc.subject | 3D viditelnost | cs |
| dc.subject | 4D konvexní mnohostěny | cs |
| dc.title | 3D visibility of 4D convex polyhedra | en |
| dc.type | konferenční příspěvek | cs |
| dc.type | conferenceObject | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.subject.translated | 3D visibility | en |
| dc.subject.translated | 4D convex polyhedra | en |
| dc.type.status | Peer-reviewed | en |
| Vyskytuje se v kolekcích: | WSCG '2005: Posters | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| Kolcun.pdf | Plný text | 203,7 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/899Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.