public void transform(Matrix m) {
ArrayList<Vertex> set = new ArrayList<Vertex>();
for(Vertex v : vertices) set.add(v);
- for(Vertex v : set) v.transform(m.times(v.p), true);
+ for(Vertex v : set) v.transform(m.times(v.p), true, null);
}
public void rebuild() { /*vertices.rebuild();*/ }
/** a vertex in the mesh */
public final class Vertex extends HasQuadric implements Visitor {
- public Point p, oldp, goodp;
+ public Point p, goodp;
+ public Point oldp;
E e; // some edge *leaving* this point
private boolean illegal = false;
if (quadric_count != 0)
nerror = (nerror + quadric.preAndPostMultiply(p))/(quadric_count+1);
+ if (!immutableVertices && quadric_count == 0)
+ nerror *= 2;
+
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
double ang = Math.abs(e.dihedralAngle());
if (ang > Math.PI) throw new Error();
float minangle = (float)(Math.PI * 0.8);
if (ang > minangle) nerror += (ang - minangle);
- /*
if (e.t.aspect() < 0.2) {
nerror += (0.2-e.t.aspect()) * 10;
}
- */
}
setError(nerror);
// t2' = t2.getMatrix(t1) * M * t1
// t1 = t1.getMatrix(t2) * t2
// M * t1 = M * t1.getMatrix(t2) * t2
- for(Vertex v : (Iterable<Vertex>)getBoundPeers())
- good &= v.transform(v.getBindingMatrix(this).times(m).times(this.p),
- ignoreProblems);
+ Point op = this.p;
+ Point pt = m.times(this.p);
+ for(Vertex v : (Iterable<Vertex>)getBoundPeers()) {
+ Point pt2 = v.getBindingMatrix(this).times(pt);
+ /*
+ if (Math.abs( v.p.minus(pt2).mag() / pt.minus(op).mag() ) > 5)
+ throw new Error(v.p+" "+pt2+"\n"+op+" "+pt+"\n"+v.getBindingMatrix(this));
+ if (Math.abs( v.p.minus(pt2).mag() / pt.minus(op).mag() ) < 1/5) throw new Error();
+ */
+ good &= v.transform(pt2,
+ ignoreProblems, v.getBindingMatrix(this));
+ }
for(Vertex v : (Iterable<Vertex>)getBoundPeers())
- if (good || ignoreProblems) v.reComputeErrorAround();
- else v.transform(v.oldp, true);
-
+ v.recomputeFundamentalQuadricIfNeighborChanged();
return good;
}
/** does NOT update bound pairs! */
- private boolean transform(Point newp, boolean ignoreProblems) {
+ private boolean transform(Point newp, boolean ignoreProblems, Matrix yes) {
this.oldp = this.p;
if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
+
+
+ illegal = false;
+ if (this.p.minus(newp).mag() > 0.1 && !ignoreProblems) {
+ /*
+ try {
+ throw new Exception(""+this.p.minus(newp).mag()+" "+ignoreProblems+" "+yes);
+ } catch(Exception e) {
+ e.printStackTrace();
+ }
+ */
+ illegal = true;
+ }
+
this.p = newp;
reinsert();
applyQuadricToNeighbor();
if (!ignoreProblems) {
- illegal = false;
checkLegality();
}
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.p2.quadricStale = true;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
+ e.p2.quadricStale = true;
return !illegal;
}
public void checkLegality() {
- /*
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
if (Math.abs(e.dihedralAngle()) > (Math.PI * 0.9) ||
Math.abs(e.next.dihedralAngle()) > (Math.PI * 0.9)) illegal = true;
- if (e.t.aspect() < 0.1) illegal = true;
+ if (e.t.aspect() < 0.2) illegal = true;
}
- */
if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
public void bindTo(Vertex p) { bindTo(Matrix.ONE, p); }
}
- public class BindingGroup {
- private HashSet<E> set = new HashSet<E>();
- public BindingGroup bind_others;
- public BindingGroup other() { return bind_others; }
- public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
- public BindingGroup() { this.bind_others = new BindingGroup(this); }
- public BindingGroup(E e) { this(); set.add(e); }
- public void add(E e) {
- if (set.contains(e)) return;
- set.add(e);
- BindingGroup e_bind_peers = e.bind_peers;
- BindingGroup e_bind_to = e.bind_to;
- e.bind_peers = this;
- e.bind_to = bind_others;
- for (E epeer : e_bind_peers.set) add(epeer);
- for (E eother : e_bind_to.set) bind_others.add(eother);
- /*
- for(E eother : bind_others.set) {
- if (e.next.bind_to.set.contains(eother.prev)) {
- e.next.next.bindEdge(eother.prev.prev);
- }
- if (e.prev.bind_to.set.contains(eother.next)) {
- e.prev.prev.bindEdge(eother.next.next);
- }
- }
- */
- }
- public void dobind(E e) {
- for(E ebound : set) {
- e.p1.bindTo(Matrix.ONE, ebound.p2);
- e.p2.bindTo(Matrix.ONE, ebound.p1);
- }
- }
- public void shatter(BindingGroup bg1, BindingGroup bg2, boolean triangles) {
- for(E e : set) {
- e.shatter(e.midpoint(), bg1, bg2, triangles);
- }
- }
- }
/** [UNIQUE] an edge */
public final class E extends HasBindingGroup implements Comparable<E> {
E prev; // previous half-edge
E next; // next half-edge
E pair; // partner half-edge
- public BindingGroup bind_peers = new BindingGroup(this);
- public BindingGroup bind_to = bind_peers.other();
boolean shattered = false;
public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
public void bindingGroupChanged(edu.berkeley.qfat.geom.BindingGroup newBindingGroup_) {
+
edu.berkeley.qfat.geom.BindingGroup<E> newBindingGroup =
(edu.berkeley.qfat.geom.BindingGroup<E>)newBindingGroup_;
if (newBindingGroup==null) return;
if (this==newBindingGroup.getMaster()) return;
- /*
for(E eother : (Iterable<E>)newBindingGroup) {
- this.next.bindTo(newBindingGroup.getMatrix(eother), eother.next);
- this.prev.bindTo(newBindingGroup.getMatrix(eother), eother.prev);
+ if (next==null || prev==null) continue;
+ if (eother.next==null || eother.prev==null) continue;
+ if (next.isBoundTo(eother.pair.prev.pair) && !prev.isBoundTo(eother.pair.next.pair))
+ prev.bindTo(next.getBindingMatrix(eother.pair.prev.pair), eother.pair.next.pair);
+ if (!next.isBoundTo(eother.pair.prev.pair) && prev.isBoundTo(eother.pair.next.pair))
+ next.bindTo(prev.getBindingMatrix(eother.pair.next.pair), eother.pair.prev.pair);
}
- */
+
}
public float stretchRatio() {
pair._bindEdge(e.pair, m);
}
public void _bindEdge(E e, Matrix m) {
- //bind_to.add(e);
-
e = e.pair;
/*
//assumes edges are identical length at binding time
}
public void dobind() {
- //bind_to.dobind(this);
for(E e : (Iterable<E>)getBoundPeers()) {
if (e==this) continue;
p1.bindTo(getBindingMatrix(e), e.p1);
}
}
- public Point shatter() { return shatter(true); }
- public Point shatter(boolean triangles) { return shatter(midpoint(), null, null, triangles); }
- public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles) {
- return shatter(mid, bg1, bg2, triangles, false);
- }
- public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles, boolean leader) {
- if (shattered || destroyed) return mid;
+ public Point shatter() {
+ if (shattered || destroyed) return null;
shattered = true;
-
- Vertex r = next.p2;
- E next = this.next;
- E prev = this.prev;
-
- int old_colorclass = t==null ? 0 : t.colorclass;
- if (bg1==null) bg1 = new BindingGroup();
- if (bg2==null) bg2 = new BindingGroup();
- BindingGroup old_bind_to = bind_to;
- bind_peers.shatter(bg1, bg2, triangles);
- old_bind_to.shatter(bg2.other(), bg1.other(), triangles);
- if (!triangles) {
- next.shatter(false);
- prev.shatter(false);
+ E first = null;
+ E firste = null;
+ E firstx = null;
+ E firstq = null;
+ for(E e : (Iterable<E>)getBoundPeers()) {
+ E enext = e.next;
+ E eprev = e.prev;
+ E pnext = e.pair.next;
+ E pprev = e.pair.prev;
+ Point mid = e.midpoint();
+ Vertex r = e.next.p2;
+ Vertex l = e.pair.next.p2;
+ e.destroy();
+ e.pair.destroy();
+ newT(r.p, e.p1.p, mid, null, 0);
+ newT(r.p, mid, e.p2.p, null, 0);
+ newT(l.p, mid, e.p1.p, null, 0);
+ newT(l.p, e.p2.p, mid, null, 0);
}
- pair.shatter();
- destroy();
-
- if (triangles) {
- newT(r.p, p1.p, mid, null, old_colorclass);
- newT(r.p, mid, p2.p, null, old_colorclass);
- bg1.add(p1.getE(mid));
- bg2.add(p2.getE(mid).pair);
- if (leader) p1.getE(mid).shatter();
+ for(E e : (Iterable<E>)getBoundPeers()) {
+ Point mid = e.midpoint();
+ if (first==null) {
+ first = e.p1.getE(mid);
+ firste = e;
+ firstx = e.pair;
+ firstq = e.p2.getE(mid).pair;
+ continue;
+ }
+ e.p1.getE(mid). bindTo(e.getBindingMatrix(firste), first);
+ e.p1.getE(mid).pair. bindTo(e.getBindingMatrix(firste), first.pair);
+ e.p2.getE(mid).pair. bindTo(e.getBindingMatrix(firste), firstq);
+ e.p2.getE(mid).pair.pair.bindTo(e.getBindingMatrix(firste), firstq.pair);
}
- return mid;
+ return null;
}
public boolean destroyed = false;
pair.next.t = null;
pair.prev.t = null;
- this.bind_to = null;
- pair.bind_to = null;
- this.bind_peers = null;
- pair.bind_peers = null;
pair.prev.next = next;
next.prev = pair.prev;
prev.next = pair.next;
this.prev.next = this;
this.next.prev = this;
this.pair.pair = this;
- bind_peers.add(this);
if (this.next.p1 != p2) throw new Error();
if (this.prev.p2 != p1) throw new Error();
if (this.p1.e == null) this.p1.e = this;
public void makeAdjacent(E e) {
if (this.next == e) return;
if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
- if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
+ if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free ");
E freeIncident = p2.getFreeIncident(e, this);
public boolean shouldBeDrawn() {
/*
- if (e1().bind_to==null) return false;
- if (e2().bind_to==null) return false;
- if (e3().bind_to==null) return false;
- if (e1().bind_to.set.size() == 0) return false;
- if (e2().bind_to.set.size() == 0) return false;
- if (e3().bind_to.set.size() == 0) return false;
+ if (e1().bindingGroupSize() <= 1) return false;
+ if (e2().bindingGroupSize() <= 1) return false;
+ if (e3().bindingGroupSize() <= 1) return false;
*/
return true;
}