Hi James, James Zhang wrote:
> Looking for a solution to a general computational geometry problem. > > I have a curved ray (2D or 3D) and some sample points along the ray. ??? so how is your ray represented? can you generate sample points, or are the sample points the only data you have and want to use? > I also have a (2D or 3D) regular grid with equal spacing > in x, y and z direction. I want to compute the intersection > points between the ray and the grid. That is to find the intersection(S!!) of the ray and the grid lines or the intersection with the cells of the grid? > Computer Graphics Gems does not have such an algorithm. you could decompose your ray in linear fragments and use a algorithm to compute the intersection of the fragments with the grid. if your ray is a parametrized curve it should be easy to extract a formular that provides you with the intesections of the cells. be more specific... ;) Cheers, Karsten =========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA3D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
