add method
Add a set of edges and nodes, which form a graph. The graph is assumed to contain one or more polygons, possibly with holes.
Implementation
void add(List dirEdges, List nodes) {
PlanarGraph.linkResultDirectedEdgesStatic(nodes);
List maxEdgeRings = buildMaximalEdgeRings(dirEdges);
List freeHoleList = [];
List edgeRings =
buildMinimalEdgeRings(maxEdgeRings, shellList, freeHoleList);
sortShellsAndHoles(edgeRings, shellList, freeHoleList);
placeFreeHoles(shellList, freeHoleList);
//Assert: every hole on freeHoleList has a shell assigned to it
}