Class Voxelize

ushort[] BoxBlur (

ushort[]	src
ushort[]	dst

)

void BuildCompactField ()

void BuildContours (

float	maxError
int	maxEdgeLength
VoxelContourSet	cset
int	buildFlags

)

void BuildDistanceField ()

void BuildPolyMesh (

VoxelContourSet	cset	contour set to build a mesh from.
int	nvp	Maximum allowed vertices per polygon.
outVoxelMesh	mesh	Results will be written to this mesh.

)

Builds a polygon mesh from a contour set.

void BuildRegions ()

void BuildVoxelConnections ()

int CalcAreaOfPolygon2D (

int[]	verts
int	nverts

)

ushort CalculateDistanceField (

ushort[]

src

)

Vector3 CompactSpanToVector (

int	x
int	z
int	i

)

void DebugDrawSpans ()

void ErodeVoxels (

int

radius

)

void ErodeWalkableArea (

int

radius

)

void FilterLedges (

uint	voxelWalkableHeight
int	voxelWalkableClimb
float	cs
float	ch

)

void FilterLowHeightSpans (

uint	voxelWalkableHeight
float	cs
float	ch

)

void FilterSmallRegions (

ushort[]	reg
int	minRegionSize
int	maxRegions

)

Filters out or merges small regions.

bool FloodRegion (

int	x
int	z
int	i
uint	level
ushort	r
ushort[]	srcReg
ushort[]	srcDist
Int3[]	stack
int[]	flags=null
bool[]	closed=null

)

int GetCornerHeight (

int	x
int	z
int	i
int	dir
ref bool	isBorderVertex

)

void Init ()

void MarkRectWithRegion (

int	minx
int	maxx
int	minz
int	maxz
ushort	region
ushort[]	srcReg

)

void RemoveDegenerateSegments (

List<int>

simplified

)

void SimplifyContour (

List<int>	verts
List<int>	simplified
float	maxError
int	maxEdgeLenght
int	buildFlags

)

void VectorToIndex (

Vector3	p
out int	x
out int	z

)

Voxelize (

float	ch
float	cs
float	walkableClimb
float	walkableHeight
float	maxSlope
float	maxEdgeLength

)

void VoxelizeInput (

Pathfinding.Util.GraphTransform	graphTransform
Bounds	graphSpaceBounds

)

Vector3 VoxelToWorld (

int	x
int	y
int	z

)

Convert from voxel coordinates to world coordinates.

(0,0,0) in voxel coordinates is a bottom corner of the bounding box. (1,0,0) is one voxel in the +X direction of that.

Int3 VoxelToWorldInt3 (

Int3

voxelPosition

)

Convert from voxel coordinates to world coordinates.

(0,0,0) in voxel coordinates is a bottom corner of the bounding box. (1,0,0) is one voxel in the +X direction of that.

void WalkContour (

int	x
int	z
int	i
ushort[]	flags
List<int>	verts

)

int Area2 (

int	a
int	b
int	c
int[]	verts

)

bool Collinear (

int	a
int	b
int	c
int[]	verts

)

bool Diagonal (

int	i
int	j
int	n
int[]	verts
int[]	indices

)

Returns T iff (v_i, v_j) is a proper internal diagonal of P.

bool Ileft (

int	a
int	b
int	c
int[]	va
int[]	vb
int[]	vc

)

bool InCone (

int	i
int	j
int	n
int[]	verts
int[]	indices

)

bool IntersectProp (

int	a
int	b
int	c
int	d
int[]	verts

)

bool Left (

int	a
int	b
int	c
int[]	verts

)

Returns true iff c is strictly to the left of the directed line through a to b.

bool LeftOn (

int	a
int	b
int	c
int[]	verts

)

bool MergeContours (

refVoxelContour	ca
refVoxelContour	cb
int	ia
int	ib

)

int Next (

int	i
int	n

)

(i+1) % n assuming 0 <= i < n

