public class Mesh implements Iterable<Mesh.T> {
- public static float EPSILON = (float)0.0001;
- public static Random random = new Random();
+ public static final float EPSILON = (float)0.0001;
+ public static final Random random = new Random();
private PointSet<Vert> pointset = new PointSet<Vert>();
public int numedges = 0;
public float avgedge = 0;
- public void unbind() {
+ public void rebindPoints() {
+ // unbind all points
for(Mesh.T t : this) {
t.v1().unbind();
t.v2().unbind();
t.v3().unbind();
}
- }
-
- public void bind() {
+ // ask edges to re-implement their bindings
for(Mesh.T t : this) {
t.e1().dobind();
t.e2().dobind();
}
}
- public float rescore() {
+ public void unscoreAll() {
+ HashSet<Vert> done = new HashSet<Vert>();
+ for(T t : this)
+ for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
+ if (done.contains(p)) continue;
+ done.add(p);
+ p.unscore();
+ }
+ }
+ public void recomputeAllFundamentalQuadrics() {
+ HashSet<Vert> done = new HashSet<Vert>();
+ for(T t : this)
+ for(Vert p : new Vert[] { t.v1(), t.v2(), t.v3() }) {
+ if (done.contains(p)) continue;
+ done.add(p);
+ p.recomputeFundamentalQuadric();
+ }
+ }
+ public float rescoreAll() {
int num = 0;
double dist = 0;
HashSet<Vert> done = new HashSet<Vert>();
if (done.contains(p)) continue;
done.add(p);
p.rescore();
+
}
return (float)(dist/num);
}
return (float)total;
}
-
public class BindingGroup {
public HashSet<E> es = new HashSet<E>();
public BindingGroup() { }
public final class Vert extends HasPoint {
public Point p;
+ E e; // some edge *leaving* this point
+
+ /** the nearest vertex in the "score_against" mesh */
+ Vert 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;
+
+ Vert bound_to = this;
+ Matrix binding = new Matrix();
+ float oldscore = 0;
+
+ 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 Vert(Point p) {
this.p = p;
if (pointset.get(p) != null) throw new Error();
pointset.add(this);
}
- public float score() { return oldscore; }
+
+ public void recomputeFundamentalQuadric() {
+ unscore();
+ Matrix m = Matrix.ZERO;
+ E e = this.e;
+ do {
+ T t = e.t;
+ m = m.plus(t.norm().fundamentalQuadric(t.centroid()));
+ e = e.pair.next;
+ } while(e != this.e);
+ fundamentalQuadric = m;
+ rescore();
+ }
+
public void unscore() {
- if (watch == null) return;
- watch.watch_x -= p.x;
- watch.watch_y -= p.y;
- watch.watch_z -= p.z;
- watch.watch_count--;
- if (watch.watch_count==0) {
- watch.watch_x = 0;
- watch.watch_y = 0;
- watch.watch_z = 0;
- }
- watch = null;
+ if (nearest_in_other_mesh == null) return;
+ if (fundamentalQuadric == null) return;
+ nearest_in_other_mesh.unsc();
+ 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.resc();
+ nearest_in_other_mesh = null;
+ }
+
+ public void unsc() {
+ score -= oldscore;
+ oldscore = 0;
}
- public Vert partner() { return watch==null ? this : watch; }
- public Point watchback() { return watch_count==0 ? partner().p :
- new Point(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count); }
public void rescore() {
if (score_against == null) return;
- score -= oldscore;
- oldscore = 0;
+ unsc();
- if (watch != null) unscore();
- Vert po = this;
- if (watch == null) {
- watch = score_against.nearest(po.p);
+ if (nearest_in_other_mesh != null) unscore();
+ if (nearest_in_other_mesh == null) {
+ nearest_in_other_mesh = score_against.nearest(p);
// don't attract to vertices that face the other way
- if (watch.e == null || watch.norm().dot(norm()) < 0) {
- watch = null;
+ if (nearest_in_other_mesh.e == null || nearest_in_other_mesh.norm().dot(norm()) < 0) {
+ nearest_in_other_mesh = null;
} else {
- watch.watch_x += po.p.x;
- watch.watch_y += po.p.y;
- watch.watch_z += po.p.z;
- watch.watch_count++;
+ nearest_in_other_mesh.unsc();
+ nearest_in_other_mesh.quadric = nearest_in_other_mesh.quadric.plus(fundamentalQuadric());
+ nearest_in_other_mesh.quadric_count++;
+ nearest_in_other_mesh.resc();
}
}
- double s1, s2;
- if (watch_count==0) s1 = 0;
- else s1 = p.distance(watch_x/watch_count, watch_y/watch_count, watch_z/watch_count);
- s2 = watch==null ? 0 : po.p.distance(watch.p);
- oldscore = (float)(s1 + s2);
+ resc();
+ }
+ public void resc() {
+ oldscore = quadric_count == 0 ? 0 : (quadric.preAndPostMultiply(p) / quadric_count);
score += oldscore;
}
/** does NOT update bound pairs! */
public boolean transform(Matrix m) {
- // FIXME: screws up kdtree
- // FIXME: screws up hashmap
unscore();
try {
if (pointset.get(this.p)==null) throw new Error();
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);
- // FIXME: what if we move onto exactly where another point is?
pointset.add(this);
} catch (Exception e) {
throw new RuntimeException(e);
}
rescore();
- boolean good = true;
- /*
- for(T t : this) {
- for(E e = this.e; ;) {
- if (e.intersects(t)) { good = false; break; }
- e = e.pair.next;
- if (e == this.e) break;
- }
- }
- */
- /*
- if (t==this.t) continue;
- if (this.intersects(t)) good = false;
- }
- */
- return good;
+
+ // should recompute fundamental quadrics of all vertices sharing a face, but we defer...
+ // FIXME: intersection test needed?
+ return true;
}
+
public boolean move(Vec v) {
Matrix m = new Matrix(v);
Vert p = this;
boolean good = true;
do {
good &= p.transform(m);
- v = v.times(binding); // bleh wrong
p = p.bound_to;
} while (p != this);
return good;
return null;
}
+ public E getE(Point p2) {
+ Vert v = pointset.get(p2);
+ if (v==null) return null;
+ return getE(v);
+ }
public E getE(Vert p2) {
E e = this.e;
do {
return null;
}
+ public Vec norm() {
+ Vec norm = new Vec(0, 0, 0);
+ E e = this.e;
+ do {
+ if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
+ e = e.pair.next;
+ } while(e != this.e);
+ return norm.norm();
+ }
+
public boolean isBoundTo(Vert p) {
Vert px = p;
do {
} while(px != p);
return false;
}
-
public void unbind() { bound_to = this; binding = new Matrix(); }
public void bind(Vert p) { bind(p, new Matrix()); }
public void bind(Vert p, Matrix binding) {
this.bound_to = temp_bound_to;
this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
}
- public Vec norm() {
- Vec norm = new Vec(0, 0, 0);
- E e = this.e;
- do {
- if (e.t != null) norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
- e = e.pair.next;
- } while(e != this.e);
- return norm.norm();
- }
-
- Vert bound_to = this;
- int watch_count;
- float watch_x;
- float watch_y;
- float watch_z;
- Vert watch;
- E e; // some edge *leaving* this point
- Matrix binding = new Matrix();
- float oldscore = 0;
- boolean inserted = false;
}
/** [UNIQUE] an edge */
E next; // next half-edge
E pair; // partner half-edge
public BindingGroup bg = new BindingGroup(this);
+ boolean shattered = false;
public int compareTo(E e) { return e.length() > length() ? 1 : -1; }
}
}
- boolean shattered = false;
- public Vert shatter() { return shatter(register(midpoint()), null, null); }
- public Vert shatter(Vert mid, BindingGroup bg1, BindingGroup bg2) {
+ public Point shatter() { return shatter(midpoint(), null, null); }
+ public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
if (shattered) return mid;
shattered = true;
if (bg1==null) bg1 = new BindingGroup();
if (bg2==null) bg2 = new BindingGroup();
- for(E e : bg.es) e.shatter(register(e.midpoint()), bg1, bg2);
+ for(E e : bg.es) e.shatter(e.midpoint(), bg1, bg2);
pair.shatter();
destroy();
- newT(r.p, p1.p, mid.p, null);
- newT(r.p, mid.p, p2.p, null);
+ newT(r.p, p1.p, mid, null);
+ newT(r.p, mid, p2.p, null);
bg1.add(p1.getE(mid));
- bg2.add(mid.getE(p2));
+ bg2.add(p2.getE(mid).pair);
return mid;
}
}
/** creates an isolated edge out in the middle of space */
- public E(Vert p1, Vert p2) {
- if (p1==p2) throw new Error("attempt to create edge with single vertex: " + p1);
- this.p1 = p1;
- this.p2 = p2;
+ public E(Point p1, Point p2) {
+ if (pointset.get(p1) != null) throw new Error();
+ if (pointset.get(p2) != null) throw new Error();
+ this.p1 = new Vert(p1);
+ this.p2 = new Vert(p2);
this.prev = this.next = this.pair = new E(this, this, this);
+ this.p1.e = this;
+ this.p2.e = this.pair;
sync();
}
/** adds a new half-edge from prev.p2 to p2 */
- public E(E prev, Vert p2) {
+ public E(E prev, Point p) {
+ Vert p2;
+ p2 = pointset.get(p);
+ if (p2 == null) p2 = new Vert(p);
this.p1 = prev.p2;
this.p2 = p2;
this.prev = prev;
this.prev.next = this;
this.pair = new E(q, this, z);
}
+ if (p2.e==null) p2.e = this.pair;
sync();
}
}
}
- private Vert register(Point p) {
- Vert v = pointset.get(p);
- return v==null ? new Vert(p) : v;
- }
public E makeE(Point p1, Point p2) {
Vert v1 = pointset.get(p1);
Vert v2 = pointset.get(p2);
e = v2.getE(v1);
if (e != null) return e;
}
- if (v1 != null) return new E(v1.getFreeIncident(), register(p2));
- if (v2 != null) return new E(v2.getFreeIncident(), register(p1)).pair;
- return new E(register(p1), register(p2));
+ if (v1 != null) return new E(v1.getFreeIncident(), p2);
+ if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
+ return new E(p1, p2);
}
public T newT(Point p1, Point p2, Point p3, Vec norm) {
if (norm != null) {
projects / anneal.git / blobdiff