Brian Schott wrote: > > I have been thinking about this problem a little differently, by > comparing the length of the line-segment vector projected onto the > radius in the same plane as the line-segment vector to the value of R > or perhaps the reverse length (of the radius vector projected onto the > line-segment), but I can't quite get beyond that starting thought. > > Can anyone take my idea and tell me if it's really a good start? > > -- > (B=) > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > >
You may also consider a problem of determining whether a(n infinite) line given by two points S and E intersects a circle with center at C and radius R. A solution would be to find the distance of C from the line, i.e to find the length of a line segment perpendicular to the line, which ends at C. It's probably easier to sketch this than describe in words. The test then would be simply: R > (C-S) dist E-S where dist is the sought verb that calculates the distance. PS: composed on a handheld device. -- View this message in context: http://old.nabble.com/Puzzle%3A-line-circle-sphere-intersection-tp29900737s24193p29909230.html Sent from the J Programming mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
