Densest translational lattice packing of non-convex polygons (Q1602949): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multiple translational containment. I: An approximate algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the intersection-depth to polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches to irregular nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double-lattice packings of convex bodies in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction and separation algorithms for non-convex polygons and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple translational containment. II: Exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / rank
 
Normal rank

Latest revision as of 11:13, 4 June 2024

scientific article
Language Label Description Also known as
English
Densest translational lattice packing of non-convex polygons
scientific article

    Statements