Title: 3D visibility of 4D convex polyhedra
Authors: Kolcun, Alexej
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.
Issue Date: 2005
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
conferenceObject
URI: http://wscg.zcu.cz/WSCG2005/Papers_2005/Poster/!WSCG2005_Poster_Proceedings_Final.pdf
http://hdl.handle.net/11025/899
ISBN: 80-903100-8-7
Keywords: 3D viditelnost;4D konvexní mnohostěny
Keywords in different language: 3D visibility;4D convex polyhedra
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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2005: Posters

Files in This Item:
File Description SizeFormat 
Kolcun.pdfPlný text203,7 kBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/899

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.