Class NavmeshCutJobs

unsafe delegate void CalculateContourDelegate (

JobCalculateContour*

job

)

unsafe void BoxConvexHullXZ (

float4x4	matrix
UnsafeList<float2> *	points
out int	numPoints
out float	minY
out float	maxY

)

unsafe void CalculateContour (

JobCalculateContour*

job

)

unsafe void CapsuleConvexHullXZ (

float4x4	matrix
UnsafeList<float2> *	points
float	height
float	radius
float	radiusMargin
int	circleResolution
out int	numPoints
out float	minY
out float	maxY

)

unsafe int ConvexHull (

float2 *	points
int	nPoints
float	vertexMergeDistance

)

Calculates the convex hull of a point set using the graham scan algorithm.

The `points` array will be modified to contain the convex hull. The number of vertices on the hull is returned by this function.

Vertices on the hull closer than `vertexMergeDistance` will be merged together.

From KTH ACM Contest Template Library (2015 version)

float ApproximateCircleWithPolylineRadius (

float	radius
int	resolution

)

Adjust the radius so that the contour better approximates a circle.

Instead of all points laying exactly on the circle, which means all of the contour is inside the circle, we change it so that half of the contour is inside and half is outside.

Returns the new radius

float4[] BoxCorners = new float4[] { new float4(-0.5f, -0.5f, -0.5f, 1.0f), new float4(+0.5f, -0.5f, -0.5f, 1.0f), new float4(-0.5f, +0.5f, -0.5f, 1.0f), new float4(+0.5f, +0.5f, -0.5f, 1.0f), new float4(-0.5f, -0.5f, +0.5f, 1.0f), new float4(+0.5f, -0.5f, +0.5f, 1.0f), new float4(-0.5f, +0.5f, +0.5f, 1.0f), new float4(+0.5f, +0.5f, +0.5f, 1.0f), }