• Articles • Previous Articles     Next Articles

A Basic Algorithm for Computer-Aided Design of Material Arrangement

Huang Wenqi; Wang Gangqiang;   

  1. Dept.of Computer Science Huazhong University of Science and Technology; Wuhan; Dept.of Computer Science; Huazhong University of Science and Technology;
  • Online:1992-01-10 Published:1992-01-10

An algorithm has been obtained for solving the packing problem of placing convex polygons with different shapes and sizes into a rectangular vessel by simulating the elastic mechanics process,it is pointed out that,based on this algorithm,a sysem of computer-aided design can be developed for arranging two-dimensional materials.

Key words: QoS,network routing,randomized algorithm,link-state information,performance measure;

[1] Dorit S.Hochbaum and Wolfgang Maass, Approximation schemes for covering and packing problems in image processing and VLSI. JACM,1985 , 32(1), 130-136.

[2] 黄文奇,詹叔浩, 求解Packing问题的拟物方法, 应用数学学报, 1979, 2(2).176-180.

[3] 黄文奇,李庆华,余向东, 求解空间Packing问题的拟物方法, 应用数学学报, 1986, 9(4).443-453.

[4] 中国科学院数学研究所计算站, DJS一21机标准程序汇编(第二分册), 科学出版社, 北京, 1974年.
No related articles found!
Full text



No Suggested Reading articles found!

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved