private PointSet<Vertex> vertices = new PointSet<Vertex>();
public boolean immutableVertices;
- public boolean ignorecollision = false;
public Mesh error_against = null;
public double error = 0;
Matrix binding = Matrix.ONE;
Vertex bound_to = this;
- private boolean good;
+ private boolean illegal = false;
public Point getPoint() { return p; }
public float error() { return olderror; }
vertices.add(this);
}
+ public void reinsert() {
+ vertices.remove(this);
+ vertices.add(this);
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
+ }
+
public float olderror = 0;
public void setError(float nerror) {
error -= olderror;
if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
-
- if (vertices.get(this.p)==null) throw new Error();
- vertices.remove(this);
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
- if (e.t != null) e.t.removeFromRTree();
this.p = newp;
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
- if (e.t != null) e.t.addToRTree();
- vertices.add(this);
-
+ reinsert();
applyQuadricToNeighbor();
- good = true;
+ if (ignoreProblems) return true;
- if (!ignoreProblems)
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
- if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
- if (e.t.aspect() < 0.1) good = false;
- e.p2.quadricStale = true;
- }
-
- if (!ignorecollision && !ignoreProblems && good)
- triangles.range(oldp, this.p, (Visitor<T>)this);
+ illegal = false;
+ checkLegality();
+ return !illegal;
+ }
- return good;
+ public void checkLegality() {
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+ if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) illegal = true;
+ if (e.t.aspect() < 0.1) illegal = true;
+ e.p2.quadricStale = true;
+ }
+ if (illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
public void reComputeErrorAround() {
reComputeError();
- if (nearest_in_other_mesh != null) nearest_in_other_mesh.reComputeError();
+ if (nearest_in_other_mesh != null)
+ nearest_in_other_mesh.reComputeError();
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
e.p2.reComputeError();
}
if (o instanceof Vertex)
return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
T t = (T)o;
- if (!good) return false;
+ if (illegal) return false;
for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
- if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
+ if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { illegal = true; }
if (e.t != null) {
- if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
- if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
- if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
+ if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { illegal = true; }
+ if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { illegal = true; }
+ if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { illegal = true; }
}
}
- return good;
+ return !illegal;
}
public boolean move(Matrix m, boolean ignoreProblems) {
for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
good &= p.transform(m.times(p.p), ignoreProblems);
for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
- if (good) p.reComputeErrorAround();
- else p.transform(p.oldp, true);
+ if (good || ignoreProblems) p.reComputeErrorAround();
+ else p.transform(p.oldp, true);
return good;
}
return ret;
}
-
/** [UNIQUE] a triangle (face) */
public final class T extends Triangle {
public final E e1;
public final int color;
public final int colorclass;
- public void removeFromRTree() { triangles.remove(this); }
- public void addToRTree() { triangles.insert(this); }
-
- public void destroy() { triangles.remove(this); }
-
T(E e1, int colorclass) {
this.e1 = e1;
E e2 = e1.next;
public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
+ public void removeFromRTree() { triangles.remove(this); }
+ public void addToRTree() { triangles.insert(this); }
+ public void destroy() { triangles.remove(this); }
+ public void reinsert() { triangles.remove(this); triangles.add(this); }
+
public boolean shouldBeDrawn() {
if (e1().bind_to.set.size() == 0) return false;
if (e2().bind_to.set.size() == 0) return false;