X-Git-Url: http://git.megacz.com/?p=anneal.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fqfat%2FMesh.java;h=8a697dc1ec39f6c9d47d4b7bb6d8b57395c01fa1;hp=f4f08379e416237ada40723150c1d6a9ab89e384;hb=982c27e513b15799973ab26d5dc143aa4606800a;hpb=3685f1880f7505a26574d02102aafcef11b0686e diff --git a/src/edu/berkeley/qfat/Mesh.java b/src/edu/berkeley/qfat/Mesh.java index f4f0837..8a697dc 100644 --- a/src/edu/berkeley/qfat/Mesh.java +++ b/src/edu/berkeley/qfat/Mesh.java @@ -116,25 +116,6 @@ public class Mesh implements Iterable { return (float)total; } - public class BindingGroup { - public HashSet es = new HashSet(); - 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(); } @@ -337,6 +318,56 @@ public class Mesh implements Iterable { } } + public class BindingGroup { + private HashSet left = new HashSet(); + private HashSet right = new HashSet(); + public BindingGroup() { } + public BindingGroup(E e) { + left.add(e); + } + public void add(E e, boolean swap) { + if (e.bg != null) { + if (e.bg == this) return; + 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; + } + } + 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; + 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); + } + for(E e : right) { + e.shatter(e.midpoint(), bg2, bg1); /* swap correct? */ + } + } + } + /** [UNIQUE] an edge */ public final class E implements Comparable { @@ -350,17 +381,10 @@ public class Mesh implements Iterable { public int compareTo(E e) { return e.length() > length() ? 1 : -1; } - 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 void bindEdge(E e) { + bg.add(e.pair, false); } + 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) { @@ -373,14 +397,14 @@ public class Mesh implements Iterable { 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); + bg1.add(p1.getE(mid), false); + bg2.add(p2.getE(mid).pair, false); return mid; }