A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions |
scientific article; zbMATH DE number 6666305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions |
scientific article; zbMATH DE number 6666305 |
Statements
A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (English)
0 references
20 December 2016
0 references
convex polyhedra
0 references
intersection
0 references
Dobkin-Kirkpatrick hierarchy
0 references
