Alternate Pattern Fill
An algorithm for alternate pattern fill on arbitrary line segments, circular arcs and elliptical arcs is proposed in this paper. The algorithm creates an external loop which is a minimal loop that contains a given point. And then, all loops that delimit the nested regions for the alternate pattern fill inside the external loop are built. The loop detection is based on a new method for searching the leftmost edges. It requires only values of positions, tangent vectors, curvature radii, and the first derivatives of curvature radii at intersection points and areas of circles and ellipses. After all necessary loops are built, the given pattern is filled in the nested loops inside the external loop. Filling the given pattern in this paper is simplified into filling line segment patterns on some parallel lines.
Unable to display preview. Download preview PDF.
- 1.Angel, E.: Computer Graphics. Addison-Wesley Publishing Company, New York (1990)Google Scholar
- 2.Praun, E., Hoppe, H., Webb, M., Finkelstein, A.: Real-Time Htching. In: Proceedings of SIGGRAPH, pp. 581–586 (2001)Google Scholar
- 4.Satoh, S., Hiroshi, M., Sakauchi, M.: An Efficient Extraction Method for Closed Loops Using a Graph Search Technique. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 78, 583–586 (1995)Google Scholar