Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions

Andrzej Lingas, V. Soltan. Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. In Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, editors, Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings. Volume 1178 of Lecture Notes in Computer Science, pages 315-325, Springer, 1996.

Abstract

Abstract is missing.