Pages that link to "Item:Q2274890"

The following pages link to Packing ellipses in an optimized convex polygon (Q2274890):

Displaying 9 items.

• Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
• Lattice coverage of cuboid with minimum number of hemispheres (Q2103797) (← links)
• Parallel computing technologies for solving optimization problems of geometric design (Q2174043) (← links)
• Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
• On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container (Q2299015) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
• The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)