X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=02188f22f9ec7f9c1cab7c1e5e89f5f712d702f6;hp=0df0072ef90ec58a1230f75e224a825e98d6dcb0;hb=fd66f9cae9e63d2c1dbbdcd020c6fb97839278cc;hpb=3e0fc8c7a5658abf2c460fc4eae44d137748e4e7 diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java index 0df0072..02188f2 100644 --- a/src/edu/berkeley/qfat/Mesh.java +++ b/src/edu/berkeley/qfat/Mesh.java @@ -322,44 +322,57 @@ public class Mesh implements Iterable { private HashSet left = new HashSet(); private HashSet right = new HashSet(); public BindingGroup() { } - public BindingGroup(E e) { - left.add(e); - } - public void add(E e) { + public BindingGroup(E e) { add(e, false); } + public void add(E e, boolean swap) { if (e.bg != null) { - if (e.bg == this) return; - for(E ex : e.bg.left) { + 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 : e.bg.right) { + for(E ex : (!swap ? e.bg.right : e.bg.left)) { ex.bg = this; right.add(ex); } + } else { - left.add(e); + (!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) { - // assumes e is part of the "left" set + 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; - e.p1.bind(ex.p1); - e.p2.bind(ex.p2); + v1.bind(ex.p1); + v2.bind(ex.p2); } for(E ex : right) { if (ex==e) continue; - e.p1.bind(ex.pair.p1); - e.p2.bind(ex.pair.p2); + 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); + e.shatter(e.midpoint(), bg1, bg2, false); } for(E e : right) { - e.shatter(e.midpoint(), bg2, bg1); /* swap correct? */ + e.shatter(e.midpoint(), bg1, bg2, true); // swap correct? } } } @@ -375,15 +388,18 @@ public class Mesh implements Iterable { public BindingGroup bg = new BindingGroup(this); boolean shattered = false; + public boolean isBoundTo(E e) { return bg.isBoundTo(this, e); } + + public int compareTo(E e) { return e.length() > length() ? 1 : -1; } public void bindEdge(E e) { - e.pair.bg.add(this); + 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; @@ -399,8 +415,8 @@ public class Mesh implements Iterable { 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; }