11BDODD@GALLUA.BITNET (02/12/90)
I am taking Computer Graphics class. I can't find an algorithm I need in my book. May I have an algorithm of Sutherland-Hodgman? It is about clipping graph algorithm. Thank-you, Beverly Dodd Beverly Dodd Bitnet: 11bdodd@gallua.bitnet People/Link: B.DODD Gallaudet University Internet: 11bdodd@gallux.gallaudet.edu GEnie: B.DODD1 P.O. Box 489, 800 Florida Ave., N.E., Washington, DC 20002 "Gallaudet University is the only university for the deaf in the world."
phorgan@cup.portal.com (Patrick John Horgan) (02/13/90)
Does anyone get the idea that Beverly wants a reference to Sutherland- Hodgman? <grin> Sutherland, I. E., Hodgman, G. W., "Reentrant Polygan Clipping," Communications of the ACM, vol. 17, no. 1, pp. 32-42 (1974) It's also covered in ... Harrington, Steve, "Computer Graphics A Programming Approach" McGraw-Hill Inc. ISBN 0-07-026753-7 pp. 184-198 (1987) Patrick Horgan phorgan@cup.portal.com
flitter@dtrc.dt.navy.mil (Flitter) (02/26/90)
> I am taking Computer Graphics class. I can't find an algorithm I need >in my book. > May I have an algorithm of Sutherland-Hodgman? It is about clipping graph >algorithm. I have the Sutherland-Hodgman algoithm in a book, which I do not have with me. If you still need it send me a message to remind me and I will bring the book in. It is in the new (as yet unpublished) version of Foley's book. I don't know if it is in the old version. I'll have to check.