public void LoadTileData()
{
s_Geometry = new Geometry.Geometry();
// First read target tile to verify we have geometry and get bounding box
// Read tile
s_Tile.Read();
// Generate relevant geometry
s_Tile.Generate();
// Append to our geometry
s_Geometry.AddADT(s_Tile, false);
// Generate the bounding box for the tile
// (Because we need to cut the surrounding tiles later)
Bounds = Geometry.Geometry.GetBoundingBox(X, Y, s_Geometry.Vertices);
// We need to load the surrounding tiles because there sometimes is overlap in geometry to and from different tiles
for (var y = Y - 1; y <= Y + 1; y++)
{
for (var x = X - 1; y <= X + 1; y++)
{
// Skip target tile as we already added it
if (X == x && Y == y)
{
continue;
}
// Add a surrounding tile
var tile = new ADT(World, x, y);
tile.Read();
tile.Generate();
s_Geometry.AddADT(tile, false);
}
}
}
public void Build()
{
var geo = new Geometry.Geometry();
Source.Read();
geo.AddADT(Source);
}
public byte[] Build()
{
Geometry = new Geometry.Geometry {Transform = true };
{
var main = new ADT(World, X, Y);
main.Read();
// main.Generate();
Geometry.AddADT(main);
}
if (Geometry.Vertices.Count == 0 && Geometry.Indices.Count == 0)
throw new InvalidOperationException("Can't build tile with empty geometry");
float[] bbMin, bbMax;
CalculateTileBounds(out bbMin, out bbMax);
Geometry.CalculateMinMaxHeight(out bbMin[1], out bbMax[1]);
// again, we load everything - wasteful but who cares
/* for (int ty = Y - 1; ty <= Y + 1; ty++)
{
for (int tx = X - 1; tx <= X + 1; tx++)
{
try
{
// don't load main tile again
if (tx == X && ty == Y)
continue;
var adt = new ADT(World, tx, ty);
adt.Read();
Geometry.AddADT(adt);
}
catch (FileNotFoundException)
{
// don't care - no file means no geometry
}
}
}*/
Context = new RecastContext();
// Context.SetContextHandler(Log);
// get raw geometry - lots of slowness here
float[] vertices;
int[] triangles;
byte[] areas;
Geometry.GetRawData(out vertices, out triangles, out areas);
Geometry.SaveWavefrontObject($"{World}_{X}_{Y}.obj");
Geometry.Indices.Clear();
Geometry.Vertices.Clear();
// add border
bbMin[0] -= Config.BorderSize * Config.CellSize;
bbMin[2] -= Config.BorderSize * Config.CellSize;
bbMax[0] += Config.BorderSize * Config.CellSize;
bbMax[2] += Config.BorderSize * Config.CellSize;
Heightfield hf;
int width = Config.TileWidth + (Config.BorderSize * 2);
if (!Context.CreateHeightfield(out hf, width, width, bbMin, bbMax, Config.CellSize, Config.CellHeight))
throw new OutOfMemoryException("CreateHeightfield ran out of memory");
Context.MarkWalkableTriangles(Config.WalkableSlopeAngle, ref vertices, ref triangles,out areas);
// Context.ClearUnwalkableTriangles(Config.WalkableSlopeAngle, ref vertices, ref triangles, areas);
Context.RasterizeTriangles(ref vertices, ref triangles, ref areas, hf, Config.WalkableClimb);
// Once all geometry is rasterized, we do initial pass of filtering to
// remove unwanted overhangs caused by the conservative rasterization
// as well as filter spans where the character cannot possibly stand.
Context.FilterLowHangingWalkableObstacles(Config.WalkableClimb, hf);
Context.FilterLedgeSpans(Config.WalkableHeight, Config.WalkableClimb, hf);
Context.FilterWalkableLowHeightSpans(Config.WalkableHeight, hf);
// Compact the heightfield so that it is faster to handle from now on.
// This will result in more cache coherent data as well as the neighbours
// between walkable cells will be calculated.
CompactHeightfield chf;
if (!Context.BuildCompactHeightfield(Config.WalkableHeight, Config.WalkableClimb, hf, out chf))
throw new OutOfMemoryException("BuildCompactHeightfield ran out of memory");
hf.Delete();
// Erode the walkable area by agent radius.
if (!Context.ErodeWalkableArea(Config.WalkableRadius, chf))
throw new OutOfMemoryException("ErodeWalkableArea ran out of memory");
// Prepare for region partitioning, by calculating distance field along the walkable surface.
if (!Context.BuildDistanceField(chf))
throw new OutOfMemoryException("BuildDistanceField ran out of memory");
// Partition the walkable surface into simple regions without holes.
if (!Context.BuildRegions(chf, Config.BorderSize, Config.MinRegionArea, Config.MergeRegionArea))
throw new OutOfMemoryException("BuildRegionsMonotone ran out of memory");
// Create contours.
ContourSet cset;
if (!Context.BuildContours(chf, Config.MaxSimplificationError, Config.MaxEdgeLength, out cset))
throw new OutOfMemoryException("BuildContours ran out of memory");
// Build polygon navmesh from the contours.
PolyMesh pmesh;
if (!Context.BuildPolyMesh(cset, Config.MaxVertsPerPoly, out pmesh))
throw new OutOfMemoryException("BuildPolyMesh ran out of memory");
// Build detail mesh.
PolyMeshDetail dmesh;
if (
!Context.BuildPolyMeshDetail(pmesh, chf, Config.DetailSampleDistance, Config.DetailSampleMaxError,
out dmesh))
throw new OutOfMemoryException("BuildPolyMeshDetail ran out of memory");
chf.Delete();
cset.Delete();
// Remove padding from the polymesh data. (Remove this odditity)
pmesh.RemovePadding(Config.BorderSize);
// Set flags according to area types (e.g. Swim for Water)
pmesh.MarkAll();
// get original bounds
float[] tilebMin, tilebMax;
CalculateTileBounds(out tilebMin, out tilebMax);
tilebMin[1] = bbMin[1];
tilebMax[1] = bbMax[1];
// build off mesh connections for flightmasters
// bMax and bMin are switched here because of the coordinate system transformation
var connections = new List<OffMeshConnection>();
byte[] tileData;
if (!Detour.CreateNavMeshData(out tileData, pmesh, dmesh,
X, Y, tilebMin, tilebMax,
Config.WorldWalkableHeight, Config.WorldWalkableRadius,
Config.WorldWalkableClimb, Config.CellSize,
Config.CellHeight, Config.TileWidth,
connections.ToArray()))
{
pmesh.Delete();
dmesh.Delete();
return null;
}
pmesh.Delete();
dmesh.Delete();
GC.Collect();
return tileData;
}