Rotational polygon containment and minimum enclosure using only robust 2D constructions

Computational Geometry: Theory and Applications

Volumn 13, Issue 1, 1999, Pages 3-19

  Milenkovic, Victor J ^a  

^a UNIVERSITY OF MIAMI   (United States)

Author keywords

Containment; Geometric rounding; Layout; Minimum enclosure; Packing or nesting of irregular polygons; Robust geometry

Indexed keywords

EID: 0001551468     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00006-1     Document Type: Article

References (38)

1. P. Agarwal, N. Amenta, M. Sharir, Largest placement of one convex polygon inside another, in: Proceedings of the 2nd Workshop on Algorithmic Foundations of Robotics, July 1996.
2. P.K. Agarwal, B. Aronov, M. Sharir, Motion planning for a convex polygon in a polygonal environment, in preparation, 1992.
3. F. Avnaim, Placement et déplacement de formes rigides ou articulées, Ph.D. Thesis, Université de Franche-Comté, France, 1989.
4. F. Avnaim, J. Boissonnat, Polygon placement under translation and rotation, in: Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 294, Springer, 1988, pp. 322-333.
5. C. Bounsaythip, S. Maouche, Irregular shape nesting and placing with evolutionary approach, in: 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, IEEE, New York, NY, 12-15 October 1997, p. 5.
6. B. Chazelle, The polygon containment problem, in: F. Preparata (Ed.), Advances in Computing Research, Volume 1: Computational Geometry, JAI Press, Inc., Greenwich, CT, 1983, pp. 1-33.
7. K. Daniels, Containment algorithms for nonconvex polygons with applications to layout, Ph.D. Thesis, Harvard University, Cambridge, MA, 1995.
8. K. Daniels, V. Milenkovic, Column-based strip packing using ordered and compliant containment, in: Proc. 1st ACM Workshop on Appl. Comput. Geom. 1996, pp. 33-38.
9. K. Daniels, V.J. Milenkovic, Multiple translational containment, Part I: An approximate algorithm, Algorithmica 19 (1997) 148-182.
10. K.A. Dowsland, W.B. Dowsland, Packing problems, European J. Oper. Res. 56 (1992) 2-14.
11. K.A. Dowsland, W.B. Dowsland, Solution approaches to irregular nesting problems, European J. Oper. Res. 84 (3) (1995) 506-521.
12. H. Dyckhoff, A typology of cutting and packing problems, European J. Oper. Res. 44 (1990) 145-159.
13. R.M.S. Abd El-Aal, A new technique for nesting irregular shapes based on rectangular modules, Current Advances in Mechanical Design and Production 1996 6 (1996) 533-540.
14. D.H. Greene, F.F. Yao, Finite-resolution computational geometry, in: Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., 1986, pp. 143-152.
15. R. Grinde, T. Cavalier, Containment of a single polygon using mathematical programming, Technical Report IMSE Working Paper 92-164, The Pennsylvania State University, Department of Industrial and Management Systems Engineering, 1993.
16. R.B. Grinde, T.M. Cavalier, A new algorithm for the two-polygon containment problem, Comput. Oper. Res., to appear, 1996.
17. L. Guibas, D. Marimont, Rounding arrangements dynamically, in: Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 190-199.
18. G.C. Han, S.J. Na, Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing, J. Engrg. Manufacture 210 (B6) (1996) 509-519.
19. R. Heckmann, T. Lengauer, Computing upper and lower bounds on textile nesting problems, Lecture Notes in Computer Science, Vol. 1136, 1996, pp. 392-405.
20. K. Hoang, Aspects in automatic nesting of irregular shapes, in: Proceedings of the SPIE - The International Society for Optical Engineering, Vol. 2589, 23-26 October 1995, pp. 234-241.
21. P. Jain, P. Fenyes, R. Richter, Optimal blank nesting using simulated annealing, J. Mech. Design 114 (1) (1992) 160-165.
22. H.J. Lamousin, W.N. Waggenspack, G.T. Dobson, Nesting of complex 2-d parts within irregular boundaries, J. Mech. Design 118 (4) (1996) 615.
23. Z. Li, Compaction algorithms for nonconvex polygons and their applications, Ph.D. Thesis, Harvard University, Cambridge, MA, 1994.
24. Z. Li, V. Milenkovic, Compaction and separation algorithms for nonconvex polygons and their applications, European J. Oper. Res. 84 (1995) 539-561.
25. V. Milenkovic, Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic, in: Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., 1989, pp. 500-505.
26. V. Milenkovic, Rounding face lattices in the plane, in: Abstracts 1st Canad. Conf. Comput. Geom., 1989, p. 12.
27. V. Milenkovic, Translational polygon containment and minimal enclosure using linear programming based restriction, in: Proc. 28th Annu. ACM Sympos. Theory Comput. (STOC'96), 1996, pp. 109-118.
28. V. Milenkovic, K. Daniels, Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming, Technical Report 25-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, Cambridge, MA, 1995.
29. V.J. Milenkovic, Multiple translational containment, Part II: Exact algorithms, Algorithmica 19 (1997) 183-218.
30. V.J. Milenkovic, Practical methods for set operations on polygons using exact arithmetic, in: Proc. 7th Canad. Conf. Comput. Geom., 1995, pp. 55-60.
31. V.J. Milenkovic, Shortest path rounding, Algorithmica, in press, 1998.
32. V.J. Milenkovic, Rotational polygon overlap minimization, Computational Geometry 10 (4) (1998) 305-318.
33. V.J. Milenkovic, K. Daniels, Translational polygon containment and minimal enclosure using mathematical programming, Intern. Trans. Oper. Res., in press, 1999.
34. Y.K.D.V. Prasad, A set of heuristic algorithms for optimal nesting of two-dimensional irregularly shaped sheet-metal blanks, Computers in Industry 24 (1) (1994) 55-70.
35. Y.K.D.V. Prasad, S. Somasundaram, K.P. Rao, A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks, Internat. J. Production Res. 33 (6) (1995) 1505-1520.
36. P.E. Sweeney, E.R. Paternoster, Cutting and packing problems: A categorized, application-oriented research bibliography, J. Oper. Res. Soc. 43 (7) (1992) 691-706.
37. J.Y. Wang, D.Y. Liu, E.W. Lee, TH. Koh, An algorithm for nesting patterns in apparel, in: Computer Integrated Manufacturing International Conference, Vol. 1, World Scientific, 1995, pp. 377-384.
38. P.F. Whelan, B.G. Batchelor, Automated packing systems: review of industrial implementations, in: Proceedings of the SPIE - The International Society for Optical Engineering, Vol. 2064, SPIE, 1993, pp. 358-369.