Electronic Resource
Springer
Discrete & computational geometry
22 (1999), S. 231-248
ISSN:
1432-0444
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. We show that the maximum number of mutually nonoverlapping translates of any tetrahedron T which touch T is 18. Moreover, in the case of 18 touching translates the arrangement turns out to be unique. We also give a description of all possible arrangements of 17 touching translates. Finally, we apply these results to determine the minimum and maximum densities of 17 + -neighbor translative packings of tetrahedra.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/PL00009457
Permalink
|
Location |
Call Number |
Expected |
Availability |