On the shortest paths between two convex polyhedra (Q3798231)
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 4064474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the shortest paths between two convex polyhedra |
scientific article; zbMATH DE number 4064474 |
Statements
On the shortest paths between two convex polyhedra (English)
0 references
1988
0 references
computational geometry
0 references
Davenport-Schinzel sequences
0 references
Euclidean shortest path
0 references
convex polyhedral
0 references
inverse of Ackermann's function
0 references
Voronoi diagram
0 references
0.97547275
0 references
0.94096804
0 references
0.9340888
0 references
0.9338142
0 references
0.9273242
0 references
0.9251235
0 references
0.92491543
0 references
0.92491543
0 references
