import edu.berkeley.qfat.geom.*;
import edu.wlu.cs.levy.CG.KDTree;
import edu.berkeley.qfat.geom.Point;
+import com.infomatiq.jsi.IntProcedure;
public class Mesh implements Iterable<Mesh.T> {
public boolean immutableVertices;
public boolean ignorecollision = false;
- public Mesh score_against = null;
- public double score = 0;
+ public Mesh error_against = null;
+ public double error = 0;
public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
public void makeVerticesImmutable() { this.immutableVertices = true; }
- public float score() { return (float)score; }
+ public float error() { return (float)error; }
public int size() { return vertices.size(); }
public Iterable<Vertex> vertices() { return vertices; }
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);
+ for(Vertex v : set) v.transform(m.times(v.p));
}
public void rebuild() { /*vertices.rebuild();*/ }
// Vertexices //////////////////////////////////////////////////////////////////////////////
/** a vertex in the mesh */
- public final class Vertex extends HasPoint implements Visitor<T> {
- public String toString() { return p.toString(); }
+ public final class Vertex extends HasQuadric implements Visitor {
public Point p;
E e; // some edge *leaving* this point
- /** the nearest vertex in the "score_against" mesh */
- Vertex nearest_in_other_mesh;
- /** the number of vertices in the other mesh for which this is the nearest_in_other_mesh */
- int quadric_count;
- /** the total error quadric (contributions from all vertices in other mesh for which this is nearest) */
- Matrix quadric = Matrix.ZERO;
-
Matrix binding = Matrix.ONE;
Vertex bound_to = this;
- float oldscore = 0;
- boolean quadricStale = false;
+ private boolean good;
- public Matrix errorQuadric() { return quadric; }
public Point getPoint() { return p; }
- public float score() { return oldscore; }
-
- private Matrix fundamentalQuadric = null;
- public Matrix fundamentalQuadric() {
- if (fundamentalQuadric == null) recomputeFundamentalQuadric();
- return fundamentalQuadric;
- }
+ public float error() { return olderror; }
private Vertex(Point p) {
this.p = p;
vertices.add(this);
}
- private void glNormal(GL gl) {
- Vec norm = norm();
- gl.glNormal3f(norm.x, norm.y, norm.z);
- }
-
- public void recomputeFundamentalQuadric() {
- unApplyQuadricToNeighbor();
- if (quadricStale || fundamentalQuadric==null) {
- Matrix m = Matrix.ZERO;
- int count = 0;
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
- T t = e.t;
- m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
- count++;
- }
- quadricStale = false;
- fundamentalQuadric = m.times(1/(float)count);
- }
- applyQuadricToNeighbor();
+ public float olderror = 0;
+ public void setError(float nerror) {
+ error -= olderror;
+ olderror = nerror;
+ error += olderror;
}
- public void unApplyQuadricToNeighbor() {
- if (nearest_in_other_mesh == null) return;
- if (fundamentalQuadric == null) return;
- nearest_in_other_mesh.unComputeError();
- nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.minus(fundamentalQuadric);
- nearest_in_other_mesh.quadric_count--;
- if (nearest_in_other_mesh.quadric_count==0)
- nearest_in_other_mesh.quadric = Matrix.ZERO;
- nearest_in_other_mesh.computeError();
- nearest_in_other_mesh = null;
- }
-
- public void applyQuadricToNeighbor() {
- if (score_against == null) return;
-
- Vertex new_nearest = score_against.nearest(p);
- if (nearest_in_other_mesh != null && new_nearest == nearest_in_other_mesh) return;
-
- if (nearest_in_other_mesh != null) unApplyQuadricToNeighbor();
- if (nearest_in_other_mesh != null) throw new Error();
-
- nearest_in_other_mesh = new_nearest;
-
- // don't attract to vertices that face the other way
- if (nearest_in_other_mesh.e == null || nearest_in_other_mesh.norm().dot(norm()) < 0) {
- nearest_in_other_mesh = null;
- } else {
- nearest_in_other_mesh.unComputeError();
- nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
- nearest_in_other_mesh.quadric_count++;
- nearest_in_other_mesh.computeError();
+ public Matrix _recomputeFundamentalQuadric() {
+ Matrix m = Matrix.ZERO;
+ int count = 0;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+ m = m.plus(e.t.norm().fundamentalQuadric(e.t.centroid()));
+ count++;
}
- reComputeError();
+ return m.times(1/(float)count);
}
- public void reComputeErrorAround() {
- 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();
- }
- public void reComputeError() {
- unComputeError();
- computeError();
- }
- public void unComputeError() {
- score -= oldscore;
- oldscore = 0;
- }
+ public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
public void computeError() {
- oldscore =
+ float nerror =
quadric_count != 0
? (quadric.preAndPostMultiply(p) * 100) / quadric_count
- : immutableVertices
- ? oldscore
: nearest_in_other_mesh != null
? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
- : score_against != null
- ? score_against.nearest(p).fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
+ : error_against != null
+ ? nearest().fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
: 0;
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
double ang = Math.abs(e.crossAngle());
if (ang > Math.PI) throw new Error();
float minangle = (float)(Math.PI * 0.8);
- if (ang > minangle)
- oldscore += (ang - minangle);
+ if (ang > minangle) nerror += (ang - minangle);
}
- score += oldscore;
- }
-
- private void removeTrianglesFromRTree() {
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
- if (e.t != null) e.t.removeFromRTree();
- }
- private void addTrianglesToRTree() {
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
- if (e.t != null) e.t.addToRTree();
+ setError(nerror);
}
/** does NOT update bound pairs! */
- public boolean transform(Matrix m) {
+ public boolean transform(Point newp) {
if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
if (vertices.get(this.p)==null) throw new Error();
vertices.remove(this);
- removeTrianglesFromRTree();
- float newx = m.a*p.x + m.b*p.y + m.c*p.z + m.d;
- float newy = m.e*p.x + m.f*p.y + m.g*p.z + m.h;
- float newz = m.i*p.x + m.j*p.y + m.k*p.z + m.l;
- this.p = new Point(newx, newy, newz);
- addTrianglesToRTree();
+ 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);
applyQuadricToNeighbor();
if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
- reComputeErrorAround();
return good;
}
- public void visit(T t) {
- if (!good) return;
- 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 (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; }
+ public void reComputeErrorAround() {
+ 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();
+ }
+
+ public boolean visit(Object o) {
+ if (o instanceof T) {
+ T t = (T)o;
+ if (!good) 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 (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; }
+ }
}
+ return good;
+ } else {
+ Vertex v = (Vertex)o;
+ if (v.e==null || v.norm().dot(Vertex.this.norm()) < 0)
+ return false;
+ return true;
}
}
- private boolean good;
+ Point oldp;
public boolean move(Vec v) {
Matrix m = Matrix.translate(v);
- Vertex p = this;
boolean good = true;
- do {
- good &= p.transform(m);
- p = p.bound_to;
- } while (p != this);
+ for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to) {
+ p.oldp = p.p;
+ good &= p.transform(m.times(p.p));
+ }
+ for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
+ if (good)
+ p.reComputeErrorAround();
+ else
+ p.transform(p.oldp);
return good;
}
return null;
}
+ private void glNormal(GL gl) {
+ Vec norm = norm();
+ gl.glNormal3f(norm.x, norm.y, norm.z);
+ }
public Vec norm() {
Vec norm = new Vec(0, 0, 0);
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
public float comparator() {
- Vertex nearest = score_against.nearest(midpoint());
+ Vertex nearest = error_against.nearest(midpoint());
return (float)Math.max(length(), midpoint().distance(nearest.p));
}
public int compareTo(E e) {