Minimum convex partition of polygonal domains by guillotine cuts

Discrete and Computational Geometry

Volumn 19, Issue 2, 1998, Pages 291-305

  Martini, H ^a   Soltan, V ^b  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032360524     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009346     Document Type: Article

References (22)

1. Asano, T., Asano, T., Minimum partition of polygonal region into trapezoids, 24th Ann. Symp. on Foundations of Computer Science, Silver Spring, MD, 1983, pp. 233-241.
2. Chazelle, B., Dobkin, D.P., Optimal convex decomposition, in: Computational Geometry (G.T. Toussaint, Ed.), pp. 63-133, North-Holland, Amsterdam, 1985.
3. Chazelle, B., Palios, L., Decomposition algorithms in geometry, in: Algebraic Geometry and Applications (C.L. Bajaj, Ed.), pp. 419-449, Springer-Verlag, New York, 1994.
4. Chiuyang, C., Ruei-Chuan, C., On the minimality of polygon triangulation, BIT 30 (1990), 570-582.
5. Dyckhoff, H., Finke U., Cutting and Packing in Production and Distribution. Physica-Verlag, Heidelberg, 1992.
6. Ferrari, L., Sancar, P.V., Sklansky, J., Minimum rectilinear partitions of digitized blobs, Comput. Vision Graphics Image Process. 28 (1984), 58-71.
7. Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem. Oper. Res. 9 (1961), 849-859.
8. Gilmore, P.C., Gomory, R.E., A linear programming approach to the cutting stock problem, II, Oper. Res. 11 (1963), 863-887.
9. Gilmore, P.C., Gomory, R.E., Multistage cutting stock problems of two and more dimensions, Oper. Res. 13 (1965), 94-120.
10. Keil, J.M., Sack, J.-R., Minimum decomposition of polygonal objects, in: Computational Geometry (G.T. Toussaint, Ed.), pp. 197-216, North-Holland, Amsterdam, 1985.
11. Korneenko, N.M., Matveev, G.V., Metel'skiǐ, N.N., Tyškevič, R.I., Partitions of polygons (Russian), Vesci Akad. Navuk BSSR. Ser. Fiz.-Mat. Navuk, 1978, No. 2, 25-29.
12. Lee, D.T., Preparata, F.P., Computational geometry - a survey, IEEE Trans. Comput. 33 (1984), 1072-1101.
13. Lingas, A., Soltan, V., Minimum convex partition of a polygon with holes by cuts in given directions, Manuscript, 33 pp. (1996), submitted.
14. O'Rourke, J., Computational Geometry in C, Cambridge University Press, Cambridge, 1994.
15. Prisǎcaru, Ch., Soltan, P., Partition of a planar domain into d-convex parts and its application (Russian), Dokl. Akad. Nauk SSSR 262 (1982), 271-273. (English transl.: Soviet Math. Dokl. 25 (1982), 53-55.)
16. Prisǎcaru, Ch., Soltan, P., Partition of a planar domain into d-convex parts and its application (Russian), Dokl. Akad. Nauk SSSR 262 (1982), 271-273. (English transl.: Soviet Math. Dokl. 25 (1982), 53-55.)
17. Saskatered, R., Straus, E.G., Valentine, F.A., A generalization of a theorem of Tietze and local convexity, J. London Math. Soc. 36 (1961), 52-56.
18. Soltan, V., Partition of a planar set into a finite number of d-convex parts (Russian), Kibernetika (Kiev), 1984, No. 6, 70-74. (English transl.: Cybernetics 20 (1984), 855-860.)
19. Soltan, V., Partition of a planar set into a finite number of d-convex parts (Russian), Kibernetika (Kiev), 1984, No. 6, 70-74. (English transl.: Cybernetics 20 (1984), 855-860.)
20. Soltan, V., Gorpinevich, A., Minimum dissection of rectilinear polygon with arbitrary holes into rectangles, Discrete Comput. Geom. 9 (1993), 57-79.
21. Soltan, V., Gorpinevich, A., Minimum number of trapezoids partitioning a polygonal region, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 36 (1993), 47-60.
22. Terno, J., Lindemann, R., Scheithauer, G., Zuschnittprobleme und ihre praktische Lösung, Verlag Harry Deutsch, Thun und Frankfurt a. M., 1987.