A Hidden-Line Algorithm for Hyperspace
- 1 February 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (1), 71-80
- https://doi.org/10.1137/0211006
Abstract
An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the selected viewing hyperspace. When shape alone is the attribute of interest, hidden-line elimination need be performed only in that hyperspace. The algorithm is of value in the production of shadows of hyperdimensional models, including but not limited to four-dimensional space-time models, the hyperdimensional elementary catastrophe models and multivariate statistical models.Keywords
This publication has 3 references indexed in Scilit:
- Catastrophe TheoryScientific American, 1976
- A polyhedron clipping and capping algorithm and a display system for three dimensional finite element modelsACM SIGGRAPH Computer Graphics, 1975
- A Characterization of Ten Hidden-Surface AlgorithmsACM Computing Surveys, 1974