3D visibility of 4D convex polyhedra
Date issued
2005
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Václav Skala - UNION Agency
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.
Description
Subject(s)
3D viditelnost, 4D konvexní mnohostěny
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.