Containment of a single polygon using mathematical programming

European Journal of Operational Research

Volumn 92, Issue 2, 1996, Pages 368-386

  Grinde, Roger B ^a   Cavalier, Tom M ^b  

^a UNIVERSITY OF NEW HAMPSHIRE   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Algorithm; Computational geometry; Nesting; Parametric programming; Pattern layout; Polygon containment; Stock cutting

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; OPERATIONS RESEARCH; OPTIMIZATION;

NESTING; PARAMETRIC PROGRAMMING; PATTERN LAYOUT; POLYGON CONTAINMENT; POLYGONS; STOCK CUTTING PROBLEM;

MATHEMATICAL PROGRAMMING;

EID: 0030193687     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00279-7     Document Type: Article

References (12)

1. Albano, A., and Sapuppo, G. (1980), "Optimal allocation of two-dimensional irregular shapes using heuristic search methods", IEEE Transactions on Systems, Man, and Cybernetics 10, 242-248.
2. Amaral, C., Bernardo, J., and Jorge, J. (1990), "Marker-making using automatic placement of irregular shapes for the garment industry", Computers and Graphics, 14, 41-46.
3. Avnaim, F., and Boissonnat, J.D. (1989), "Polygon placement under translation and rotation", Theoretical Informatics and Applications, 23, 5-28.
4. Bazaraa, M.S., Sherali, H.D., and Shetty, C.M. (1993), Nonlinear Programming: Theory and Algorithms, Wiley, New York.
5. Blazewicz, J., Hawryluk, P., and Walkowiak, R. (1993), "Using a Tabu Search approach for solving the two-dimensional irregular cutting problem", Annals of Operations Research 41, 313-325.
6. Chazelle, B. (1983), "The polygon containment problem", in: F.P. Preparata (ed.), Advances in Computing Research, Vol. 1, 1-33.
7. Chung, J., Scott, D., and Hillman, D.J. (1990), "An intelligent nesting system on 2-D highly irregular resources", Applications of Artificial Intelligence VIII (SPIE) 1293/1, 472-483.
8. Grinde, R.B. (1993), "Polygon containment and nesting: An optimization-based approach", Ph.D. Dissertation, Department of Industrial and Management Systems Engineering, The Pennsylvania State University.
9. Heistermann, J., and Lengauer, T. (1993), "Efficient automatic part nesting on irregular and inhomogeneous surfaces", in: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 251-259.
10. Hooper, H. (1986), "The nesting and marking of ship parts cut from steel plate", Journal of Ship Production 2, 8-17.
11. Martin, R.R., and Stephenson, P.C. (1988), "Putting objects into boxes", Computer-Aided Design, 20, 506-514.
12. Oliveira, J.F.C., and Ferreira, J.A.S. (1993), "Algorithms for nesting problems", in: R.V. Vidal (ed.), Simulated Annealing: Lecture Notes in Economics and Mathematical Systems 396, Springer-Verlag, Berlin, 256-273.