Test for intersection between a plane and a connected compact polyhedron (Q1335437): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:22, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Test for intersection between a plane and a connected compact polyhedron |
scientific article |
Statements
Test for intersection between a plane and a connected compact polyhedron (English)
0 references
28 March 1995
0 references
A method of constructing a test for intersection between a plane and a connected compact polyhedron with a finite number of vertices is proposed. Using linear programming, the intersection test is transformed to compute the range of a linear function, and then test to see whether it contains zero. A complexity analysis of the algorithm and computer experiment examples are presented.
0 references
geometric intersections
0 references
range computations
0 references
numerical examples
0 references
complexity
0 references
linear programming
0 references
algorithm
0 references
