GridNavmesh.h

#pragma once
 
#include <Foundation/Containers/Deque.h>
#include <Foundation/Math/Rect.h>
#include <Utilities/DataStructures/GameGrid.h>
 
class PL_UTILITIES_DLL plGridNavmesh
{
public:
  struct ConvexArea
  {
    PL_DECLARE_POD_TYPE();
 
    plRectU32 m_Rect;
 
    plUInt32 m_uiFirstEdge;
 
    plUInt32 m_uiNumEdges;
  };
 
  struct AreaEdge
  {
    PL_DECLARE_POD_TYPE();
 
    plRectU16 m_EdgeRect;
 
    plInt32 m_iNeighborArea;
  };
 
  using CellComparator = bool (*)(plUInt32, plUInt32, void*);
 
  using CellBlocked = bool (*)(plUInt32, void*);
 
  template <class CellData>
  void CreateFromGrid(
    const plGameGrid<CellData>& grid, CellComparator isSameCellType, void* pPassThroughSame, CellBlocked isCellBlocked, void* pPassThroughBlocked);
 
  plInt32 GetAreaAt(const plVec2I32& vCoord) const { return m_NodesGrid.GetCell(vCoord); }
 
  plUInt32 GetNumConvexAreas() const { return m_ConvexAreas.GetCount(); }
 
  const ConvexArea& GetConvexArea(plInt32 iArea) const { return m_ConvexAreas[iArea]; }
 
  plUInt32 GetNumAreaEdges() const { return m_GraphEdges.GetCount(); }
 
  const AreaEdge& GetAreaEdge(plInt32 iAreaEdge) const { return m_GraphEdges[iAreaEdge]; }
 
private:
  void UpdateRegion(plRectU32 region, CellComparator IsSameCellType, void* pPassThrough1, CellBlocked IsCellBlocked, void* pPassThrough2);
 
  void Optimize(plRectU32 region, CellComparator IsSameCellType, void* pPassThrough);
  bool OptimizeBoxes(plRectU32 region, CellComparator IsSameCellType, void* pPassThrough, plUInt32 uiIntervalX, plUInt32 uiIntervalY,
    plUInt32 uiWidth, plUInt32 uiHeight, plUInt32 uiOffsetX = 0, plUInt32 uiOffsetY = 0);
  bool CanCreateArea(plRectU32 region, CellComparator IsSameCellType, void* pPassThrough) const;
 
  bool CanMergeRight(plInt32 x, plInt32 y, CellComparator IsSameCellType, void* pPassThrough, plRectU32& out_Result) const;
  bool CanMergeDown(plInt32 x, plInt32 y, CellComparator IsSameCellType, void* pPassThrough, plRectU32& out_Result) const;
  bool MergeBestFit(plRectU32 region, CellComparator IsSameCellType, void* pPassThrough);
 
  void CreateGraphEdges();
  void CreateGraphEdges(ConvexArea& Area);
 
  plRectU32 GetCellBBox(plInt32 x, plInt32 y) const;
  void Merge(const plRectU32& rect);
  void CreateNodes(plRectU32 region, CellBlocked IsCellBlocked, void* pPassThrough);
 
  plGameGrid<plInt32> m_NodesGrid;
  plDynamicArray<ConvexArea> m_ConvexAreas;
  plDeque<AreaEdge> m_GraphEdges;
};
 
#include <Utilities/PathFinding/Implementation/GridNavmesh_inl.h>