Examples

Problem descriptions are represented in attached files.

 

Packing circles, convex polygons and circular segments

Packing circles, convex and nonconvex polygons, circular segments

Packing composed object

Demo

Only movies are represented.

 

2D packing

 

Packing composed objects

 

 

 

 

 

Packing composed objects with prohibited areas (colored in red)

 

 

 

 

 

 

 

 

 

3D packing

 

Packing parallelepipeds, right cylinders and composed objects with minimal admissible distances and cylindrical prohibited areas

 

 

Packing cylinders

 

 

Description of the solution algorith with example

 

Problem example. Place two circles: C1 of radius r1 = 2.2 and C2 of radius r2 = 2.9 and two non-orieted rectangles R3 and R4 of sizes (a3=3.1, b3=1) and (a4=6.9, b4=0.5) into rectangle

,

so that the width l of R0  will reach its minimal value.