|
Faceted Geometry Kernel (FGK)
provides following algorithms for creating quality mesh:
One Dimensional Meshing
 |
Lagrange interpolation |
|
|
Spline interpolation |
|
|
Arc Length
|
Two Dimensional Meshing
Generation
|
|
Polygon discretisation |
|
|
Trapezoidal decomposition |
|
|
Transfinite Interpolation |
Generic Delaunay Triangulation
Algorithms
|
|
The Bowyer-Watson algorithm |
|
|
Various point insertion
strategies |
|
|
Constrained triangulation
|
|
Maintaining a
constrained entity |
|
|
Constraints in two
dimensions |
|
|
Constraints in three
dimensions |
|
Generic Advancing front
technique (AFT)
Surface Meshing
|
|
Parametric Surface Meshing |
|
|
Advancing Front Surface
Meshing |
Delaunay Volume Meshing
Remeshing
|
|
Min/Max method Swap
|
|
|
Topology Improvement |
|
|
Feature Preservation |
|
|
Laplace Smoothner |
Mesh Repair
|
|
Min/Max |
|
|
Defeaturing
|
|
|
Fix Topology
|
|
Mesh statistics
|
|
|
Detect/Remove short edges |
|
|
Detect/Remove Skinny triangles
|
|
|
Flip orientation |
|
|
|
Manual Fixes
|
|
Delete/Add/Split face |
|
|
Delete/Flip/Split edge |
|
|
Remove Degeneracy |
|
|
Short edges |
|
|
|
Hole Repair
|
|
Detect |
|
|
Smoothly interpolate hole
|
|
|
Construct regular tessellation
|
|
|
