Defines the SVG fill rule type, which indicates the algorithm which is to be used to determine what parts of the canvas are included inside the shape. For a simple, nonintersecting path, it is intuitively clear what region lies "inside"; however, for a more complex path, such as a path that intersects itself or where one subpath encloses another, the interpretation of "inside" is not so obvious.
Namespace: FMX.RS.SVGTypes
Delphi

type
TSVGFillRule = (frNone,
frNonZero,
frEvenOdd);


Name

Description


frEvenOdd

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.


frNone

Represents constant frNone.


frNonZero

This rule determines the "insideness" of a point on the canvas by drawing a ray from that point to infinity in any direction and then examining the places where a segment of the shape crosses the ray. Starting with a count of zero, add one each time a path segment crosses the ray from left to right and subtract one each time a path segment crosses the ray from right to left. After counting the crossings, if the result is zero then the point is outsidethe path. Otherwise, it is inside

Top
