给出了矩形的三角形划分问题的定义,该问题是三角形Packing问题的一个特例,证明了该问题是NP完全的,并给出了该问题有解的一个必要条件。
The problem called rectangle triangulation problem which is a special case of triangle packing problem is proposed and proved to be NP complete,a necessary condition that ensures the problem have a solution is given.