| 摘要 |
PURPOSE:To divide into the minimum number of projecting polygons with a short calculating time by extracting the only recessed summits from polygon information and performing the division with the aid of a line segment taking the recessed summit as a starting point. CONSTITUTION:A polygon division means 4 calculates the intersection between an inverse vector generated by a vector sum calculation means 3 and the polygon to output the recessed summit equipped with the intersection and the polygon and the line segment linking these as a new summit and side information respectively to a polygon information storage means 1, and the polygon information storage means 1 outputs new polygon information. Based on thus extracted recessed summit and the updated polygon information, the polygon is successively divided into plural projecting polygons by the inverse vector of the vector sum expressing the sides putting the recessed summit between them on respective recessed summits. Thus, the division of the polygon can be performed at high speed. |
