/** a vertex in the mesh */
public final class Vertex extends HasQuadric implements Visitor {
- public Point p, oldp;
+ public Point p, oldp, goodp;
E e; // some edge *leaving* this point
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; }
private Vertex(Point p) {
this.p = p;
+ this.goodp = p;
if (vertices.get(p) != null) throw new Error();
vertices.add(this);
}
- public void reinsert() { vertices.remove(this); 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;
}
+ public float averageTriangleArea() {
+ int count = 0;
+ float ret = 0;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+ ret += e.t.area();
+ count++;
+ }
+ return ret/count;
+ }
+ public float averageEdgeLength() {
+ int count = 0;
+ float ret = 0;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+ ret += e.length();
+ count++;
+ }
+ return ret/count;
+ }
+
public Matrix _recomputeFundamentalQuadric() {
Matrix m = Matrix.ZERO;
int count = 0;
public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
public void computeError() {
+ if (error_against==null) return;
float nerror =
- quadric_count != 0
- ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
- : nearest_in_other_mesh != null
- ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
- : error_against != null
- ? nearest().fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
- : 0;
+ nearest_in_other_mesh != null
+ ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p)
+ : nearest().fundamentalQuadric().preAndPostMultiply(p);
+ if (quadric_count != 0)
+ nerror = (nerror + quadric.preAndPostMultiply(p))/(quadric_count+1);
+
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
- double ang = Math.abs(e.crossAngle());
+ double ang = Math.abs(e.dihedralAngle());
if (ang > Math.PI) throw new Error();
float minangle = (float)(Math.PI * 0.8);
if (ang > minangle) nerror += (ang - minangle);
+ /*
+ if (e.t.aspect() < 0.2) {
+ nerror += (0.2-e.t.aspect()) * 10;
+ }
+ */
}
+
setError(nerror);
}
+ public boolean move(Matrix m, boolean ignoreProblems) {
+ boolean good = true;
+ 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 || ignoreProblems) p.reComputeErrorAround();
+ else p.transform(p.oldp, true);
+ return good;
+ }
+
/** does NOT update bound pairs! */
private boolean transform(Point newp, boolean ignoreProblems) {
this.oldp = this.p;
if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
-
this.p = newp;
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
reinsert();
-
applyQuadricToNeighbor();
- if (ignoreProblems) return true;
+ if (!ignoreProblems) {
+ illegal = false;
+ checkLegality();
+ }
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.p2.quadricStale = true;
+ return !illegal;
+ }
- good = true;
+ 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)) good = false;
- if (e.t.aspect() < 0.1) good = false;
- e.p2.quadricStale = true;
+ if (Math.abs(e.dihedralAngle()) > (Math.PI * 0.9) ||
+ Math.abs(e.next.dihedralAngle()) > (Math.PI * 0.9)) illegal = true;
+ if (e.t.aspect() < 0.1) illegal = true;
}
- if (good) triangles.range(oldp, this.p, (Visitor<T>)this);
- return good;
+ */
+ if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
public void reComputeErrorAround() {
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;
- }
-
- public boolean move(Matrix m, boolean ignoreProblems) {
- boolean good = true;
- 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 || ignoreProblems) p.reComputeErrorAround();
- else p.transform(p.oldp, true);
- return good;
+ return !illegal;
}
public E getFreeIncident() {
e.p2.bind(ebound.p1);
}
}
- public void shatter(BindingGroup bg1, BindingGroup bg2) {
+ public void shatter(BindingGroup bg1, BindingGroup bg2, boolean triangles) {
for(E e : set) {
- e.shatter(e.midpoint(), bg1, bg2);
+ e.shatter(e.midpoint(), bg1, bg2, triangles);
}
}
}
boolean shattered = false;
public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
- public float comparator() {
+
+ public float stretchRatio() {
Vertex nearest = error_against.nearest(midpoint());
- return (float)Math.max(length(), midpoint().distance(nearest.p));
+ float nearest_distance = midpoint().distance(nearest.p);
+ float other_distance =
+ (p1.p.distance(error_against.nearest(p1.p).p)+
+ p2.p.distance(error_against.nearest(p2.p).p))/2;
+ return nearest_distance/other_distance;
+ }
+ public float comparator() {
+
+
+ return length();
+ //return t==null?0:(1/t.aspect());
}
public int compareTo(E e) {
return e.comparator() > comparator() ? 1 : -1;
public void bindEdge(E e) { bind_to.add(e); }
public void dobind() { bind_to.dobind(this); }
- public Point shatter() { return shatter(midpoint(), null, null); }
- public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
+ public Point shatter() { return shatter(true); }
+ public Point shatter(boolean triangles) { return shatter(midpoint(), null, null, triangles); }
+ public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2, boolean triangles) {
if (shattered || destroyed) return mid;
shattered = true;
if (bg1==null) bg1 = new BindingGroup();
if (bg2==null) bg2 = new BindingGroup();
BindingGroup old_bind_to = bind_to;
- bind_peers.shatter(bg1, bg2);
- old_bind_to.shatter(bg2.other(), bg1.other());
+ bind_peers.shatter(bg1, bg2, triangles);
+ old_bind_to.shatter(bg2.other(), bg1.other(), triangles);
+ if (!triangles) {
+ next.shatter(false);
+ prev.shatter(false);
+ }
pair.shatter();
destroy();
- newT(r.p, p1.p, mid, null, old_colorclass);
- newT(r.p, mid, p2.p, null, old_colorclass);
- bg1.add(p1.getE(mid));
- bg2.add(p2.getE(mid).pair);
+ if (triangles) {
+ newT(r.p, p1.p, mid, null, old_colorclass);
+ newT(r.p, mid, p2.p, null, old_colorclass);
+ bg1.add(p1.getE(mid));
+ bg2.add(p2.getE(mid).pair);
+ }
return mid;
}
public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
- public double crossAngle() {
+ public double dihedralAngle() {
Vec v1 = t.norm().times(-1);
Vec v2 = pair.t.norm().times(-1);
return Math.acos(v1.norm().dot(v2.norm()));
return true;
}
+ /** issue gl.glVertex() for each of the triangle's points */
+ public void glVertices(GL gl) {
+ if (!shouldBeDrawn()) return;
+ norm().glNormal(gl);
+ Point p1 = v1().goodp;
+ Point p2 = v2().goodp;
+ Point p3 = v3().goodp;
+ p1.glVertex(gl);
+ p2.glVertex(gl);
+ p3.glVertex(gl);
+ }
+
}
}
projects / anneal.git / blobdiff