JOURNAL ARTICLE

Densest translational lattice packing of non-convex polygons

Victor Milenkovic

Year: 2002 Journal:   Computational Geometry Vol: 22 (1-3)Pages: 205-222   Publisher: Elsevier BV
Keywords:
Regular polygon Lattice (music) Combinatorics Mathematics Geometry Physics

Metrics

19
Cited By
1.60
FWCI (Field Weighted Citation Impact)
13
Refs
0.83
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

Related Documents

JOURNAL ARTICLE

Improved Approximations for Translational Packing of Convex Polygons

Kurpisz, AdamSuter, Silvan

Journal:   Repository for Publications and Research Data (ETH Zurich) Year: 2023
BOOK-CHAPTER

The densest double-lattice packing of a convex polygon

David M. Mount

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

The densest lattice packing of tetrahedra

Douglas J. Hoylman

Journal:   Bulletin of the American Mathematical Society Year: 1970 Vol: 76 (1)Pages: 135-137
BOOK-CHAPTER

Optimized Packing Soft Convex Polygons

Igor LitvinchevLuis InfanteТ. RomanovaAlberto Martinez-NoaLuis B. Gutiérrez

EAI/Springer Innovations in Communication and Computing Year: 2023 Pages: 89-97
© 2026 ScienceGate Book Chapters — All rights reserved.