A* Pathfinding Project
4.1.19
The A* Pathfinding Project for Unity 3D
|
This is the complete list of members for Polygon, including all inherited members.
cached_Int3_int_dict | Polygon | privatestatic |
ClosestPointOnTriangle(Vector3[] triangle, Vector3 point) | Polygon | static |
ClosestPointOnTriangle(Vector2 a, Vector2 b, Vector2 c, Vector2 p) | Polygon | static |
ClosestPointOnTriangle(Vector3 a, Vector3 b, Vector3 c, Vector3 p) | Polygon | static |
ClosestPointOnTriangleXZ(Vector3 a, Vector3 b, Vector3 c, Vector3 p) | Polygon | static |
CompressMesh(List< Int3 > vertices, List< int > triangles, out Int3[] outVertices, out int[] outTriangles) | Polygon | static |
ContainsPoint(Vector3 a, Vector3 b, Vector3 c, Vector3 p) | Polygon | static |
ContainsPoint(Int3 a, Int3 b, Int3 c, Int3 p) | Polygon | static |
ContainsPoint(Int2 a, Int2 b, Int2 c, Int2 p) | Polygon | static |
ContainsPoint(Vector3[] polyPoints, Vector3 p) | Polygon | static |
ContainsPoint(Vector2[] polyPoints, Vector2 p) | Polygon | static |
ContainsPointXZ(Vector3 a, Vector3 b, Vector3 c, Vector3 p) | Polygon | static |
ContainsPointXZ(Int3 a, Int3 b, Int3 c, Int3 p) | Polygon | static |
ContainsPointXZ(Vector3[] polyPoints, Vector3 p) | Polygon | static |
ConvexHull(Vector3[] points) | Polygon | static |
ConvexHullXZ(Vector3[] points) | Polygon | static |
DistanceSegmentSegment3D(Vector3 s1, Vector3 e1, Vector3 s2, Vector3 e2) | Polygon | static |
IntersectionFactor(Int3 start1, Int3 end1, Int3 start2, Int3 end2, out float factor1, out float factor2) | Polygon | static |
IntersectionFactor(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2, out float factor1, out float factor2) | Polygon | static |
IntersectionFactor(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2) | Polygon | static |
IntersectionFactorRay(Int3 start1, Int3 end1, Int3 start2, Int3 end2) | Polygon | static |
IntersectionFactorRaySegment(Int3 start1, Int3 end1, Int3 start2, Int3 end2) | Polygon | static |
IntersectionPoint(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2) | Polygon | static |
IntersectionPoint(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2, out bool intersects) | Polygon | static |
IntersectionPoint(Vector2 start1, Vector2 end1, Vector2 start2, Vector2 end2) | Polygon | static |
IntersectionPoint(Vector2 start1, Vector2 end1, Vector2 start2, Vector2 end2, out bool intersects) | Polygon | static |
IntersectionPointOptimized(Vector3 start1, Vector3 dir1, Vector3 start2, Vector3 dir2) | Polygon | static |
IntersectionPointOptimized(Vector3 start1, Vector3 dir1, Vector3 start2, Vector3 dir2, out bool intersects) | Polygon | static |
Intersects(Int2 start1, Int2 end1, Int2 start2, Int2 end2) | Polygon | static |
Intersects(Int3 start1, Int3 end1, Int3 start2, Int3 end2) | Polygon | static |
Intersects(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2) | Polygon | static |
IntersectsUnclamped(Vector3 a, Vector3 b, Vector3 a2, Vector3 b2) | Polygon | static |
IsClockwise(Vector3 a, Vector3 b, Vector3 c) | Polygon | static |
IsClockwise(Int3 a, Int3 b, Int3 c) | Polygon | static |
IsClockwiseMargin(Vector3 a, Vector3 b, Vector3 c) | Polygon | static |
IsClockwiseMargin(Int3 a, Int3 b, Int3 c) | Polygon | static |
IsClockwiseMargin(Int2 a, Int2 b, Int2 c) | Polygon | static |
IsColinear(Int3 a, Int3 b, Int3 c) | Polygon | static |
IsColinear(Vector3 a, Vector3 b, Vector3 c) | Polygon | static |
IsColinearAlmost(Int3 a, Int3 b, Int3 c) | Polygon | static |
Left(Vector3 a, Vector3 b, Vector3 p) | Polygon | static |
Left(Vector2 a, Vector2 b, Vector2 p) | Polygon | static |
Left(Int3 a, Int3 b, Int3 p) | Polygon | static |
Left(Int2 a, Int2 b, Int2 p) | Polygon | static |
LeftNotColinear(Vector3 a, Vector3 b, Vector3 p) | Polygon | static |
LeftNotColinear(Int3 a, Int3 b, Int3 p) | Polygon | static |
LineIntersectsBounds(Bounds bounds, Vector3 a, Vector3 b) | Polygon | static |
SampleYCoordinateInTriangle(Int3 p1, Int3 p2, Int3 p3, Int3 p) | Polygon | static |
SegmentIntersectionPoint(Vector3 start1, Vector3 end1, Vector3 start2, Vector3 end2, out bool intersects) | Polygon | static |
Subdivide(List< Vector3 > points, List< Vector3 > result, int subSegments) | Polygon | static |
TraceContours(Dictionary< int, int > outline, HashSet< int > hasInEdge, System.Action< List< int >, bool > results) | Polygon | static |
TriangleArea(Int3 a, Int3 b, Int3 c) | Polygon | static |
TriangleArea(Vector3 a, Vector3 b, Vector3 c) | Polygon | static |
TriangleArea2(Int3 a, Int3 b, Int3 c) | Polygon | static |
TriangleArea2(Vector3 a, Vector3 b, Vector3 c) | Polygon | static |