davis@cpsc.ucalgary.ca (Angus Davis) (08/05/89)
I am looking for references to hidden line removal algorithms which need only handle inter-penetrating planar polygons. I am not really interested in code, although relatively good pseudo-code would be appreciated. Please send email directly to me or post a bibliography to the net. Thanks in advance. Angus
tim@micropen (Tim P. Leffler) (08/12/89)
In article <1669@cs-spool.calgary.UUCP>, davis@cpsc.ucalgary.ca (Angus Davis) writes: > I am looking for references to hidden line removal algorithms which > need only handle inter-penetrating planar polygons. I am not really > interested in code, although relatively good pseudo-code would be > appreciated. Please send email directly to me or post a bibliography > to the net. Thanks in advance. > > Angus Here is a list of a few references which might be of some interest: Giloi, W.K. Interactive Computer Graphics, Prentice-Hall, (1978). ----------------------------- Griffiths, J.G., "Bibliography of Hidden-Line and Hidden Surface Algorithms," Computer Aided Design, vol. 10, no.3 (May 1978). Loutrel, P.P., "A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra," IEEE Transactions on Computers, vol. C-19, pp. 205-213 (Mar 1970) Sutherland, I.E., Sproull, R.F., and Schumacker, R.A., "Sorting and the Hidden-Surface Problem," Conf. Proc. National Computer Conference, vol. 42 pp. 685 - 693, AFIPS Press (1973). Sutherland, I.E., Sproull, R.F., and Schumacker, R.A., "A Characterization of Ten Hidden-Surface Algorithms," Computing Surveys, vol. 6, no. 1, pp. 1 - 55 (Mar. 1974).