Polygon Clipping: Boolean Set Operations Fade provides polygon clipping and functions to combine shapes through the following Boolean operations: You can find the C++ source code for this demo in examples_2D/ex5_booleanOps.cpp in the download package. Note: The term “polygon clipping” in this context refers to the Boolean operations, such as calculating the intersection of two…Continue readingPolygon Clipping: Boolean Operations – Example 5
Tag: Polygon Clipping
Implementing Boolean operations on Polygons with Holes can be challenging. Therefore, in the present example, examples_2D/ex6_booleanOps2.cpp, you’ll find C++ source code already prepared to handle arbitrary shapes, whether they are convex or non-convex, with or without holes. Feel free to use this code in your project. Additionally, it’s advisable to review the previous Example 5.…Continue readingPractical Boolean Operations on Polygons with Holes – Example 6
Just like the previous article, this one focuses on the C++ example of merging. In this part, we describe the function demo3_mergeShapes(), which explains how to merge two triangulations. You pass two zones to the function: one is the higher-priority triangulation, while the other has just base priority. The higher-priority triangulation remains intact, and we…Continue readingMerging Two Triangulations
When working with polygons, we are often interested in their enclosed area. However, inconsistent edge orientations and self-intersections introduce ambiguity regarding this area. Therefore, Fade2D provides a Polygon Clipper to repair corrupt polygons or restrict them to a defined region. This tool supports polygons that may contain holes, it resolves self-intersections, and it orients polygon…Continue readingPolygon Clipper – Repairing Polygons, Example 14
