jackg@tekirl.LABS.TEK.COM (Jack Gjovaag) (09/29/89)
In article <2972@ndsuvax.UUCP> ncsmith@ndsuvax.UUCP (Timothy Lyle Smith) writes: > > I need to find a formula/algorithm to determine if a line intersects > a polygon. I would perfer a method that would do this in as litte > time as possible. I need this for use in a forward raytracing > program. > Questions such as this arise regularly on the net. I do not propose to offer a specific solution but I would like to suggest a mechanism where such questions need not generate a new round of repetitive answers. Would it be desirable to start a newsgroup such as alt.gourmand but dealing with graphics algorithms? Algorithms could be submitted, and after some level of moderator review, be posted and archived so new posters to the net can find answers to questions such as the above one by looking at what has been archived and actually get their hands on appropriate algorithms. The point of this is that good answers to algorithmic questions should live on past their news expiration date and newcomers should be able to get at them. Since I don't know a lot about the mechanism that alt.gourmand uses, I am not sure about the practicality of the same thing for graphics algorithms, but I do know that it sure works nice for us cooks. Jack Gjovaag Tek Labs