public static final float EPSILON = (float)0.0001;
public static final Random random = new Random();
- private RTree<T> tris = new RTree<T>();
- private PointSet<Vertex> vertices = new PointSet<Vertex>();
+ private RTree<T> triangles = new RTree<T>();
+ private PointSet<Vertex> vertices = new PointSet<Vertex>();
- public boolean tilemesh = false;
+ public boolean immutableVertices;
public boolean ignorecollision = false;
- public Mesh score_against = null;
- public double score = 0;
+ public Mesh score_against = null;
+ public double score = 0;
+
+ public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
+
+ public void makeVerticesImmutable() { this.immutableVertices = true; }
public float score() { return (float)score; }
public int size() { return vertices.size(); }
public Iterable<Vertex> vertices() { return vertices; }
-
- public Iterator<T> iterator() {
- return tris.iterator();
- }
+ public Iterator<T> iterator() { return triangles.iterator(); }
public void rebindPoints() {
// unbind all points
// Vertexices //////////////////////////////////////////////////////////////////////////////
- public final class Vertex extends HasPoint {
+ /** a vertex in the mesh */
+ public final class Vertex extends HasPoint implements Visitor<T> {
public String toString() { return p.toString(); }
public Point p;
E e; // some edge *leaving* this point
}
public void recomputeFundamentalQuadric() {
- //if (!quadricStale && fundamentalQuadric != null) return;
+ if (!quadricStale && fundamentalQuadric != null) return;
quadricStale = false;
unApplyQuadricToNeighbor();
Matrix m = Matrix.ZERO;
}
public void computeError() {
if (quadric_count == 0) {
- if (!tilemesh) {
+ if (immutableVertices) {
} else if (nearest_in_other_mesh == null) {
if (score_against != null) {
Vertex ne = score_against.nearest(p);
double ang = Math.abs(e.crossAngle());
if (ang > Math.PI) throw new Error();
/*
- if (e.t != null) {
- numaspects++;
- aspects += e.t.aspect()*e.t.aspect();
- }
+ if (e.t != null) {
+ numaspects++;
+ aspects += e.t.aspect()*e.t.aspect();
+ }
*/
float minangle = (float)(Math.PI * 0.8);
/** does NOT update bound pairs! */
public boolean transform(Matrix m) {
+ if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
Point oldp = this.p;
try {
E e = this.e;
do {
/*
- 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;
- }
+ 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;
e = e.pair.next;
} while(e != this.e);
-
- if (!ignorecollision && good) {
-
- tris.range(new Segment(oldp, this.p),
- new Visitor<T>() {
- public void visit(T t) {
- if (!good) return;
- E e = Vertex.this.e;
- do {
- 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; }
- }
- e = e.pair.next;
- } while(e != Vertex.this.e);
- }
- });
-
- /*
- for(T t : Mesh.this) {
- if (!good) break;
- e = this.e;
- do {
- if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; break; }
- if (e.t != null) {
- if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; break; }
- if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; break; }
- if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; break; }
- }
- e = e.pair.next;
- } while(e != this.e);
- }
- */
- }
-
+ if (!ignorecollision && good) triangles.range(oldp, this.p, (Visitor<T>)this);
reComputeErrorAround();
return good;
}
+
+ public void visit(T t) {
+ if (!good) return;
+ E e = Vertex.this.e;
+ do {
+ 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; }
+ }
+ e = e.pair.next;
+ } while(e != Vertex.this.e);
+ }
private boolean good;
public boolean move(Vec v) {
Vertex nearest = score_against.nearest(midpoint());
//if (t==null) return length();
/*
- double ang = Math.abs(crossAngle());
- float minangle = (float)(Math.PI * 0.9);
- if (ang > minangle)
- return 300;
+ double ang = Math.abs(crossAngle());
+ float minangle = (float)(Math.PI * 0.9);
+ if (ang > minangle)
+ return 300;
*/
/*
- if ((length() * length()) / t.area() > 10)
- return (float)(length()*Math.sqrt(t.area()));
- return length()*t.area();
+ if ((length() * length()) / t.area() > 10)
+ return (float)(length()*Math.sqrt(t.area()));
+ return length()*t.area();
*/
return (float)Math.max(length(), midpoint().distance(nearest.p));
//return length();
public final int color;
public final int colorclass;
- public void removeFromRTree() { tris.remove(this); }
- public void addToRTree() { tris.insert(this); }
+ public void removeFromRTree() { triangles.remove(this); }
+ public void addToRTree() { triangles.insert(this); }
- public void destroy() { tris.remove(this); }
+ public void destroy() { triangles.remove(this); }
T(E e1, int colorclass) {
this.e1 = e1;
}
this.color = color;
this.colorclass = colorclass;
- tris.add(this);
+ triangles.add(this);
}
public E e1() { return e1; }
public E e2() { return e1.next; }