An algorithm for hidden line elimination

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An algorithm for hidden line elimination

Full text

Pdf (702 KB)

Source

Communications of the ACM archive
Volume 12 , Issue 4 (April 1969) table of contents

Pages: 206 - 211

Year of Publication: 1969

ISSN:0001-0782

Author

R. Galimberti

Istituto di Elettrotecnica e di Elettronica, Politecnico di Milano, Italy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 49, Citation Count: 17

Additional Information:

abstract references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/362912.362921 What is a DOI?

ABSTRACT

The algorithm presented causes the elimination of hidden lines in the representation of a perspective view of concave and convex plane-faced objects on the picture plane. All the edges of the objects are considered sequentially, and all planes which hide every point of an edge are found. The computing time increases roughly as the square of the number of edges. The algorithm takes advantage of a reduced number of concave points and automatically recognizes if only one object with no concave points is considered. In this last case, the result is obtained in a much simpler way.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ROBERTS, L. G. Machine perceptions of three-dimensional solids. Ph.D. Th., Elec. Eng. Dept., MIT, Cambridge, Mass., Feb. 1963.
	2	LOUTREL, F. Determination of hidden edges in polyhedral figures: convex case. Tech. Rep. 400-145, Lab. for Electroscience Res., New York U., New York, Sept. 1966.
	3	LOUTREL, P. A solution to the "hidden line" problem for computer-drawn polyhedra. Tech. Rep. 400-167, New York U., New York, Sept. 1967.
	4	Arthur Appel, The notion of quantitative invisibility and the machine rendering of solids, Proceedings of the 1967 22nd national conference, p.387-393, January 1967, Washington, D.C., United States [doi>10.1145/800196.806007]
	5	WYLIE, C., ROMNEY, G., EVANS, D. C., AND ERDAHL, A. Halftone perspective drawing by computer. Tech. Rep. 4-2, Comput. Sci., U. of Utah, Salt Lake City, Utah, Feb. 1968.
	6	DE LOTTO, I., AND GALIMBERTI, R. Innovative design with computer graphics. A lta Frequenza 5 (1967), 430.
	7	KORN, G. A., AND KORN, T. M. Mathematical Handbook for Scientists and Engineers. McGraw-Hill, New York, 1961.

CITED BY 17

	F Devai, Quadratic bounds for hidden line elimination, Proceedings of the second annual symposium on Computational geometry, p.269-275, June 02-04, 1986, Yorktown Heights, New York, United States
	Steven L. Tanimoto, A graph-theoretic real-time visible surface editing technique, ACM SIGGRAPH Computer Graphics, v.11 n.2, p.223-228, Summer 1977
	Lee Markosian , Michael A. Kowalski , Daniel Goldstein , Samuel J. Trychin , John F. Hughes , Lubomir D. Bourdev, Real-time nonphotorealistic rendering, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, p.415-420, August 1997
	B. W. Jordan , R. C. Barrett, A cell organized raster display for line drawings, Communications of the ACM, v.17 n.2, p.70-77, Feb. 1974
	Ivan E. Sutherland , Robert F. Sproull , Robert A. Schumacker, A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys (CSUR), v.6 n.1, p.1-55, March 1974
	Gershon Elber , Elaine Cohen, Hidden curve removal for free form surfaces, ACM SIGGRAPH Computer Graphics, v.24 n.4, p.95-104, Aug. 1990
	Tomihisa Kamada , Satoru Kawai, An enhanced treatment of hidden lines, ACM Transactions on Graphics (TOG), v.6 n.4, p.308-323, Oct. 1987
	W. Jack Bouknight, A procedure for generation of three-dimensional half-toned computer graphics presentations, Communications of the ACM, v.13 n.9, p.527-536, Sept. 1970
	A. M. Messner , G. Q. Taylor, Algorithm 550: Solid Polyhedron Measures [Z], ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.121-130, March 1980
	Ivan E. Sutherland , Gary W. Hodgman, Reentrant polygon clipping, Communications of the ACM, v.17 n.1, p.32-42, Jan. 1974
	IEEE Computer Graphics and Applications, Fractional Invisibility, IEEE Computer Graphics and Applications, v.8 n.6, p.77-84, November 1988
	P. Chang , Ramesh Jain, A multi-processor system for hidden-surface-removal, ACM SIGGRAPH Computer Graphics, v.15 n.4, p.405-436, December 1981
	Ross Hilbert, Construction and display of three-dimensional polygonal-histograms, ACM SIGGRAPH Computer Graphics, v.15 n.2, July 1981
	Kevin Weiler , Peter Atherton, Hidden surface removal using polygon area sorting, ACM SIGGRAPH Computer Graphics, v.11 n.2, p.214-222, Summer 1977
	Todd Keeler , John Fedorkiw , Sherif Ghali, The spherical visibility map, Computer-Aided Design, v.39 n.1, p.17-26, January, 2007
	Ivan E. Sutherland , Robert F. Sproull , Robert A. Schumacker, Sorting and the hidden-surface problem, Proceedings of the June 4-8, 1973, national computer conference and exposition, June 04-08, 1973, New York, New York
	Nicholas Negroponte, Recent advances in sketch recognition, Proceedings of the June 4-8, 1973, national computer conference and exposition, June 04-08, 1973, New York, New York