Mathematics – Metric Geometry
Scientific paper
2010-08-13
Mathematics
Metric Geometry
19 pages, 11 figures
Scientific paper
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of the problem arise depending on the type of isometries allowed for the packing: packing by translates, lattice packing, translates and point reflections, or all isometries. Due to its connections with number theory, crystallography, etc., lattice packing has been studied most extensively. In two dimensions the theory is fairly well developed, and there are several significant results on lattice packing in three dimensions as well. This article surveys the known results, focusing on the most recent progress. Also, many new problems are stated, indicating directions in which future development of the general packing theory in three dimensions seems feasible.
Bezdek András
Kuperberg Włodzimierz
No associations
LandOfFree
Dense packing of space with various convex solids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dense packing of space with various convex solids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense packing of space with various convex solids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-42192