/** * Update the triangulation by removing the cavity triangles and then filling the cavity with * new triangles. * * @param site the site that created the cavity * @param cavity the triangles with site in their circumcircle * @return one of the new triangles */ private Triangle update(Pnt site, Set<Triangle> cavity) { Set<Set<Pnt>> boundary = new HashSet<Set<Pnt>>(); Set<Triangle> theTriangles = new HashSet<Triangle>(); // Find boundary facets and adjacent triangles for (Triangle triangle : cavity) { theTriangles.addAll(neighbors(triangle)); for (Pnt vertex : triangle) { Set<Pnt> facet = triangle.facetOpposite(vertex); if (boundary.contains(facet)) boundary.remove(facet); else boundary.add(facet); } } theTriangles.removeAll(cavity); // Adj triangles only // Remove the cavity triangles from the triangulation for (Triangle triangle : cavity) triGraph.remove(triangle); // Build each new triangle and add it to the // triangulation Set<Triangle> newTriangles = new HashSet<Triangle>(); for (Set<Pnt> vertices : boundary) { vertices.add(site); Triangle tri = new Triangle(vertices); triGraph.add(tri); newTriangles.add(tri); } // Update the graph links for each new triangle theTriangles.addAll(newTriangles); // Adj triangle + new // triangles for (Triangle triangle : newTriangles) for (Triangle other : theTriangles) if (triangle.isNeighbor(other)) triGraph.add(triangle, other); // Return one of the new triangles return newTriangles.iterator().next(); }
@Override public void remove(Node s, Node p, Node o) { base.remove(s, p, o); getEventManager().notifyEvent(this, GraphEvents.remove(s, p, o)); }
@Override public final boolean remove(GNode<N> n, byte flags) { return g.remove(n, flags); }
@Override public final boolean remove(GNode<N> n) { return g.remove(n); }