The densest double-lattice packing of a convex polygon

David M. Mount

doi:10.1090/dimacs/006/17

ScienceGate Book Chapters

BOOK-CHAPTER

The densest double-lattice packing of a convex polygon

David M. Mount

Year: 1991 DIMACS series in discrete mathematics and theoretical computer science Pages: 245-262

DOI: 10.1090/dimacs/006/17

Get Full-Text PDF Get Analytical Report

Keywords:

Regular polygon Combinatorics Rectilinear polygon Polygon (computer graphics) Lattice (music) Convex polygon Materials science Mathematics Geometry Computer science Physics Simple polygon

Metrics

Cited By

4.36

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Digital Image Processing Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

The densest double-lattice packing of a convex polygon

Metrics

Citation History

Topics

Related Documents

Densest translational lattice packing of non-convex polygons

The densest double lattice packing of four‐spheres

Densest translational lattice packing of non-convex polygons (extended abstract)

The densest lattice packing of tetrahedra

On the densest packing of convex discs