Densest Lattice Packings of 3-Polytopes

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages

Scientific paper

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies
we present an efficient algorithm for computing the density of a densest
lattice packing of an arbitrary 3-polytope. As an application we calculate
densest lattice packings of all regular and Archimedean polytopes.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Densest Lattice Packings of 3-Polytopes 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 Densest Lattice Packings of 3-Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Densest Lattice Packings of 3-Polytopes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-548524

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.