hyperspace, hidden-line elimination
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.
Original Publication Citation
Robert P. Burton and David R. Smith, "A Hidden-Line Algorithm for Hyperspace," SIAM Journal on Computing, XI, February 1, 1982, pp. 71-8.
BYU ScholarsArchive Citation
Burton, Robert P. and Smith, David R., "A Hidden-Line Algorithm for Hyperspace" (1982). All Faculty Publications. 764.
Society for Industrial and Applied Mathematics
Physical and Mathematical Sciences
© 1982 SIAM.
Copyright Use Information