The new algorithm provides robust quality triangulations of non-convex polygons. It also produces a best attempt for polygons that are badly warped or self intersecting by minimising the area in which the local normal is in the opposite direction to the overal polygon normal. It is memory efficient when applied to multiple polygons as it maintains and reuses its workspace. This algorithm replaces implementations in the face and faceTriangulation classes, which have been removed. Faces can no longer be decomposed into mixtures of tris and quadrilaterals. Polygonal faces with more than 4 sides are now decomposed into triangles in foamToVTK and in paraFoam.
6 lines
83 B
Plaintext
6 lines
83 B
Plaintext
EXE_INC = \
|
|
-I$(LIB_SRC)/fileFormats/lnInclude
|
|
|
|
EXE_LIBS = \
|
|
-lfileFormats
|