Tripods do not pack densely
UNSPECIFIED (2000) Tripods do not pack densely. In: 6th Annual International Computing and Combinatorics Conference (COCOON 2000), SYDNEY, AUSTRALIA, JUL 26-28, 2000. Published in: COMPUTING AND COMBINATORICS, PROCEEDINGS, 1858 pp. 272-280.Full text not available from this repository.
In 1994, S. K. Stein and S. Szabo posed a problem concerning, simple, three-dimensional shapes, known as, semicrosses, or tripods. By definition, a tripod is formed by a corner and the three adjacent edges of an integer cube. How densely can one fill the space with non-overlapping tripods of a given size? In particular, is it possible to fill a constant fraction of the space as the tripod size tends to infinity.? In this paper, we settle the second question in the negative: the fraction of the space that can be filled with tripods of a growing size must be infinitely small.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||COMPUTING AND COMBINATORICS, PROCEEDINGS|
|Editor:||Du, DZ and Eades, P and EstivillCastro, V and Lin, X and Sharma, A|
|Number of Pages:||9|
|Page Range:||pp. 272-280|
|Title of Event:||6th Annual International Computing and Combinatorics Conference (COCOON 2000)|
|Location of Event:||SYDNEY, AUSTRALIA|
|Date(s) of Event:||JUL 26-28, 2000|
Actions (login required)
Downloads per month over past year