2012
DOI: 10.1088/1742-6596/402/1/012005
|View full text |Cite
|
Sign up to set email alerts
|

Structural search for dense packing of concave and convex shapes in two dimensions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…The structural searches for the maximum density crystals, reported in this Section, have been carried out using the Isopointal Search Algorithm introduced by Hudson and Harrowell [26] and implemented for anisotropic particles by Elias and Hudson [27]. This search involves a systematic calculation of the maximum density packings of all possible 2D crystals that satisfy a given restriction on the particles in the unit cell.…”
Section: Densest Crystal Packingmentioning
confidence: 99%
“…The structural searches for the maximum density crystals, reported in this Section, have been carried out using the Isopointal Search Algorithm introduced by Hudson and Harrowell [26] and implemented for anisotropic particles by Elias and Hudson [27]. This search involves a systematic calculation of the maximum density packings of all possible 2D crystals that satisfy a given restriction on the particles in the unit cell.…”
Section: Densest Crystal Packingmentioning
confidence: 99%