https://bugzilla.novell.com/show_bug.cgi?id=158573 ------- Comment #32 from wl@gnu.org 2006-10-13 16:49 MST ------- For an explanation of the nonzero winding rule, see for example http://www.asppdf.com/manual_04.html (or look up something similar in the PS Reference Manual). The above mentioned algorithm can be enormously simplified because font contours are much more well-behaved than arbitrary Bézier curves; most notably, they don't contain self-intersections or cusps. Under these assumptions it is sufficient to determine the orientation of the `envelope' determined by the Bézier control points, this is, to find the orientation of the polygon spanned up by the on and off line points. For simplicity, only consider horizontal rays -- the above algorithm then gets reduced to comparing x and y values (probably adding a vertical offset to avoid rays which pass through one of the points). A remark: Cusps and self-intersections (`loops') can only happen for third-order curves. It is also possible to construct third-order Bézier curves which looks quite normal, but where the connection lines between the control points do cross. I suggest that we ignore such cases also. -- Configure bugmail: https://bugzilla.novell.com/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are on the CC list for the bug, or are watching someone who is.