The Delaunay Mesh Generator of Fade creates quality meshes in a polygonal area. The triangles in these meshes meet the specified quality criteria like minimum interior angle or maximum edge length. The present article covers the straightforward refine() method. If you need detailed control over the mesh generation process read also Advanced Mesh Generator. Preparing […]
Polygon Clipping, Boolean Operations – Example5
Polygon Clipping (Boolean Set Operations) Fade provides polygon clipping and functions to combine polygons through the boolean operations: Union (A OR B) Intersection (A AND B) Difference (A NOT B) Symmetric Difference (A XOR B) The demo source code described below is contained in the file example5.cpp in the Fade2D download. Creating two Shapes (Zones) […]
Polygons and Zones – Example4
This is the right article if you want to triangulate a polygon. The area inside a polygon is a Zone. Zones are among the most powerful concepts in Fade. You can combine Zones through the boolean set operations union, difference, symmetric difference and intersection. This is also known as Polygon Clipping. You can create a […]
Constraint Edges – Example3
Create a Delaunay triangulation Code for Constraint Edge (‘Breakline’) insertion Let’s enforce an edge from the lower left to the upper right corner. For this purpose prepare a vector containing one or more Segment2 objects. Then call Fade_2D::createConstraint() using the constraint insertion strategy CIS_CONSTRAINED_DELAUNAY. Code for Conforming Delaunay Edges Now that you know how to […]
Access Triangulation Elements – Example2
Development is so much easier when you can visualize geometric situations. Lern how to draw geometric primitives using Fade’s Postscript writer class Visualizer2. The present Example2 will go over a triangulation and access specific elements like triangles, their neighbors, opposite points or Voronoi cells and draw them. You can find the source code in examples_2D/example2.cpp. […]
2D Delaunay Triangulation Performance – Example1
Fade is a high performance multithreaded Delaunay triangulation library, see the benchmark diagram below. Use the present benchmark code example1.cpp (contained in the download) to test the performance on your own hardware. The example source code starts with a call to Fade_2D::setNumCPU(int numCPU): numCPU=0 means autodetect and use all available CPU cores numCPU=1 means single-threaded […]
Getting Started – Example0
Getting Started with the Fade Delaunay Triangulation The Delaunay triangulation library supports 2D and 2.5D, hence it comes as two separate libraries, Fade2D and Fade2.5D. They have a common code base and thus they are very similar to use. The difference is a z-coordinate and additional functionality in the 2.5D version. To facilitate your start […]