Class Polygon

Vector2 ClosestPointOnTriangle (

Vector2	a
Vector2	b
Vector2	c
Vector2	p

)

Closest point on the triangle abc to the point p.

float3 ClosestPointOnTriangle (

float3	a
float3	b
float3	c
float3	p

)

Closest point on the triangle abc to the point p.

float3 ClosestPointOnTriangleBarycentric (

float2	a
float2	b
float2	c
float2	p

)

Closest point on the triangle abc to the point p as barycentric coordinates.

bool ClosestPointOnTriangleByRef (

in float3	a
in float3	b
in float3	c
in float3	p
out float3	output

)

Closest point on the triangle abc to the point p.

Takes arguments by reference to be able to be burst-compiled.

void ClosestPointOnTriangleProjected (

refInt3	vi1	First vertex of the triangle, in graph space.
refInt3	vi2	Second vertex of the triangle, in graph space.
refInt3	vi3	Third vertex of the triangle, in graph space.
refBBTree.ProjectionParams	projection	Projection parameters that are for example constructed from a movement plane.
ref float3	point	Point to find the closest point to.
out float3	closest	Closest point on the triangle to the point.
out float	sqrDist	Squared cost from the point to the closest point on the triangle.
out float	distAlongProjection	Distance from the point to the closest point on the triangle along the projection axis.

)

Closest point on a triangle when one axis is scaled.

Project the triangle onto the plane defined by the projection axis. Then find the closest point on the triangle in the plane. Calculate the distance to the closest point in the plane, call that D1. Convert the closest point into 3D space, and calculate the distance to the query point along the plane's normal, call that D2. The final cost for a given point is D1 + D2 * distanceScaleAlongProjectionDirection.

This will form a diamond shape of equivalent cost points around the query point (x). The ratio of the width of this diamond to the height is equal to distanceScaleAlongProjectionDirection.

^ / \ / \ / x \ \ / \ / \ / v

Vector3 ClosestPointOnTriangleXZ (

Vector3	a
Vector3	b
Vector3	c
Vector3	p

)

Closest point on the triangle abc to the point p when seen from above.

void CompressMesh (

List<Int3>	vertices	Vertices of the input mesh
List<int>	triangles	Triangles of the input mesh
List<uint>	tags	Tags of the input mesh. One for each triangle.
outInt3[]	outVertices	Vertices of the output mesh.
out int[]	outTriangles	Triangles of the output mesh.
out uint[]	outTags	Tags of the output mesh. One for each triangle.

)

Compress the mesh by removing duplicate vertices.

Vertices that differ by only 1 along the y coordinate will also be merged together.

bool ContainsPoint (

Int2	a
Int2	b
Int2	c
Int2	p

)

Returns if the triangle ABC contains the point p.

The triangle vertices are assumed to be laid out in clockwise order.

bool ContainsPoint (

Vector2[]	polyPoints
Vector2	p

)

Checks if p is inside the polygon.

bool ContainsPoint (

ref int3	aWorld
ref int3	bWorld
ref int3	cWorld
ref int3	pWorld
refNativeMovementPlane	movementPlane

)

Returns if the triangle contains the point p when projected on the movement plane.

The triangle vertices may be clockwise or counter-clockwise.

This method is numerically robust, as in, if the point is contained in exactly one of two adjacent triangles, then this function will return true for at least one of them (both if the point is exactly on the edge between them). If it was less numerically robust, it could conceivably return false for both of them if the point was on the edge between them, which would be bad.

bool ContainsPoint (

ref int3	aWorld
ref int3	bWorld
ref int3	cWorld
ref int3	pWorld
in float2x3	planeProjection

)

Returns if the triangle contains the point p when projected on a plane using the given projection.

The triangle vertices may be clockwise or counter-clockwise.

This method is numerically robust, as in, if the point is contained in exactly one of two adjacent triangles, then this function will return true for at least one of them (both if the point is exactly on the edge between them). If it was less numerically robust, it could conceivably return false for both of them if the point was on the edge between them, which would be bad.

bool ContainsPointXZ (

Vector3	a
Vector3	b
Vector3	c
Vector3	p

)

Returns if the triangle ABC contains the point p in XZ space.

The triangle vertices are assumed to be laid out in clockwise order.

bool ContainsPointXZ (

Int3	a
Int3	b
Int3	c
Int3	p

)

Returns if the triangle ABC contains the point p.

The triangle vertices are assumed to be laid out in clockwise order.

bool ContainsPointXZ (

Vector3[]	polyPoints
Vector3	p

)

Checks if p is inside the polygon (XZ space).

Vector3[] ConvexHullXZ (

Vector3[]

points

)

Calculates convex hull in XZ space for the points.

Implemented using the very simple Gift Wrapping Algorithm which has a complexity of O(nh) where n is the number of points and h is the number of points on the hull, so it is in the worst case quadratic.

int SampleYCoordinateInTriangle (

Int3	p1
Int3	p2
Int3	p3
Int3	p

)

Sample Y coordinate of the triangle (p1, p2, p3) at the point p in XZ space.

The y coordinate of p is ignored.

void Subdivide (

List<Vector3>	points
List<Vector3>	result
int	subSegments

)

Divides each segment in the list into subSegments segments and fills the result list with the new points.

void TraceContours (

Dictionary<int, int>	outline	outline[a] = b if there is an edge from a to b.
HashSet<int>	hasInEdge	hasInEdge should contain b if outline[a] = b for any key a.
System.Action<List<int >, bool>	results	Will be called once for each contour with the contour as a parameter as well as a boolean indicating if the contour is a cycle or a chain (see image).

)

Given a set of edges between vertices, follows those edges and returns them as chains and cycles.

Dictionary<Int3, int> cached_Int3_int_dict = new Dictionary<Int3, int>()

Cached dictionary to avoid excessive allocations.