|
|
The problem of computing the minimal squared distance between a ray and a rectangle is very similar to the one of calculating the distance between a line and a rectangle. However the domain for the parameter r of the ray this time is r >= 0. Therefore we get more regions when partitioning the space spanned by (s, t, r) into regions. To be exact we get 9 more regions that we shall call 0n, 1n and so forth since they are located alongside the negative r-axis and mirror the other regions we had so far.
|
Copyright © by Martin Ecker |