| 摘要 |
PURPOSE:To improve entire processing speed by decreasing the number of times for sorting without detecting the intersection of paths. CONSTITUTION:When drawing an arbitrary graphic applied by contour information while painting the inside out with scan lines, the line list of a path crossing the scan line for the first time is prepared when the path crosses the scan line, a sort line list is prepared by sorting this line list in an ascending order concerning the position of the intersection with the scan line, and paths to be drawing blocks are calculated corresponding to a designated paint-out rule based on this sort line list. Then, a fill list to manage those paths as pairs is prepared and while this sort line list is not updated, the drawing blocks are successively calculated based on this fill list. When no path crosses the scan line or it is judged the paths cross each other, the sort line list and the fill list are updated and these steps are further repeated. |
