return (float)total;
}
- public class BindingGroup {
- public HashSet<E> es = new HashSet<E>();
- public BindingGroup() { }
- public BindingGroup(E e) {
- es.add(e);
- }
- public void add(E e) {
- if (e.bg != null) { merge(e.bg); return; }
- es.add(e);
- e.bg = this;
- }
- public void merge(BindingGroup bg) {
- for(E e : bg.es) {
- e.bg = null;
- add(e);
- }
- }
- }
-
public void rebuildPointSet() { pointset.rebuild(); }
public Vec diagonal() { return pointset.diagonal(); }
public Point centroid() { return pointset.centroid(); }
}
}
+ public class BindingGroup {
+ private HashSet<E> left = new HashSet<E>();
+ private HashSet<E> right = new HashSet<E>();
+ public BindingGroup() { }
+ public BindingGroup(E e) { add(e, false); }
+ public void add(E e, boolean swap) {
+ if (e.bg != null) {
+ if (e.bg == this) return; /* fixme what if it is in the "other" set? */
+ for(E ex : (!swap ? e.bg.left : e.bg.right)) {
+ ex.bg = this;
+ left.add(ex);
+ }
+ for(E ex : (!swap ? e.bg.right : e.bg.left)) {
+ ex.bg = this;
+ right.add(ex);
+ }
+
+ } else {
+ (!swap ? left : right).add(e);
+ e.bg = this;
+ }
+
+ for(E ex : (!swap ? right : left)) {
+ if (e.next.isBoundTo(ex.next)) {
+ System.out.println("hit!");
+ }
+ }
+ }
+ public boolean isBoundTo(E e1, E e2) {
+ if (left.contains(e1) && right.contains(e2)) return true;
+ if (left.contains(e2) && right.contains(e1)) return true;
+ return false;
+ }
+ public void dobind(E e) {
+ Vert v1 = null;
+ Vert v2 = null;
+ if (left.contains(e)) { v1 = e.p1; v2 = e.p2; }
+ if (right.contains(e)) { v1 = e.p2; v2 = e.p1; }
+ for(E ex : left) {
+ if (ex==e) continue;
+ v1.bind(ex.p1);
+ v2.bind(ex.p2);
+ }
+ for(E ex : right) {
+ if (ex==e) continue;
+ v1.bind(ex.p2);
+ v2.bind(ex.p1);
+ }
+ }
+ public void shatter(BindingGroup bg1, BindingGroup bg2) {
+ for(E e : left) {
+ e.shatter(e.midpoint(), bg1, bg2, false);
+ }
+ for(E e : right) {
+ e.shatter(e.midpoint(), bg1, bg2, true); // swap correct?
+ }
+ }
+ }
+
/** [UNIQUE] an edge */
public final class E implements Comparable<E> {
public BindingGroup bg = new BindingGroup(this);
boolean shattered = false;
- public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
+ public boolean isBoundTo(E e) { return bg.isBoundTo(this, e); }
- public void bind(E e) { bind(e, new Matrix()); }
- public void bind(E e, Matrix m) { e.bg.add(this); }
- public void dobind() {
- if (bg==null) return;
- for(E ex : bg.es) {
- if (ex==this) continue;
- p1.bind(ex.p1);
- p2.bind(ex.p2);
- }
+ public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
+
+ public void bindEdge(E e) {
+ bg.add(e, true);
}
+ public void dobind() { if (bg != null) bg.dobind(this); }
- public Point shatter() { return shatter(midpoint(), null, null); }
- public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
+ public Point shatter() { return shatter(midpoint(), null, null, false); }
+ public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean swap) {
if (shattered) return mid;
shattered = true;
if (bg1==null) bg1 = new BindingGroup();
if (bg2==null) bg2 = new BindingGroup();
- for(E e : bg.es) e.shatter(e.midpoint(), bg1, bg2);
+ bg.shatter(bg1, bg2);
pair.shatter();
destroy();
newT(r.p, p1.p, mid, null);
newT(r.p, mid, p2.p, null);
- bg1.add(p1.getE(mid));
- bg2.add(p2.getE(mid).pair);
+ (swap ? bg1 : bg2).add(p1.getE(mid), swap);
+ (swap ? bg2 : bg1).add(p2.getE(mid).pair, swap);
return mid;
}