Navigation
API > API/Plugins > API/Plugins/GeometryAlgorithms > API/Plugins/GeometryAlgorithms/FArrangement2d
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 TriangulateWithBoundary
&40;
TArray< FIndex3i > & Triangles,
int32 BoundaryEdgeGroupID
&41;
Remarks
Attempts to triangulate the arrangement with a constrained Delaunay triangulation NOTE: May fail if arrangement has self-intersections false if triangulation algo knows it failed; will still likely have some triangulation even in this case
Parameters
| Name | Description |
|---|---|
| Triangles | Output triangles (as indices into Graph vertices) |
| BoundaryEdgeGroupID | ID of edges corresponding to a boundary: triangles outside these edges will be removed |