Test for intersection between box and tetrahedron

International Journal of Computer Mathematics

Volumn 65, Issue 3-4, 1997, Pages 191-204

  Ratschek, Helmut ^a   Rokne, Jon ^b  

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Barycentric coordinates; Box; Geometric intersection; Interval analysis; Range computations; Tetrahedron

Indexed keywords

DIGITAL ARITHMETIC; ERROR ANALYSIS;

BARYCENTRIC COORDINATES; GEOMETRIC INTERSECTIONS;

COMPUTATIONAL GEOMETRY;

EID: 0031322523     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169708804610     Document Type: Article

References (15)

1. Chazelle, B. and Dobbin, D. P. (1987). Intersection of convex objects in two and three dimensions. Journal of the Association for Computing Machinery, 34, pp. 1-27.
2. Franklin, W. R. (1982). Efficient polyhedron intersection and union. Proc. Graphics Interface 82, Canadian Information Processing Soc., Toronto, pp. 73-80.
3. Greene, N. (1994). Detecting intersection of a rectangular solid and a convex polyhedron. In: Graphic Gems IV (ed. by P. S. Heckbert), Academic Press, Boston, pp. 74-82.
4. Hanson, A. J. (1994). Geometry for N-dimensional graphics. In: Graphic Gems IV (ed. by P. S. Heckbert), Academic Press, Boston, pp. 149-170.
5. Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C. and Rauch, M. (1993). C-XSC. Springer-Verlag.
6. Maruyama, K. (1972). A procedure to determine intersections between polyhedral objects. International Journal of Computer and Information Sciences, 1, pp. 255-266.
7. Mäntylä, M. (1986). Boolean operations of 2-manifolds through vertex neighborhood classification. ACM Trans. on Graphics, 5, pp. 1-29.
8. Ratschek, H. and Rokne, J. (1984). Computer Methods for the Range of Functions. Ells Horwood.
9. Ratschek, H. and Rokne, J. (1993). Test for intersection between plane and box. Computer-Aided Design, 25, pp. 249-250.
10. Ratschek, H. and Rokne, J. (1996). The relationship between a rectangle and a triangle. The visual Computer, 12, pp. 360-370.
11. Rokne, J. (1992). Interval arithmetic. In: Graphics Gems III, Academic Press, pp. 61-66 and 454-457.
12. Shene, C.-K. (1994). Test for intersection between plane and a connected compact polyhedron. Computer-Aided Design, 26, pp. 585-588.
13. Skelboe, S. (1974). Computation of rational interval functions. BIT, 14, pp. 87-95.
14. Snyder, J. M. and Barr, A. H. (1987). Ray tracing complex models containing surface tesselations. Computer Graphics, 21, pp. 119-126.
15. Strip, D. and Karasik, M. (1994). SIMD algorithms for intersecting three-dimensional polyhedra. SIAM New, 27(3), pp. 1, 10, 11, 13.