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> {
// Vertexices //////////////////////////////////////////////////////////////////////////////
/** a vertex in the mesh */
- public final class Vertex extends HasPoint implements Visitor<T> {
+ public final class Vertex extends HasQuadric implements Visitor {
public String toString() { return p.toString(); }
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;
- 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;
- }
-
private Vertex(Point p) {
this.p = p;
if (vertices.get(p) != null) throw new Error();
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 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 void _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) {
+ T t = e.t;
+ m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
+ count++;
}
- reComputeError();
+ quadricStale = false;
+ fundamentalQuadric = m.times(1/(float)count);
}
public void reComputeErrorAround() {
score -= oldscore;
oldscore = 0;
}
+ public HasQuadric nearest() {
+ if (score_against==null) return null;
+ return score_against.vertices.nearest(p, this);
+ }
public void computeError() {
oldscore =
quadric_count != 0
: 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
+ ? 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());
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 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;
projects / anneal.git / blobdiff