# Enum PdfFillMode

- Namespace
- BitMiracle.Docotic.Pdf

- Assembly
- BitMiracle.Docotic.Pdf.dll

Specifies how the interior of a closed path is filled.

`public enum PdfFillMode`

## Fields

`Alternate = 0`

The alternate fill mode (the even-odd rule) should be used.

`Winding = 1`

The winding fill mode (the nonzero winding number rule) should be used.

## Remarks

For a simple path, it is intuitively clear what region lies inside. However, for a more complex path - for example, a path that intersects itself or has one subpath that encloses another - it is not always obvious which points lie inside the path. The path machinery uses one of two rules for determining which points lie inside a path: the nonzero winding number rule and the even-odd rule.

## Even-Odd Rule

The even-odd rule determines whether a point is inside a path by drawing a ray from that point in any direction and simply counting the number of path segments that cross the ray, regardless of direction. If this number is odd, the point is inside; if even, the point is outside. This yields the same results as the nonzero winding number rule for paths with simple shapes, but produces different results for more complex shapes.

The image below shows the effects of applying the even-odd rule to complex paths. For the five-pointed star, the rule considers the triangular points to be inside the path, but not the pentagon in the center. For the two concentric circles, only the doughnut shape between the two circles is considered inside, regardless of the directions in which the circles are drawn.

## Nonzero Winding Number Rule

The nonzero winding number rule determines whether a given point is inside a path by conceptually drawing a ray from that point to infinity in any direction and then examining the places where a segment of the path crosses the ray. Starting with a count of 0, the rule adds 1 each time a path segment crosses the ray from left to right and subtracts 1 each time a segment crosses from right to left. After counting all the crossings, if the result is 0, the point is outside the path; otherwise, it is inside.

Note: The method just described does not specify what to do if a path segment coincides with or is tangent to the chosen ray. Since the direction of the ray is arbitrary, the rule simply chooses a ray that does not encounter such problem intersections.

For simple convex paths, the nonzero winding number rule defines the inside and outside as one would intuitively expect. The more interesting cases are those involving complex or self-intersecting paths like the ones shown below:

For a path consisting of a five-pointed star, drawn with five connected straight line segments intersecting each other, the rule considers the inside to be the entire area enclosed by the star, including the pentagon in the center.

For a path composed of two concentric circles, the areas enclosed by both circles are considered to be inside,
*provided that both are drawn in the same direction*.

If the circles are drawn in opposite directions, only the doughnut shape between them is inside, according to the rule; the doughnut hole is outside.