A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124)
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 7643395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.8363072276115417
0 references
0.8266118764877319
0 references
0.8183949589729309
0 references
