A complete and efficient algorithm for the intersection of a general and a convex polyhedron (Q5060124): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_258 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1563089099 / rank | |||
Normal rank | |||
Revision as of 14:20, 19 March 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
