﻿ PolygonOperations Members

# PolygonOperations Members

The PolygonOperations type exposes the following members.

## Methods

Name Description  CanSimplifyToSinglePolygon
Simplifies a polygon, by removing self intersection. This results in one polygon, but may not be successful if multiple polygons  CCWPositive
Sets a polygon to counter clock wise positive  CWNegative
Sets a polygon to clock wise negative  Difference(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
Difference. Gets the difference between two sets of polygons.  Difference(List<(Of <<'(Point>)>>), List<(Of <<'(Point>)>>))
Difference. Gets the difference between two sets of polygons.  Difference(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), List<(Of <<'(Point>)>>))
Difference. Gets the difference between two sets of polygons.  Difference(List<(Of <<'(Point>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
Difference. Gets the difference between two sets of polygons.  Intersection(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
Intersection. Gets the areas covered by both the subjects and the clips.  Intersection(List<(Of <<'(Point>)>>), List<(Of <<'(Point>)>>))
Intersection. Gets the areas covered by both the subjects and the clips.  Intersection(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), List<(Of <<'(Point>)>>))
Intersection. Gets the areas covered by both the subjects and the clips.  Intersection(List<(Of <<'(Point>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
Intersection. Gets the areas covered by both the subjects and the clips.  Length
Gets the length of a path  OffsetMiter
Offsets all paths by the given offset value. Miters the corners. Offest value may be positive or negative. Loops must be ordered CCW positive.  OffsetRound(IList<(Of <<'(Point>)>>), Double, Double)
Offets the given path by the given offset, rounding corners.  OffsetRound(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), Double, Double)
Offsets all paths by the given offset value. Rounds the corners. Offest value may be positive or negative. Loops must be ordered CCW positive.  OffsetSquare
Offsets all paths by the given offset value. Squares the corners. Offest value may be positive or negative. Loops must be ordered CCW positive.  Simplify
Simplifies a polygon, by removing self intersection. This may output several polygons.  Union(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
Union. Joins paths that are touching into merged larger paths.  Union(List<(Of <<'(Point>)>>), List<(Of <<'(Point>)>>))
Union. Joins paths that are touching into merged larger paths.  Union(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), List<(Of <<'(Point>)>>))
Union. Joins paths that are touching into merged larger paths.  UnionEvenOdd
Union based on Even/Odd methodology. Useful for correctly ordering a set of paths.  Xor(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
XOR. Opposite of Intersection. Gets the areas covered by only either subjects or clips.  Xor(List<(Of <<'(Point>)>>), List<(Of <<'(Point>)>>))
XOR. Opposite of Intersection. Gets the areas covered by only either subjects or clips.  Xor(IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>), List<(Of <<'(Point>)>>))
XOR. Opposite of Intersection. Gets the areas covered by only either subjects or clips.  Xor(List<(Of <<'(Point>)>>), IList<(Of <<'(List<(Of <<'(Point>)>>)>)>>))
XOR. Opposite of Intersection. Gets the areas covered by only either subjects or clips.