The problem of partitioning a polygonal region into the minimum number of trapezoids is discussed. Using a circle graph algorithm, a fast algorithm is given for polygons. This problem arises in the electrobeam exposure system of LSI patterns.