|
| Name | Description |
|---|
  | ClosestPointOnPolyline(array<Byte>[]()[][], Int32, Int32, PointD) | |
| ClosestPointOnPolyline(array<PointD>[]()[][], Int32, Int32, PointD) | |
| ClosestPointOnPolyline(array<Byte>[]()[][], Int32, Int32, PointD, PolylineDistanceInfo%) | |
| ClosestPointOnPolyline(array<PointD>[]()[][], Int32, Int32, PointD, PolylineDistanceInfo%) | |
| ClosestPointOnPolyline(array<Byte>[]()[][], Int32, Int32, PointD, PointD%, Double%, Int32%, Double%) | |
| ClosestPointOnPolyline(array<PointD>[]()[][], Int32, Int32, PointD, PointD%, Double%, Int32%, Double%) | |
| Cross |
Computes the cross product AB x AC
|
| Distance |
returns the Euclidean distance between two points
|
| DistanceToPolygon(array<PointD>[]()[][], PointD, Boolean) | |
| DistanceToPolygon(array<Byte>[]()[][], Int32, Int32, PointD) | |
| DistanceToPolygon(array<Byte>[]()[][], Int32, Int32, PointD, Boolean) | |
| Dot |
Computes the dot product AB*BC
|
| Equals | (Inherited from Object.) |
 | Finalize | (Inherited from Object.) |
| GetHashCode | (Inherited from Object.) |
| GetType | (Inherited from Object.) |
| IsPolygonHole(IList<(Of <<'(PointD>)>>), Int32) |
determines if a polygon is a "hole"
|
| IsPolygonHole(array<Byte>[]()[][], Int32, Int32) | |
| LineLineIntersection |
returns whether two (infinite) lines intersect and calculates intersection point if the lines intersect
|
| LineSegPointDist(PointD%, PointD%, PointD%) |
Compute the distance from segment AB to C
|
| LineSegPointDist(PointD%, PointD%, PointD%, PolylineDistanceInfo%) | |
| LineSegPointDist(PointD%, PointD%, PointD%, Double%, PointD%) | |
| MemberwiseClone | (Inherited from Object.) |
| PerpindicularVectorCCW |
return counter-clockwise vector perpindicular to v
|
| PerpindicularVectorCW |
return clockwise vector perpindicular to v
|
| PointInPolygon(array<PointD>[]()[][], Double, Double) | |
| PointInPolygon(array<Byte>[]()[][], Int32, Int32, Double, Double) | |
| PointInPolygon(array<PointD>[]()[][], Double, Double, Boolean, Boolean%) |
Tests whether point is inside a polygon
|
| PointInPolygon(array<Byte>[]()[][], Int32, Int32, Double, Double, Boolean, Boolean%) | |
| PointOnPolyline(array<Byte>[]()[][], Int32, Int32, PointD, Double) | |
| PointOnPolyline(array<PointD>[]()[][], Int32, Int32, PointD, Double) | |
| PolygonCircleIntersects(array<Byte>[]()[][], Int32, Int32, PointD, Double) | |
| PolygonCircleIntersects(array<Byte>[]()[][], Int32, Int32, PointD, Double, Boolean, Boolean%) | |
| PolygonClip(array<Point>[]()[][], Int32, GeometryAlgorithms..::..ClipBounds, List<(Of <<'(Point>)>>)) | |
| PolygonClip(array<PointD>[]()[][], Int32, GeometryAlgorithms..::..ClipBounds, List<(Of <<'(PointD>)>>)) | |
| PolygonPolygonIntersect | |
| PolygonTouchesPolygon |
returns true if polygon1 "touches" polygon 2
|
| PolylineCircleIntersects | |
| PolyLineClip(array<Point>[]()[][], Int32, GeometryAlgorithms..::..ClipBounds, List<(Of <<'(Int32>)>>), List<(Of <<'(Int32>)>>)) | |
| PolyLineClip(array<PointD>[]()[][], Int32, GeometryAlgorithms..::..ClipBounds, List<(Of <<'(Double>)>>), List<(Of <<'(Int32>)>>)) | |
| PolyLineClip(array<Point>[]()[][], Int32, GeometryAlgorithms..::..ClipBounds, List<(Of <<'(Int32>)>>), List<(Of <<'(Int32>)>>), array<Double>[]()[][], List<(Of <<'(Double>)>>)) | |
| PolyLinePolygonIntersect | |
| RectangleCircleIntersects(RectangleF%, PointD%, Double) |
Rectangle Circle intersection test
|
| RectangleCircleIntersects(RectangleD%, PointD%, Double) |
Rectangle Circle intersection test
|
| SimplifyDouglasPeucker(array<PointD>[]()[][], List<(Of <<'(Int32>)>>), Int32, Double) |
Uses the Douglas Peucker algorithm to reduce the number of points.
|
| SimplifyDouglasPeucker(array<Point>[]()[][], Int32, Int32, array<Point>[]()[][], Int32%) |
Douglas Peucker line simplification
|
| SimplifyDouglasPeucker(array<PointD>[]()[][], Int32, Double, array<PointD>[]()[][], Int32%) |
Douglas Peucker line simplification
|
| ToString | (Inherited from Object.) |
Methods
