an:05860769
Zbl 1206.65059
Ratschek, H.; Rokne, J. G.
How trivial are reliable box-plane intersections?
EN
Comput.-Aided Des. 32, No. 11, 643-648 (2000).
00275365
2000
j
65D17 68U07 68U05
Summary: Three completely different algorithms for box-plane intersection testing are considered. They are compared with respect to worst case analysis, average performance and overhead. It turns out that each of the algorithms has different advantages and it is difficult to select one of them. Particular new aspects include the observation that one only needs two vertices on a particular diagonal of the box to determine the intersection with the plane and that the algorithm ESSA is used to resolve cases left indeterminate by the main algorithm because of rounding errors.