The repetitive hidden-surface-removal problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient on-line retrieval of a single view. We assume that a polyhedral scene in 3-space is given in advance and is preprocessed o
โฆ LIBER โฆ
A systolic algorithm for hidden surface removal
โ Scribed by S.R Das; N.H Vaidya; L.M Patnaik; P.C Mathias
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 654 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Repetitive Hidden Surface Removal for Po
โ
Marco Pellegrini
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 237 KB
A simple hidden line removal algorithm f
โ
J.J. Capowski; E.M. Johnson
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 425 KB
Hidden-line algorithm for curved surface
โ
L. Li
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 446 KB
A hidden-line algorithm for displaying curved surfaces by line drawing is presented. The algorithm divides the screen plane into small rectangles, unlike Ohno's algorithm, which divides the screen space into small 3D boxes and exploits quadrilateral coherence and depth coherence. The present algorit
A systolic algorithm for QSVD updating
โ
Marc Moonen; Paul Van Dooren; Joos Vandewalle
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 714 KB
A simple hidden surface algorithm for fi
โ
M. Cerrolaza; N. Aparicio
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 774 KB
Efficient hidden surface removal for obj
โ
Matthew J. Katz; Mark H. Overmars; Micha Sharir
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 886 KB