Test for intersection between box and tetrahedron (Q4375398)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1113405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Test for intersection between box and tetrahedron |
scientific article; zbMATH DE number 1113405 |
Statements
Test for intersection between box and tetrahedron (English)
0 references
5 January 1999
0 references
tetrahedron
0 references
box
0 references
geometric intersection
0 references
barycentric coordinates
0 references
range computation
0 references
interval analysis
0 references
numerical examples
0 references
0.8061551451683044
0 references
0.761377215385437
0 references
0.730305016040802
0 references
0.7280451655387878
0 references
0.7030695676803589
0 references
The authors develop a procedure for determining rigorously whether a box \(B\) intersects a nondegenerate tetrahedron \(T\). To this end they introduce barycentric coordinates with respect to the vertices of \(T\) and evaluate them interval arithmetically for \(B\). The resulting intervals are used for the decision process \(T\cap B=\emptyset\), \(T\cap B\neq \emptyset\), \(T\subseteq B\), \(B\subseteq T\), which is based on the concept of a separating plane. Numerical examples illustrate the efficiency of the method.
0 references
