COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON (Q4682154)
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: COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON |
scientific article; zbMATH DE number 2174807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON |
scientific article; zbMATH DE number 2174807 |
Statements
COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON (English)
0 references
10 June 2005
0 references
Polyhedron
0 references
intersection
0 references
collision detection
0 references
line segment
0 references
0.7688206434249878
0 references
0.7593867182731628
0 references
0.7568915486335754
0 references
0.7524304986000061
0 references
