the consumed time of triangulation is the bottleneck
of vector graphic library. In order to reduce the time complexity
of triangulation stage, this study replaces the ear-clipping algorithm
with amonotone triangulation. However, if the monotone triangulation
algorithm is applied to a graph, the graph should be an x-monotone
polygon,