A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:39, 8 February 2024
scientific article; zbMATH DE number 7643395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete and efficient algorithm for the intersection of a general and a convex polyhedron |
scientific article; zbMATH DE number 7643395 |
Statements
A complete and efficient algorithm for the intersection of a general and a convex polyhedron (English)
0 references
18 January 2023
0 references
