Densest translational lattice packing of non-convex polygons
暂无分享,去创建一个
[1] David M. Mount,et al. The Densest Double-Lattice Packing of a Convex Polygon , 1991, Discrete and Computational Geometry.
[2] Greg Kuperberg,et al. Double-lattice packings of convex bodies in the plane , 1990, Discret. Comput. Geom..
[3] Victor Milenkovic,et al. Containment algorithms for nonconvex polygons with applications to layout , 1995 .
[4] K. Dowsland,et al. Solution approaches to irregular nesting problems , 1995 .
[5] V. Milenkovic,et al. Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .
[6] Victor J. Milenkovic,et al. Multiple Translational Containment Part II: Exact Algorithms , 1997, Algorithmica.
[7] Victor J. Milenkovic,et al. Multiple Translational Containment Part I: An Approximate Algorithm , 1997, Algorithmica.
[8] V. Milenkovic,et al. Translational polygon containment and minimal enclosure using mathematical programming , 1999 .
[9] Victor J. Milenkovic,et al. Translational polygon containment and minimal enclosure using linear programming based restriction , 1996, STOC '96.
[10] Zhenyu Li,et al. Compaction algorithms for non-convex polygons and their applications , 1995 .
[11] Paul F. Whelan,et al. Automated packing systems: review of industrial implementations , 1993, Other Conferences.
[12] Paul E. Sweeney,et al. Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .
[13] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .