Path: utzoo!attcan!uunet!samsung!sol.ctr.columbia.edu!srcsip!msi-s0.msi.umn.edu!umeecs!zip!spencer From: spencer@eecs.umich.edu (Spencer W. Thomas) Newsgroups: comp.graphics Subject: foo Message-ID: Date: 2 Oct 90 17:12:17 GMT References: Sender: news@zip.eecs.umich.edu Distribution: comp Organization: University of Michigan EECS Dept Lines: 30 In-Reply-To: hansen@acl.lanl.gov's message of 28 Sep 90 13:55:02 GMT In article hansen@acl.lanl.gov (Charles D. Hansen) writes: > Does anyone know of a public domain hidden line removal suitable for > plotters (yes, it's still 1964 here)? There are several. Try C. H. Sequin and P. R. Wensley, "Visible Feature Return at Object Resolution", IEEE Computer Graphics and Applications, Vol. 5, No. 5, May, 1985. S. Sechrest and D. P. Greenberg, "A Visible Polygon Reconstruction Algorithm", Computer Graphics, Vol. 15, No. 3 (Proceedings of SIGGRAPH '81). Both of these are variants of the Hamlin and Gear "cross" algorithm. Also see W. R. Franklin, "A Linear Time Exact hidden Surface Algorithm", Computer Graphics, Vol. 14, No. 3 (Proceedings of SIGGRAPH '80). W. R. Franklin, "Parallel object-space hidden surface removal", Computer Graphics, Vol. 24, No. 4 (Proceedings of SIGGRAPH '90). Or did you want working code? If so, sorry for cluttering the airwaves. -- =Spencer W. Thomas EECS Dept, U of Michigan, Ann Arbor, MI 48109 spencer@eecs.umich.edu 313-936-2616 (8-6 E[SD]T M-F)