## De-EmbeddingDe-embedding is the sorting of a collection of polygons into parents and children for the purposes of treating the parents as "dark" and the children as "clear." Many CAD systems use this approach to describe complicated polygonal areas with islands.
AutoCAD does not directly support such usage (except possibly for hatching) but users are known to draw parent/children and expect the resulting mask to look appropriate. ## Creating the List of PolygonsThe AutoCAD application developer can use any form of selection set(s) to collect entities and to create a list of polygons to send to bool.dll. However it is the application developer's responsibilty to perform the necessary conversion into polygons and to check the "legality" of the polygons.
**ZWCP**- (Zero Width Closed Polyline) Check that each zwcp consists soley of straight line edges (no curves) and that the polygon does not self intersect.**Polylines with Width**- must convert to an outline and test to see than no self intersection occurs. If any sections are arcs must segment them into straight sections. Whether you wish to support polylines with non-constant width depends on whether you can properly convert them to the correct outline.**Circles**- must convert to a boundary. Smoothness control might be appropriate.**Donuts**Donuts don't exist in the AutoCAD database but are a special case of two polyline arcs with width. Should have a way of recognizing a donut and outputting it as two concentric boundaries.
## Handling Touching PolygonsSince we are sorting polygons as to whether they are parents or children the situation when two polygons have touching edges becomes a bit ambiguous. The rule is: If the edges of two polygons touch, or intersect then those two polygons will be unionized prior to any sorting process.
In the illustration below, (a) two "child" polygons are touching; prior to sorting they are unionized(b) and the final results are shown (c). In the illustration below there is an intersection (a) with the "parent" polygon. The two rectangles are first booleanized (b) and then the dembedding sort is performed resulting in (c). Notice that this result is not entirely equivalent to the results one would obtain using a "scan line" function. The scan line would produce something more like the illustration below: |

## Function Syntaxint Deembed ( int** XY1_arr, int * pair_num1_arr, int N1, int*** XY_arr, int** pair_num_arr, int * N, int bdll_handle ); Prior to calling the Deembed function the caller must first populate the input data set. The illustration below shows graphically how this is done. In this example, our input data set consists of 6 polygons: The number next to each polygon indicates the order that it appears in the array of pointers.
An array of pointers is passed - this array points into the memory where the coordinate data for each polygon has been placed. An array of integers indicates the number of vertices for each polygon. The integer N1 indicates how many polygons in the array.
Due to the fact that some unionization may occur, the list of returned polygons is not necessarily identical to the list of input polygons -- therefore one must return the same sort of data structure -- i.e. an array of pointers to the XY coordinates, a list of vertex counts for each poly and an integer N, indicating how many polys are returned. The primary difference is both in the order of returned polygons and how parent/children are marked. First, the polygons are returned in the order parent,child,child,child ... parent,child,child where the children of a parent follow the parent. Of course, there may be no children for some parents. Children are marked by their vertex count - a negative value for vertex indicates that this polygon is a child. |

Documentation | Download | Price | Revision History |