Steven L. Tanimoto
ABSTRACT
Efficient visible surface (hidden surface) algorithms must make use of information about the structure of the environment, constraints on viewpoint locations and the coherence between successive views in a sequence. Here the visible surface problem is posed as a problem in graph theory. A new technique based on 'updating cut-sets in a graph is presented as a means to streamline the culling of back faces during visible surface computations. The technique can be used for general environments that contain some convex polyhedra. Since the method saves the most computation when convex polyhedra having many faces appear in the environment, it is particularly appropriate for handling geodesic domes and polyhedral approximations to spheres. A direct extension for nonconvex polyhedra is suggested.
- Jones, C. B., A new approach to the "hidden-line" problem. Computer Journal Vol. 14, No. 3, (Aug. 1971), pp. 232-237.Google Scholar
Cross Ref
- Sutherland, I. E., Sproull, R. F., and Schumacker, R. A., A characterization of ten hidden-surface algorithms. Computing Surveys Vol. 6, No. 1, (March 1974), pp. 1-55. Google ScholarDigital Library
- Schumacker, R. A., Brand, B., Gilliland, M. and Sharp, W., Study for applying computer-generated images to visual simulation. AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory (Sept. 1969).Google Scholar
- Warnock, J. E., A hidden-surface algorithm for computer-generatedhalftone pictures. Computer Science Dept., University of Utah, TR 4-15 (June 1969).Google Scholar
- Roberts, L. G., Machine perception of three-dimensional solids. MIT Lincoln Laboratory, TR 315 (May 1963).Google Scholar
- Watkins, G. S., A real-time visible surface algorithm. Computer Science Dept., University of Utah, UTECH-CSC-70-101, (June 1970).Google Scholar
- Loutrel, P. P., A solution to the hidden-line problem for computer-drawn polyhedra. IEEE Trans. Comput. C-19, 3, (March 1970) p. 205.Google ScholarDigital Library
- Galimberti, R. and Montanari, U., An algorithm for hidden line elimination. Comm. A.C.M. Vol. 12, No. 4, (April 1961), pp. 206-211. Google ScholarDigital Library
- Bouknight, W. J., A procedure for generation of half-tone computer graphics representations. Comm. A.C.M. Vol. 13, No. 9, (Sept. 1970) p. 527. Google ScholarDigital Library
- Bramall, R., Three dimensional data display with hidden line removal. TR CSRG-12, University of Toronto. (April 1972).Google Scholar
- Clark, J. H., Hierarchical geometric models for visible surface algorithms. Comm. A. C. M. Vol. 19, No. 10 (Oct. 1976) pp. 547-554. Google ScholarDigital Library
- Tanimoto, S. L., An iconic/symbolic data structuring scheme, Pattern Recognition and Artificial Intelligence, Academic Press, N. Y. 1976, pp. 452-471.Google Scholar
- Cheston, G. A., Incremental algorithms in graph theory, Techn. Rept. No. 91, University of Toronto, Dept. of Computer Science (March 1976).Google Scholar
- Newell, M. E., Newell, R. G., and Sancha, T. L. A new approach to the shaded picture problem. Proc. ACM National Conf., 1972.Google Scholar
- Busacker, R. G. and Saaty, T. L., Finite Graphs and Networks, McGraw-Hill, N. Y., 1965.Google Scholar
- Newell, M. E., The utilization of procedural models in digital image synthesis. Ph.D. dissertation, Computer Science Dept., University of Utah, 1975. Google ScholarDigital Library
Recommendations
A graph-theoretic real-time visible surface editing technique
Efficient visible surface (hidden surface) algorithms must make use of information about the structure of the environment, constraints on viewpoint locations and the coherence between successive views in a sequence. Here the visible surface problem is ...
On fixed size projection of simplicial polyhedra
A convex polyhedron P is equiprojective (similarly, biprojective) if, for some fixed k (similarly, k"1 and k"2), the orthogonal projection (or ''shadow'') of P in every direction, except directions parallel to faces of P, is a k-gon (similarly, k"1- or ...
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
Chazelle [SIAM J Comput 21(4):671---696, 1992] gave a linear-time algorithm to compute the intersection of two convex polyhedra in three dimensions. We present a simpler algorithm to do the same.
Comments