期刊文献+

Approximation Algorithms for Solving Packing Problems of Convex Polygons in Plane

Approximation Algorithms for Solving Packing Problems of Convex Polygons in Plane
原文传递
导出
摘要 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.
出处 《Science China Mathematics》 SCIE 1993年第1期100-108,共9页 中国科学:数学(英文版)
关键词 CONVEX POLYGON embedded DEPTH SQUEEZING elastic potential initial COLLISION minimum COLLISION distance. convex polygon, embedded depth, squeezing elastic potential, initial collision, minimum collision distance.
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部