Search results
Results From The WOW.Com Content Network
The original image didn't seem to be displaying, so I re-saved it as a normal SVG rather than an Inkscape SVG. Fingers crossed... 08:54, 3 April 2011: 1,618 × 1,541 (9 KB) Fuzzypeg {{Information |Description ={{en|1=Diagram showing how a curve (top) is filled according to two rules: the even-odd rule (left), and the non-zero winding rule (right).
The SVG defines the even–odd rule by saying: This rule determines the "insideness" of a point on the canvas by drawing a ray from that point to infinity in any direction and counting the number of path segments from the given shape that the ray crosses. If this number is odd, the point is inside; if even, the point is outside.
File:Antu fill-rule-even-odd.svg. Add languages. Page contents not supported in other languages. File; ... Printable version; Page information; Get shortened URL;
If the point is on the inside of the polygon then it will intersect the edge an odd number of times. The status of a point on the edge of the polygon depends on the details of the ray intersection algorithm. This algorithm is sometimes also known as the crossing number algorithm or the even–odd rule algorithm, and was known as early as 1962. [3]
Original file (SVG file, nominally 2,513 × 756 pixels, file size: 43 KB) This is a file from the Wikimedia Commons . Information from its description page there is shown below.
A curve (top) is filled according to two rules: the even-odd rule (left), and the non-zero winding rule (right). In each case an arrow shows a ray from a point P heading out of the curve. In the even-odd case, the ray is intersected by two lines, an even number; therefore P is concluded to be 'outside' the curve.
It considers regions with odd winding number to be inside the polygon; this is known as the even–odd rule. It takes two lists of polygons as input. In its original form, the algorithm is divided into three phases: In the first phase, pairwise intersections between edges of the polygons are computed.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Donate; Pages for logged out editors learn more