Pages that link to "Item:Q519665"
From MaRDI portal
The following pages link to Numerical optimization method for packing regular convex polygons (Q519665):
Displaying 11 items.
- A method of optimal lattice packing of congruent oriented polygons in the plane (Q1576353) (← links)
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules (Q1578669) (← links)
- Approximation algorithms for solving packing problems of convex polygons in plane (Q1801732) (← links)
- Packing ovals in optimized regular polygons (Q2173521) (← links)
- Multistage approach to solving the optimization problem of packing nonconvex polyhedra (Q2215293) (← links)
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container (Q2299015) (← links)
- Method of sentinels for packing items within arbitrary convex regions (Q3418861) (← links)
- Algorithms of Optimal Packing Construction in Ellipse (Q4600365) (← links)
- (Q4723586) (← links)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
- Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique (Q6043465) (← links)