The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of c...The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of convex polygons in plane is constructed.展开更多
文摘The problem of initial collision between convex polygons is studied in detail, and a fast algorithm for finding the embedded depth is obtained, by which the fast approximate algorithm for solving packing problems of convex polygons in plane is constructed.