Minimum convex partition of a polygon with holes by cuts in given directions

Theory of Computing Systems

Volumn 31, Issue 5, 1998, Pages 507-538

  Lingas, A ^a   Soltan, V ^b  

^a LUND UNIVERSITY   (Sweden)

^b INSTITUTE OF CHEMISTRY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

CONVEX POLYGON; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

GEOMETRY;

EID: 0032393024     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000101     Document Type: Article

References (30)

1. T. Asano, M. Sato, T. Ohtsuki, Computational geometry algorithms, in Layout Design and Verification, T. Ohtsuki, ed., North-Holland, Amsterdam, 1986, pp. 295-347.
2. M. Bern, D. Epstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, 2nd edn., D.-Z. Du, F. K. Hwang, eds., World Scientific, Singapore, 1995, pp. 47-123.
3. B. Chazelle, D. P. Dobkin, Optimal convex decomposition, in Computational Geometry, G. T. Toussaint, ed., North-Holland, Amsterdam, 1985, pp. 63-133.
4. B. Chazelle, L. Palios, Decomposition algorithms in geometry, in Algebraic Geometry and Applications, C. L. Bajaj, ed., Springer-Verlag, New York, 1994, pp. 419-449.
5. M. Chrobak, T. H. Payne, A linear-time algorithm for drawing a planar graph on a grid, Inform. Process. Lett. 54 (1995), 241-246.
6. V. J. Dielissen, A. Kaldewaij, Rectangular partition is polynomial in two dimensions but NP-complete in three, Inform. Process. Lett. 38 (1991), 1-6.
7. A. Gorpinevich, V. Soltan, Algorithms for the partition of a polygonal region into trapezoids and convex strips in problems of LSI design (in Russian) Voprosy Kibernet. (Moscow) 156 (1991), 45-56.
8. D. H. Greene, The decomposition of polygons into convex parts, in Advances in Computing Research, F. P. Preparata, ed., JAI Press, London, 1983, pp. 235-259.
9. [9) F. Haray, Graph Theory, Addison-Wesley, Reading, MA, 1969.
10. H. Imai, T. Asano, Efficient algorithm for geometric graph search problems, SIAM J. Comput. 15 (1986), 478-494.
11. J. M. Keil, Decomposing a polygon into simpler components, SIAM J. Comput. 14 (1985), 799-817.
12. J. M. Keil, J.-R. Sack, Minimum decomposition of polygonal objects, in Computational Geometry, G. T. Toussaint, ed., North-Holland, Amsterdam, 1985, pp. 197-216.
13. N. M. Korneenko, G. V. Matveev, N. N. Metel'ski, R. I. Tyškevič, Partitions of polygons (in Russian) Vestī Akad. Navuk BSSR. Ser. Fīz.-Mat. Navuk no. 2 (1978), 25-29.
14. D. T. Lee, F. P. Preparata, Computational geometry - a survey, IEEE Trans. Comput. 33 (1984), 1072-1101.
15. D. Lichtenstein, Planar formulas and their uses, SIAM J. Comput. 11 (1982), 329-343.
16. A. Lingas, The power of non-rectilinear holes, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, 1982, pp. 369-383.
17. W. Lipski, Finding a Manhattan path and related problems, Networks 13 (1983), 399-409.
18. W. Lipski, An O(n log n) Manhattan path algorithms, Inform. Process. Lett. 19 (1984), 99-102.
19. H. Martini, V. Soltan, Minimum convex partition of polygonal domains by guillotine cuts, Discrete Comput. Geom. 19 (1998), 291-305.
20. H. Martini, V. Soltan, Minimum number of pieces in a convex partition of a polygonal domain, Beitrage Algebra Geom. (submitted).
21. W. Newman, R. Sproull, Principles of Interactive Computer Graphics, 2nd edn., McGraw-Hill, New York, 1979.
22. J. O'Rourke, Art Gallery and Algorithms, Oxford University Press, New York, 1987.
23. J. O'Rourke, K. Supowit, Some NP-hard polygon decomposition problems, IEEE Trans. Inform. Theory 29 (1983), 181-190.
24. T. Pavlidis, Structural Pattern Recognition, Springer-Verlag, Berlin, 1977.
25. Ch. Prisǎcaru, P. Soltan, On partition of a planar region into d-convex parts and its application (in Russian) Dokl. Akad Nauk SSSR 262 (1982), 271-273. (English transl. Soviet Math. Dokl. 25 (1982), 53-55.)
26. Ch. Prisǎcaru, P. Soltan, On partition of a planar region into d-convex parts and its application (in Russian) Dokl. Akad Nauk SSSR 262 (1982), 271-273. (English transl. Soviet Math. Dokl. 25 (1982), 53-55.)
27. V. Soltan, Partition of a planar set into a finite number of d-convex parts (in Russian) Kibernetika (Kiev) 6 (1984), 70-74. (English transl. Cybernetics 20 (1984), 855-860.)
28. V. Soltan, Partition of a planar set into a finite number of d-convex parts (in Russian) Kibernetika (Kiev) 6 (1984), 70-74. (English transl. Cybernetics 20 (1984), 855-860.)
29. V. Soltan, A. Gorpinevich, Minimum dissection of rectilinear polygon with arbitrary holes into rectangles, Discrete Comput. Geom. 9 (1993), 57-79.
30. G. T. Toussaint, Computational geometric problems in pattern recognition, in Pattern Recognition. Theory and Applications, J. Kittler, ed., Reidel, Dordrecht, 1982, pp. 73-91.