UNSPECIFIED (2000) Tripods do not pack densely. In: 6th Annual International Computing and Combinatorics Conference (COCOON 2000), JUL 26-28, 2000, SYDNEY, AUSTRALIA.

Full text not available from this repository.

Abstract

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
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-67787-9
ISSN:	0302-9743
Editor:	Du, DZ and Eades, P and EstivillCastro, V and Lin, X and Sharma, A
Date:	2000
Volume:	1858
Number of Pages:	9
Page Range:	pp. 272-280
Publication Status:	Published
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
URI:	http://wrap.warwick.ac.uk/id/eprint/11621

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item