int Prev (

int	i
int	n

)

(i-1+n) % n assuming 0 <= i < n

bool Xorb (

bool	x
bool	y

)

int borderSize = 0

The size of the non-navigable border around the heightfield.

[Limit: >=0] [Units: vx]

float cellHeight = 0.1F

The y-axis cell size to use for fields.

[Limit: > 0] [Units: wu]

float cellSize = 0.2F

The xz-plane cell size to use for fields.

[Limit: > 0] [Units: wu]

VoxelContourSet countourSet

int depth

Depth in voxels.

Must match the forcedBounds

Bounds forcedBounds

The world AABB to rasterize.

List<RasterizationMesh> inputMeshes

float maxEdgeLength = 20

The maximum allowed length for contour edges along the border of the mesh.

[Limit: >= 0] [Units: vx]

float maxSlope = 30

The maximum slope that is considered walkable.

[Limits: 0 <= value < 90] [Units: Degrees]

int minRegionSize = 100

RecastGraph.RelevantGraphSurfaceMode relevantGraphSurfaceMode

Pathfinding.Util.GraphTransform transformVoxel2Graph

Transform from voxel space to graph space.

VoxelArea voxelArea

int voxelWalkableClimb

Maximum ledge height that is considered to still be traversable.

[Limit: >=0] [Units: vx]

uint voxelWalkableHeight

Minimum floor to 'ceiling' height that will still allow the floor area to be considered walkable.

[Limit: >= 3] [Units: vx]

int width

Width in voxels.

Must match the forcedBounds

const uint NotConnected = 0x3f

const int RC_CONTOUR_TESS_AREA_EDGES = 1 << 1

Tessellate edges between areas.

const int RC_CONTOUR_TESS_TILE_EDGES = 1 << 2

Tessellate edges at the border of the tile.

const int RC_CONTOUR_TESS_WALL_EDGES = 1 << 0

Tessellate wall edges.

bool Between (

int	a
int	b
int	c
int[]	verts

)

const ushort BorderReg = 0x8000

If heightfield region ID has the following bit set, the region is on border area and excluded from many calculations.

Vector3 cellScale

const int ContourRegMask = 0xffff

Mask used with contours to extract region id.

Vector3 ConvertPosition (

int	x
int	z
int	i

)

Vector3 ConvertPosWithoutOffset (

int	x
int	y
int	z

)

bool Diagonalie (

int	i
int	j
int	n
int[]	verts
int[]	indices

)

Returns T iff (v_i, v_j) is a proper internal *or* external diagonal of P, *ignoring edges incident to v_i and v_j*.

void DrawLine (

int	a
int	b
int[]	indices
int[]	verts
Color	color

)

void GetClosestIndices (

int[]	vertsa
int	nvertsa
int[]	vertsb
int	nvertsb
ref int	ia
ref int	ib

)

bool Intersect (

int	a
int	b
int	c
int	d
int[]	verts

)

const int MaxLayers = 65535

Unmotivated variable, but let's clamp the layers at 65535.

const int MaxRegions = 500

const int RC_AREA_BORDER = 0x20000

const int RC_BORDER_VERTEX = 0x10000

If contour region ID has the following bit set, the vertex will be later removed in order to match the segments and vertices at tile boundaries.

void ReleaseContours (

VoxelContourSet

cset

)

Releases contents of a contour set to caches.

Pathfinding.Util.GraphTransform transform

Transform from voxel space to world space.

int Triangulate (

int	n
int[]	verts
ref int[]	indices
ref int[]	tris

)

int union_find_find (

int[]	arr
int	x

)

Find method in the UnionFind data structure.

void union_find_union (

int[]	arr
int	a
int	b

)

Join method in the UnionFind data structure.

const int UnwalkableArea = 0

bool Vequal (

int	a
int	b
int[]	verts

)

const int VERTEX_BUCKET_COUNT = 1<<12

Vector3 voxelOffset = Vector3.zero