Cited By
View all- Chen DHu XHuang YLi YXu J(2001)Algorithms for congruent sphere packing and applicationsProceedings of the seventeenth annual symposium on Computational geometry10.1145/378583.378672(212-221)Online publication date: 1-Jun-2001
Efficient automatic part nesting on irregular and inhomogeneous surfaces
References
[1]
E.G. Coffman and M.R. Garey and D.S. Johnson and R.E. Tarjan, Performance Bounds for Level-oriented Two. dimensional Packing Algorithms, SIAM Journal of Computing, 4 (1980), pp. 808-826.
[2]
D. Sleator, A ~.5 times optimal algorithm .for packing in two dimensions, Information Processing Letters, 10 (1980), PP. 37-40.
[3]
S.A. Roberts, Application of Heuristic Techniques to the Cutting-Stock Problem for Worktops, Journal of the Operational Research Society, 5 (1984), pp. 369-377.
[4]
E.G. Coffman and P.W. Shot, Average-case analysis of cutting and packing in two dimensions, European Journal of Operational Research, 2 (1990), pp. 134- 144.
[5]
Alan A. Farley, The cutting stock problem in the canvas industry, European Journal of Operational Research, 2 (1990), pp. 247-255.
[6]
Jos~ Soeiro Ferreira and Jos~ Fernando Oliveira, An improved version of Wang's algorithm for two-dimen. sional cutting problems, European Journal of Operational Research, 2 (1990), pp. 209-223.
[7]
M. Adamowicz and A. Albano, Nesting two-dimensional shapes in rectangular modules, Computer Aided Design, 1 (1976), pp. 27-33.
[8]
A. Albano and G. Sappupo, Optimal allocation of two-dimensional irregular shapes using heuristic search methods, IEEE Transactions on Systems, Man and Cybernetics, 5 (1980), pp. 242-248.
[9]
J. Bailleul and R. Soenen and K. Tiaibia, Nesting Two Dimensional Irregular Shapes in A nisotropic Material, Advances in CAD/CAM -- Proceedings of the 5th International IFIP/iFAC Conference on Programming Research and Operations Logistics in Advanced Manufactoring Technology, 1983.
[10]
Weishuang Qu and Jerry L. Sanders, A nesting algorithm for irregular parts and parts affecting trim loss, International Journal of Production Research, 3 (1987), pp. 381-397.
[11]
Wen Lu, Computer Aided Nesting of Two Dimensional Polygonal Components, UK Thesis, Department of Production Research, University of Nottingham, Nottingham, Great Britain, 1987.
[12]
Jason Chung and Donald J. Hillman and David Scott, An Intelligent Nesting System on ~-D Highly Irregular Resources, Applications of Artificial Intelligence VIII -- Proceedings of the 8th International Conference of SPIE (The International Society for Optical Engineering), 1990.
[13]
Moshe Ben-Bassat and Dov Dori, Efficient Nesting of Congruent Convex Figures, Communications of the ACM, 3 (1984), pp. 228-235.
[14]
Harald Dyckhoff and Gerhard W/scher, Special issue on Cutting and Packing, European Journal of Operational Research, 2 (1990).
[15]
Harald Dyckhoff and Ute Finke, Cutting and Packing in Production and Distribution, Physica-Verlag, Heidelberg, 1992.
[16]
Elizabeth Ridenour Paternoster and Paul E. Sweehey, Cutting and Packing Problems: A Categorized Application-Orientated Research Bibliography, Journal of the Operational Research Society, 7 (1992), pp. 691- 706.
[17]
Rudolf Lindemann and Guntram Scheithauer and Johannes Terno, Zuschnittprobleme und ihre praktische L~sung, Verlag Harri Deutsch, Fremkfurt am Main, 1987.
[18]
Jiirgen Doenhardt and Thomas Lenganer, Algorithmic Aspects of One-Dimensional layout Compaction, IEEE Transactions on Computer-Aided Design, 5 (1987), pp. 863-878.
[19]
Franco P. Preparata and Michael Ian Shamos, Compu. tational Geometry, Springer Verlag, New York, 1985.
Index Terms
- Efficient automatic part nesting on irregular and inhomogeneous surfaces
Recommendations
A random-key genetic algorithm for solving the nesting problem
This article presents a random-key genetic algorithm RKGA for the nesting problem, a particular case of cutting and packing problems in which a collection of items or polygons has to be packed onto a rectangular object with the aim of minimising its ...
A random-key genetic algorithm for solving the nesting problem
Advances for the Next Generation of Intelligent Manufacturing SystemsThis article presents a random-key genetic algorithm RKGA for the nesting problem, a particular case of cutting and packing problems in which a collection of items or polygons has to be packed onto a rectangular object with the aim of minimising its ...
A customized branch-and-bound approach for irregular shape nesting
We study the Nesting Problem, which aims to determine a configuration of a set of irregular shapes within a rectangular sheet of material of fixed width, such that no overlap among the shapes exists, and such that the length of the sheet is minimized. ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIAM: Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 January 1993
Check for updates
Author Tags
Qualifiers
- Article
Conference
SODA93
Sponsor:
- SIGACT
- SIAM
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 546Total Downloads
- Downloads (Last 12 months)55
- Downloads (Last 6 weeks)12
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
Cited By
View all- Chen DHu XHuang YLi YXu J(2001)Algorithms for congruent sphere packing and applicationsProceedings of the seventeenth annual symposium on Computational geometry10.1145/378583.378672(212-221)Online publication date: 1-Jun-2001
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in