Navigation
API > API/Plugins > API/Plugins/GeometryAlgorithms > API/Plugins/GeometryAlgorithms/FArrangement2d > API/Plugins/GeometryAlgorithms/FArrangement2d/AttemptTriangulate
References
| Module | GeometryAlgorithms |
| Header | /Engine/Plugins/Runtime/GeometryProcessing/Source/GeometryAlgorithms/Public/Arrangement2d.h |
| Include | #include "Arrangement2d.h" |
| Source | /Engine/Plugins/Runtime/GeometryProcessing/Source/GeometryAlgorithms/Private/Arrangement2d.cpp |
bool AttemptTriangulate
(
TArray < FIndex3i > & Triangles,
TArray < int32 > & SkippedEdges,
int32 BoundaryEdgeGroupID
)
Remarks
Attempts to triangulates the arrangement with a constrained Delaunay triangulation NOTE: Will return all triangles if no edges found with the BoundaryEdgeGroupID NOTE: May fail if arrangement has self-intersections
Triangles: Output triangles (as indices into Graph vertices) SkippedEdges: Output indices of edges that the algorithm failed to insert BoundaryEdgeGroupID: ID of edges corresponding to a boundary; if we have a closed loop of these boundary edges on output triangulation, will discard triangles outside this return: false if triangulation algo knows it failed (note Triangles may still have some triangulation of the input in this case; for example it may just be missing some required edges)