import edu.berkeley.qfat.geom.Point;
import com.infomatiq.jsi.IntProcedure;
+// EDGES RUN COUNTER-CLOCKWISE
+
public class Mesh implements Iterable<Mesh.T> {
public static final float EPSILON = (float)0.0001;
(float)(0.25+(0.05*t.color)),
(float)(0.75+(0.05*t.color)),
(float)0.3);
+ if (t.red) {
+ gl.glColor4f((float)(0.75+(0.05*t.color)),
+ (float)(0.25+(0.05*t.color)),
+ (float)(0.25+(0.05*t.color)),
+ (float)0.3);
+ }
t.glTriangle(gl, m);
}
if (option_errorNormals)
public void subdivide() {
- for (T t : this) t.old = true;
for (Vertex v : vertices()) v.original = true;
+ HashSet<E> edges = new HashSet<E>();
+ HashSet<E> flip = new HashSet<E>();
+ HashSet<T> tris = new HashSet<T>();
+ int count = 0;
+ for (T t : this) {
+ tris.add(t);
+ edges.add(t.e1());
+ edges.add(t.e2());
+ edges.add(t.e3());
+ count++;
+ }
+ System.out.println("triangles="+count);
+ count = 0;
+ for(E e : edges) {
+ if (e.destroyed || e.shattered) continue;
+ e.shatter().edge = true;
+ for(E ex : (Iterable<E>)e.getBoundPeers()) {
+ Vertex m = nearest(ex.midpoint());
+ m.edge = true;
+ E e3 = ex.p1.getE(m).next;
+ if (e3.p2.original)
+ flip.add(e3);
+ }
+ }
+
+ int i=0;
+ for(E e : flip) {
+ e.flip();
+ System.out.println("flip!");
+ i++;
+ //if (i>2) break;
+ }
+ System.out.println("count="+count);
+ /*
+ for (E e : flip) {
+ if (e.p1.original && !e.p2.face && !e.p2.original) e.flip();
+ else if (e.p2.original && !e.p1.face && !e.p1.original) e.flip();
+ }
+ HashSet<Vertex> verts = new HashSet<Vertex>();
+ for(Vertex v : vertices()) verts.add(v);
+ for(Vertex v : verts) {
+ if (!v.face) continue;
+ //v.move(v.recenter().minus(v.getPoint()), false);
+ }
+ */
+
+ /*
Queue<T> q = new LinkedList<T>();
OUTER: while(true) {
for (T t : this) {
}
break;
}
- /*
- while(q.size()>0) {
- T t = q.remove();
- if (!t.old || t.destroyed()) continue;
- E te = t.e1;
- T to = t.e1.pair.t;
- if (!t
- q.add(t.e1().pair.t);
- q.add(t.e2().pair.t);
- q.add(t.e3().pair.t);
- q.add(to.e1().pair.t);
- q.add(to.e2().pair.t);
- q.add(to.e3().pair.t);
- Point p = te.midpoint();
- Point c = t.centroid();
- Vertex v1 = t.getOtherVertex(te);
- Vertex v2 = te.pair.t.getOtherVertex(te.pair);
- System.out.println("shatter " + te);
- te.shatter();
- Vertex v = nearest(p);
- v.move(c.minus(v.getPoint()), false);
- v.edge = true;
- v1.getE(p).shatter();
- v2.getE(p).shatter();
- }
*/
/*
for (Vertex v : vertices())
public boolean original = false;
public boolean edge = false;
+ public boolean face = false;
private boolean illegal = false;
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
}
+ // the average of all adjacent points
+ public Point recenter() {
+ int count = 0;
+ Vec vec = Vec.ZERO;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
+ vec = vec.plus(e.getOther(this).getPoint().minus(Point.ZERO));
+ count++;
+ }
+ return Point.ZERO.plus(vec.div(count));
+ }
+
public float olderror = 0;
public void setError(float nerror) {
error -= olderror;
//System.out.println(m.minus(m2));
}
*/
- pp = getConstraint().times(pp);
+ //pp = getConstraint().times(pp);
}
- pp = pp.minus(op).norm().times(vv.mag()).plus(op);
+ //pp = pp.minus(op).norm().times(vv.mag()).plus(op);
ok = false;
Point pt = pp;
for(Vertex v : (Iterable<Vertex>)getBoundPeers()) {
return getE(v);
}
public E getE(Vertex p2) {
- for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
+ if (this.e!=null && this!=this.e.p1 && this!=this.e.p2) throw new RuntimeException();
+ int i=0;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
if (e.p1 == this && e.p2 == p2) return e;
+ i++;
+ e.sanity();
+ if (e.destroyed) throw new RuntimeException();
+ }
return null;
}
/** [UNIQUE] an edge */
public final class E extends HasBindingGroup implements Comparable<E> {
+ public void sanity() {
+ if (destroyed) return;
+ if (pair!=null && (pair.p1!=p2 || pair.p2!=p1)) throw new RuntimeException();
+ if (next!=null && next.p1!=p2) throw new RuntimeException();
+ if (prev!=null && prev.p2!=p1) throw new RuntimeException();
+ }
+
public final Vertex p1, p2;
T t; // triangle to our "left"
E prev; // previous half-edge
public Segment getSegment() { return new Segment(p1.getPoint(), p2.getPoint()); }
+ public void flip() {
+ // FIXME: coplanarity check needed
+ if (destroyed) return;
+ for (E e : (Iterable<E>)getBoundPeers()) {
+ if (!e.pair.isBoundTo(pair)) throw new RuntimeException("cannot flip!");
+ }
+ Vertex v1 = t.getOtherVertex(this);
+ Vertex v2 = pair.t.getOtherVertex(pair);
+ destroy();
+ pair.destroy();
+ newT(v1, v2, p2).red = true;
+ newT(v2, v1, p1).red = true;
+ for (E e : (Iterable<E>)getBoundPeers()) {
+ if (e.destroyed) continue;
+ Vertex v1e = e.t.getOtherVertex(e);
+ Vertex v2e = e.pair.t.getOtherVertex(e.pair);
+ e.destroy();
+ e.pair.destroy();
+ if (v1e.getE(v2e)!=null) throw new RuntimeException();
+ newT(v1e, v2e, e.p2).red = true;
+ newT(v2e, v1e, e.p1).red = true;
+ makeE(v1.getPoint(),
+ v2.getPoint()).bindTo(this.getBindingMatrix(e), makeE(v1e.getPoint(), v2e.getPoint()));
+ makeE(v2.getPoint(),
+ v1.getPoint()).bindTo(pair.getBindingMatrix(e.pair), makeE(v2e.getPoint(), v1e.getPoint()));
+
+ }
+ }
+
public void bindingGroupChanged(edu.berkeley.qfat.geom.BindingGroup newBindingGroup_) {
edu.berkeley.qfat.geom.BindingGroup<E> newBindingGroup =
}
}
- public Point shatter() {
- if (shattered || destroyed) return null;
+ public Vertex shatter() {
+ if (shattered || destroyed) return nearest(midpoint());
shattered = true;
E first = null;
E firste = null;
first.setConstraint(firste.getConstraint());
firstq.setConstraint(firste.getConstraint());
*/
- return null;
+ return nearest(midpoint());
}
public boolean destroyed = false;
pair.next.t = null;
pair.prev.t = null;
+ if (next.destroyed) throw new RuntimeException();
+ if (prev.destroyed) throw new RuntimeException();
pair.prev.next = next;
next.prev = pair.prev;
prev.next = pair.next;
pair.next = prev;
+
if (p1.e == this) p1.e = prev.next;
if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
+ if (p2.e == this) throw new RuntimeException();
+ if (pair.p2.e == pair) throw new RuntimeException();
+
+ sanity();
+ next.sanity();
+ prev.sanity();
+ pair.sanity();
}
private void sync() {
public void makeAdjacent(E e) {
if (this.next == e) return;
- if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
- if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free ");
+ if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex: " + this + " " + e);
+ if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free " + t + " " + e.t);
E freeIncident = p2.getFreeIncident(e, this);
this.p1 = prev.p2;
this.p2 = p2;
this.prev = prev;
+ if (prev.destroyed) throw new RuntimeException();
if (p2.getE(p1) != null) throw new Error();
if (p2.e==null) {
this.next = this.pair = new E(this, this, prev.next);
public E(E prev, E pair, E next) {
this.p1 = prev.p2;
this.p2 = next.p1;
+ if (prev.destroyed) throw new RuntimeException();
this.prev = prev;
this.next = next;
this.pair = pair;
public final int color;
public final int colorclass;
+ public boolean red = false;
public boolean old = false;
public final int serial = max_serial++;