1 package edu.berkeley.qfat;
4 import java.awt.event.*;
6 import javax.media.opengl.*;
7 import javax.media.opengl.glu.*;
8 import edu.berkeley.qfat.geom.*;
9 import edu.wlu.cs.levy.CG.KDTree;
10 import edu.berkeley.qfat.geom.Point;
11 import com.infomatiq.jsi.IntProcedure;
13 public class Mesh implements Iterable<Mesh.T> {
15 public static final float EPSILON = (float)0.0001;
16 public static final Random random = new Random();
18 private RTree<T> triangles = new RTree<T>();
19 private PointSet<Vertex> vertices = new PointSet<Vertex>();
21 public boolean immutableVertices;
22 public boolean ignorecollision = false;
23 public Mesh error_against = null;
24 public double error = 0;
26 public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
28 public void makeVerticesImmutable() { this.immutableVertices = true; }
29 public float error() { return (float)error; }
31 public int size() { return vertices.size(); }
32 public Iterable<Vertex> vertices() { return vertices; }
33 public Iterator<T> iterator() { return triangles.iterator(); }
35 public void rebindPoints() {
37 for(Mesh.T t : this) {
42 // ask edges to re-implement their bindings
43 for(Mesh.T t : this) {
50 public void transform(Matrix m) {
51 ArrayList<Vertex> set = new ArrayList<Vertex>();
52 for(Vertex v : vertices) set.add(v);
53 for(Vertex v : set) v.transform(m.times(v.p), true);
56 public void rebuild() { /*vertices.rebuild();*/ }
57 public Vec diagonal() { return vertices.diagonal(); }
58 public Point centroid() { return vertices.centroid(); }
59 public Vertex nearest(Point p) { return vertices.nearest(p); }
61 /** compute the volume of the mesh */
62 public float volume() {
65 double area = t.area();
66 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
67 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
68 double height = Math.abs(t.norm().dot(origin_to_centroid));
69 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
75 // Vertexices //////////////////////////////////////////////////////////////////////////////
77 /** a vertex in the mesh */
78 public final class Vertex extends HasQuadric implements Visitor {
80 E e; // some edge *leaving* this point
82 Matrix binding = Matrix.ONE;
83 Vertex bound_to = this;
86 public Point getPoint() { return p; }
87 public float error() { return olderror; }
89 private Vertex(Point p) {
91 if (vertices.get(p) != null) throw new Error();
95 public float olderror = 0;
96 public void setError(float nerror) {
102 public Matrix _recomputeFundamentalQuadric() {
103 Matrix m = Matrix.ZERO;
105 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
106 m = m.plus(e.t.norm().fundamentalQuadric(e.t.centroid()));
109 return m.times(1/(float)count);
112 public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
113 public void computeError() {
116 ? (quadric.preAndPostMultiply(p) * 100) / quadric_count
117 : nearest_in_other_mesh != null
118 ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
119 : error_against != null
120 ? nearest().fundamentalQuadric().preAndPostMultiply(p) * 100 * 10
122 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
123 double ang = Math.abs(e.crossAngle());
124 if (ang > Math.PI) throw new Error();
125 float minangle = (float)(Math.PI * 0.8);
126 if (ang > minangle) nerror += (ang - minangle);
131 /** does NOT update bound pairs! */
132 private boolean transform(Point newp, boolean ignoreProblems) {
134 if (immutableVertices) throw new Error();
136 unApplyQuadricToNeighbor();
138 if (vertices.get(this.p)==null) throw new Error();
139 vertices.remove(this);
140 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
141 if (e.t != null) e.t.removeFromRTree();
143 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
144 if (e.t != null) e.t.addToRTree();
147 applyQuadricToNeighbor();
152 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
153 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) || Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) good = false;
154 if (e.t.aspect() < 0.1) good = false;
155 e.p2.quadricStale = true;
158 if (!ignorecollision && !ignoreProblems && good)
159 triangles.range(oldp, this.p, (Visitor<T>)this);
164 public void reComputeErrorAround() {
166 if (nearest_in_other_mesh != null)
167 nearest_in_other_mesh.reComputeError();
169 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
170 e.p2.reComputeError();
174 public boolean visit(Object o) {
175 if (o instanceof Vertex)
176 return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
178 if (!good) return false;
179 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
180 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { good = false; }
182 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { good = false; }
183 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { good = false; }
184 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { good = false; }
190 public boolean move(Matrix m, boolean ignoreProblems) {
192 for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
193 good &= p.transform(m.times(p.p), ignoreProblems);
194 for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
195 if (good || ignoreProblems) p.reComputeErrorAround();
196 else p.transform(p.oldp, true);
200 public E getFreeIncident() {
201 E ret = getFreeIncident(e, e);
202 if (ret != null) return ret;
203 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
204 System.out.println(e + " " + e.t);
205 throw new Error("unable to find free incident to " + this);
208 public E getFreeIncident(E start, E before) {
209 for(E e = start; e!=null; e=e.pair.next==before?null:e.pair.next)
210 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null)
215 public E getE(Point p2) {
216 Vertex v = vertices.get(p2);
217 if (v==null) return null;
220 public E getE(Vertex p2) {
221 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
222 if (e.p1 == this && e.p2 == p2) return e;
226 private void glNormal(GL gl) {
228 gl.glNormal3f(norm.x, norm.y, norm.z);
231 Vec norm = new Vec(0, 0, 0);
232 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
234 norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
238 public boolean isBoundTo(Vertex p) {
239 for(Vertex px = p; px!=null; px=(px.bound_to==p?null:px.bound_to))
245 public void unbind() { bound_to = this; binding = Matrix.ONE; }
246 public void bind(Vertex p) { bind(p, Matrix.ONE); }
247 public void bind(Vertex p, Matrix binding) {
248 if (isBoundTo(p)) return;
249 Vertex temp_bound_to = p.bound_to;
250 Matrix temp_binding = p.binding;
251 p.bound_to = this.bound_to;
252 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
253 this.bound_to = temp_bound_to;
254 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
258 public class BindingGroup {
259 private HashSet<E> set = new HashSet<E>();
260 public BindingGroup bind_others;
261 public BindingGroup other() { return bind_others; }
262 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
263 public BindingGroup() { this.bind_others = new BindingGroup(this); }
264 public BindingGroup(E e) { this(); set.add(e); }
265 public void add(E e) {
266 if (set.contains(e)) return;
268 BindingGroup e_bind_peers = e.bind_peers;
269 BindingGroup e_bind_to = e.bind_to;
271 e.bind_to = bind_others;
272 for (E epeer : e_bind_peers.set) add(epeer);
273 for (E eother : e_bind_to.set) bind_others.add(eother);
275 for(E eother : bind_others.set) {
276 if (e.next.bind_to.set.contains(eother.prev)) {
277 e.next.next.bindEdge(eother.prev.prev);
279 if (e.prev.bind_to.set.contains(eother.next)) {
280 e.prev.prev.bindEdge(eother.next.next);
285 public void dobind(E e) {
286 for(E ebound : set) {
287 e.p1.bind(ebound.p2);
288 e.p2.bind(ebound.p1);
291 public void shatter(BindingGroup bg1, BindingGroup bg2) {
293 e.shatter(e.midpoint(), bg1, bg2);
298 /** [UNIQUE] an edge */
299 public final class E implements Comparable<E> {
301 public final Vertex p1, p2;
302 T t; // triangle to our "left"
303 E prev; // previous half-edge
304 E next; // next half-edge
305 E pair; // partner half-edge
306 public BindingGroup bind_peers = new BindingGroup(this);
307 public BindingGroup bind_to = bind_peers.other();
308 boolean shattered = false;
310 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
311 public float comparator() {
312 Vertex nearest = error_against.nearest(midpoint());
313 return (float)Math.max(length(), midpoint().distance(nearest.p));
315 public int compareTo(E e) {
316 return e.comparator() > comparator() ? 1 : -1;
318 public void bindEdge(E e) { bind_to.add(e); }
319 public void dobind() { bind_to.dobind(this); }
321 public Point shatter() { return shatter(midpoint(), null, null); }
322 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
323 if (shattered || destroyed) return mid;
330 int old_colorclass = t==null ? 0 : t.colorclass;
331 if (bg1==null) bg1 = new BindingGroup();
332 if (bg2==null) bg2 = new BindingGroup();
333 BindingGroup old_bind_to = bind_to;
334 bind_peers.shatter(bg1, bg2);
335 old_bind_to.shatter(bg2.other(), bg1.other());
339 newT(r.p, p1.p, mid, null, old_colorclass);
340 newT(r.p, mid, p2.p, null, old_colorclass);
341 bg1.add(p1.getE(mid));
342 bg2.add(p2.getE(mid).pair);
346 public boolean destroyed = false;
347 public void destroy() {
348 if (destroyed) return;
350 pair.destroyed = true;
352 if (t != null) t.destroy();
355 if (pair.t != null) pair.t.destroy();
358 if (next.t != null) next.t.destroy();
359 if (prev.t != null) prev.t.destroy();
363 if (pair.next.t != null) pair.next.t.destroy();
364 if (pair.prev.t != null) pair.next.t.destroy();
370 this.bind_peers = null;
371 pair.bind_peers = null;
372 pair.prev.next = next;
373 next.prev = pair.prev;
374 prev.next = pair.next;
376 if (p1.e == this) p1.e = prev.next;
377 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
380 private void sync() {
381 this.prev.next = this;
382 this.next.prev = this;
383 this.pair.pair = this;
384 bind_peers.add(this);
385 if (this.next.p1 != p2) throw new Error();
386 if (this.prev.p2 != p1) throw new Error();
387 if (this.p1.e == null) this.p1.e = this;
388 if (!added) added = true;
390 private boolean added = false;
392 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
394 public double crossAngle() {
395 Vec v1 = t.norm().times(-1);
396 Vec v2 = pair.t.norm().times(-1);
397 return Math.acos(v1.norm().dot(v2.norm()));
400 /** angle between this half-edge and the next */
401 public double angle() {
402 Vec v1 = next.p2.p.minus(p2.p);
403 Vec v2 = this.p1.p.minus(p2.p);
404 return Math.acos(v1.norm().dot(v2.norm()));
407 public void makeAdjacent(E e) {
408 if (this.next == e) return;
409 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
410 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
412 E freeIncident = p2.getFreeIncident(e, this);
414 e.prev.next = freeIncident.next;
415 freeIncident.next.prev = e.prev;
417 freeIncident.next = this.next;
418 this.next.prev = freeIncident;
427 /** creates an isolated edge out in the middle of space */
428 public E(Point p1, Point p2) {
429 if (vertices.get(p1) != null) throw new Error();
430 if (vertices.get(p2) != null) throw new Error();
431 this.p1 = new Vertex(p1);
432 this.p2 = new Vertex(p2);
433 this.prev = this.next = this.pair = new E(this, this, this);
435 this.p2.e = this.pair;
439 /** adds a new half-edge from prev.p2 to p2 */
440 public E(E prev, Point p) {
442 p2 = vertices.get(p);
443 if (p2 == null) p2 = new Vertex(p);
447 if (p2.getE(p1) != null) throw new Error();
449 this.next = this.pair = new E(this, this, prev.next);
451 E q = p2.getFreeIncident();
453 this.next.prev = this;
455 this.prev.next = this;
456 this.pair = new E(q, this, z);
458 if (p2.e==null) p2.e = this.pair;
462 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
463 public E(E prev, E pair, E next) {
471 public Point midpoint() { return new Point((p1.p.x+p2.p.x)/2, (p1.p.y+p2.p.y)/2, (p1.p.z+p2.p.z)/2); }
472 public boolean has(Vertex v) { return v==p1 || v==p2; }
473 public float length() { return p1.p.minus(p2.p).mag(); }
474 public String toString() { return p1+"->"+p2; }
478 public E makeE(Point p1, Point p2) {
479 Vertex v1 = vertices.get(p1);
480 Vertex v2 = vertices.get(p2);
481 if (v1 != null && v2 != null) {
483 if (e != null) return e;
485 if (e != null) return e;
487 if (v1 != null) return new E(v1.getFreeIncident(), p2);
488 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
489 return new E(p1, p2);
491 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
493 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
494 float dot = norm.dot(norm2);
495 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
496 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
498 E e12 = makeE(p1, p2);
499 E e23 = makeE(p2, p3);
500 E e31 = makeE(p3, p1);
501 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
502 e12.makeAdjacent(e23);
503 e23.makeAdjacent(e31);
504 e31.makeAdjacent(e12);
506 T ret = e12.makeT(colorclass);
507 if (e12.t == null) throw new Error();
508 if (e23.t == null) throw new Error();
509 if (e31.t == null) throw new Error();
514 /** [UNIQUE] a triangle (face) */
515 public final class T extends Triangle {
517 public final int color;
518 public final int colorclass;
520 public void removeFromRTree() { triangles.remove(this); }
521 public void addToRTree() { triangles.insert(this); }
523 public void destroy() { triangles.remove(this); }
525 T(E e1, int colorclass) {
529 if (e1==e2 || e1==e3) throw new Error();
530 if (e3.next!=e1) throw new Error();
531 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
534 e1.next.next.t = this;
536 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
538 int color = Math.abs(random.nextInt());
541 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
542 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
543 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
547 this.colorclass = colorclass;
550 public E e1() { return e1; }
551 public E e2() { return e1.next; }
552 public E e3() { return e1.prev; }
553 public Vertex v1() { return e1.p1; }
554 public Vertex v2() { return e1.p2; }
555 public Vertex v3() { return e1.next.p2; }
556 public Point p1() { return e1.p1.p; }
557 public Point p2() { return e1.p2.p; }
558 public Point p3() { return e1.next.p2.p; }
559 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
560 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
562 public boolean shouldBeDrawn() {
563 if (e1().bind_to.set.size() == 0) return false;
564 if (e2().bind_to.set.size() == 0) return false;
565 if (e3().bind_to.set.size() == 0) return false;