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

Andrzej Lingas and Valeriu Soltan
Proc. 7th Int. Symp. Algorithms & Computation (ISAAC 1996), Lecture Notes in Computer Science 1178, Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, and Subhash Suri, ed., Springer-Verlag, 1996, pp. 315–325
Theory of Computing Systems 31(5):507–538, 1998

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!