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 Mesh error_against = null;
23 public double error = 0;
25 public Mesh(boolean immutableVertices) { this.immutableVertices = immutableVertices; }
27 public void makeVerticesImmutable() { this.immutableVertices = true; }
28 public float error() { return (float)error; }
30 public int size() { return vertices.size(); }
31 public Iterable<Vertex> vertices() { return vertices; }
32 public Iterator<T> iterator() { return triangles.iterator(); }
34 public void rebindPoints() {
36 for(Mesh.T t : this) {
41 // ask edges to re-implement their bindings
42 for(Mesh.T t : this) {
49 public void transform(Matrix m) {
50 ArrayList<Vertex> set = new ArrayList<Vertex>();
51 for(Vertex v : vertices) set.add(v);
52 for(Vertex v : set) v.transform(m.times(v.p), true);
55 public void rebuild() { /*vertices.rebuild();*/ }
56 public Vec diagonal() { return vertices.diagonal(); }
57 public Point centroid() { return vertices.centroid(); }
58 public Vertex nearest(Point p) { return vertices.nearest(p); }
60 /** compute the volume of the mesh */
61 public float volume() {
64 double area = t.area();
65 Vec origin_to_centroid = new Vec(new Point(0, 0, 0), t.centroid());
66 boolean facingAway = t.norm().dot(origin_to_centroid) > 0;
67 double height = Math.abs(t.norm().dot(origin_to_centroid));
68 total += ((facingAway ? 1 : -1) * area * height) / 3.0;
74 // Vertexices //////////////////////////////////////////////////////////////////////////////
76 /** a vertex in the mesh */
77 public final class Vertex extends HasQuadric implements Visitor {
79 E e; // some edge *leaving* this point
81 Matrix binding = Matrix.ONE;
82 Vertex bound_to = this;
83 private boolean illegal = false;
85 public Point getPoint() { return p; }
86 public float error() { return olderror; }
88 private Vertex(Point p) {
90 if (vertices.get(p) != null) throw new Error();
94 public void reinsert() {
95 vertices.remove(this);
97 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.t.reinsert();
100 public float olderror = 0;
101 public void setError(float nerror) {
107 public float averageTriangleArea() {
110 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
116 public float averageEdgeLength() {
119 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
126 public Matrix _recomputeFundamentalQuadric() {
127 Matrix m = Matrix.ZERO;
129 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
130 m = m.plus(e.t.norm().fundamentalQuadric(e.t.centroid()));
133 return m.times(1/(float)count);
136 public HasQuadric nearest() { return error_against==null ? null : error_against.vertices.nearest(p, this); }
137 public void computeError() {
138 if (error_against==null) return;
141 ? (quadric.preAndPostMultiply(p) * 100)/quadric_count
142 : nearest_in_other_mesh != null
143 ? nearest_in_other_mesh.fundamentalQuadric().preAndPostMultiply(p) * 100
144 : nearest().fundamentalQuadric().preAndPostMultiply(p) * 100;
145 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
146 double ang = Math.abs(e.crossAngle());
147 if (ang > Math.PI) throw new Error();
148 float minangle = (float)(Math.PI * 0.8);
149 if (ang > minangle) nerror += (ang - minangle);
151 if (e.t.aspect() < 0.2) {
152 nerror += (0.2-e.t.aspect()) * 300;
159 /** does NOT update bound pairs! */
160 private boolean transform(Point newp, boolean ignoreProblems) {
162 if (immutableVertices) throw new Error();
164 unApplyQuadricToNeighbor();
167 applyQuadricToNeighbor();
169 if (!ignoreProblems) {
173 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) e.p2.quadricStale = true;
177 public void checkLegality() {
178 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
179 if (Math.abs(e.crossAngle()) > (Math.PI * 0.9) ||
180 Math.abs(e.next.crossAngle()) > (Math.PI * 0.9)) illegal = true;
181 //if (e.t.aspect() < 0.1) illegal = true;
183 if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
186 public void reComputeErrorAround() {
188 if (nearest_in_other_mesh != null)
189 nearest_in_other_mesh.reComputeError();
190 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
191 e.p2.reComputeError();
194 public boolean visit(Object o) {
195 if (o instanceof Vertex)
196 return ((Vertex)o).e != null && ((Vertex)o).norm().dot(Vertex.this.norm()) >= 0;
198 if (illegal) return false;
199 for(E e = Vertex.this.e; e!=null; e=e.pair.next==Vertex.this.e?null:e.pair.next) {
200 if (!t.has(e.p1) && !t.has(e.p2) && e.intersects(t)) { illegal = true; }
202 if (!e.t.has(t.e1().p1) && !e.t.has(t.e1().p2) && t.e1().intersects(e.t)) { illegal = true; }
203 if (!e.t.has(t.e2().p1) && !e.t.has(t.e2().p2) && t.e2().intersects(e.t)) { illegal = true; }
204 if (!e.t.has(t.e3().p1) && !e.t.has(t.e3().p2) && t.e3().intersects(e.t)) { illegal = true; }
210 public boolean move(Matrix m, boolean ignoreProblems) {
212 for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
213 good &= p.transform(m.times(p.p), ignoreProblems);
214 for(Vertex p = this; p != null; p = (p.bound_to==this)?null:p.bound_to)
215 if (good || ignoreProblems) p.reComputeErrorAround();
216 else p.transform(p.oldp, true);
220 public E getFreeIncident() {
221 E ret = getFreeIncident(e, e);
222 if (ret != null) return ret;
223 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
224 System.out.println(e + " " + e.t);
225 throw new Error("unable to find free incident to " + this);
228 public E getFreeIncident(E start, E before) {
229 for(E e = start; e!=null; e=e.pair.next==before?null:e.pair.next)
230 if (e.pair.p2 == this && e.pair.t == null && e.pair.next.t == null)
235 public E getE(Point p2) {
236 Vertex v = vertices.get(p2);
237 if (v==null) return null;
240 public E getE(Vertex p2) {
241 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
242 if (e.p1 == this && e.p2 == p2) return e;
246 private void glNormal(GL gl) {
248 gl.glNormal3f(norm.x, norm.y, norm.z);
251 Vec norm = new Vec(0, 0, 0);
252 for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
254 norm = norm.plus(e.t.norm().times((float)e.prev.angle()));
258 public boolean isBoundTo(Vertex p) {
259 for(Vertex px = p; px!=null; px=(px.bound_to==p?null:px.bound_to))
265 public void unbind() { bound_to = this; binding = Matrix.ONE; }
266 public void bind(Vertex p) { bind(p, Matrix.ONE); }
267 public void bind(Vertex p, Matrix binding) {
268 if (isBoundTo(p)) return;
269 Vertex temp_bound_to = p.bound_to;
270 Matrix temp_binding = p.binding;
271 p.bound_to = this.bound_to;
272 p.binding = binding.times(this.binding); // FIXME: may have order wrong here
273 this.bound_to = temp_bound_to;
274 this.binding = temp_binding.times(temp_binding); // FIXME: may have order wrong here
278 public class BindingGroup {
279 private HashSet<E> set = new HashSet<E>();
280 public BindingGroup bind_others;
281 public BindingGroup other() { return bind_others; }
282 public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
283 public BindingGroup() { this.bind_others = new BindingGroup(this); }
284 public BindingGroup(E e) { this(); set.add(e); }
285 public void add(E e) {
286 if (set.contains(e)) return;
288 BindingGroup e_bind_peers = e.bind_peers;
289 BindingGroup e_bind_to = e.bind_to;
291 e.bind_to = bind_others;
292 for (E epeer : e_bind_peers.set) add(epeer);
293 for (E eother : e_bind_to.set) bind_others.add(eother);
295 for(E eother : bind_others.set) {
296 if (e.next.bind_to.set.contains(eother.prev)) {
297 e.next.next.bindEdge(eother.prev.prev);
299 if (e.prev.bind_to.set.contains(eother.next)) {
300 e.prev.prev.bindEdge(eother.next.next);
305 public void dobind(E e) {
306 for(E ebound : set) {
307 e.p1.bind(ebound.p2);
308 e.p2.bind(ebound.p1);
311 public void shatter(BindingGroup bg1, BindingGroup bg2) {
313 e.shatter(e.midpoint(), bg1, bg2);
318 /** [UNIQUE] an edge */
319 public final class E implements Comparable<E> {
321 public final Vertex p1, p2;
322 T t; // triangle to our "left"
323 E prev; // previous half-edge
324 E next; // next half-edge
325 E pair; // partner half-edge
326 public BindingGroup bind_peers = new BindingGroup(this);
327 public BindingGroup bind_to = bind_peers.other();
328 boolean shattered = false;
330 public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
331 public float comparator() {
333 Vertex nearest = error_against.nearest(midpoint());
334 //return (float)Math.max(length(), midpoint().distance(nearest.p));
336 float nearest_distance = midpoint().distance(nearest.p);
337 float other_distance =
338 (p1.p.distance(error_against.nearest(p1.p).p)+
339 p2.p.distance(error_against.nearest(p2.p).p))/2;
340 return nearest_distance/other_distance;
343 return t==null?0:(1/t.aspect());
345 public int compareTo(E e) {
346 return e.comparator() > comparator() ? 1 : -1;
348 public void bindEdge(E e) { bind_to.add(e); }
349 public void dobind() { bind_to.dobind(this); }
351 public Point shatter() { return shatter(midpoint(), null, null); }
352 public Point shatter(Point mid, BindingGroup bg1, BindingGroup bg2) {
353 if (shattered || destroyed) return mid;
360 int old_colorclass = t==null ? 0 : t.colorclass;
361 if (bg1==null) bg1 = new BindingGroup();
362 if (bg2==null) bg2 = new BindingGroup();
363 BindingGroup old_bind_to = bind_to;
364 bind_peers.shatter(bg1, bg2);
365 old_bind_to.shatter(bg2.other(), bg1.other());
369 newT(r.p, p1.p, mid, null, old_colorclass);
370 newT(r.p, mid, p2.p, null, old_colorclass);
371 bg1.add(p1.getE(mid));
372 bg2.add(p2.getE(mid).pair);
376 public boolean destroyed = false;
377 public void destroy() {
378 if (destroyed) return;
380 pair.destroyed = true;
382 if (t != null) t.destroy();
385 if (pair.t != null) pair.t.destroy();
388 if (next.t != null) next.t.destroy();
389 if (prev.t != null) prev.t.destroy();
393 if (pair.next.t != null) pair.next.t.destroy();
394 if (pair.prev.t != null) pair.next.t.destroy();
400 this.bind_peers = null;
401 pair.bind_peers = null;
402 pair.prev.next = next;
403 next.prev = pair.prev;
404 prev.next = pair.next;
406 if (p1.e == this) p1.e = prev.next;
407 if (pair.p1.e == pair) pair.p1.e = pair.prev.next;
410 private void sync() {
411 this.prev.next = this;
412 this.next.prev = this;
413 this.pair.pair = this;
414 bind_peers.add(this);
415 if (this.next.p1 != p2) throw new Error();
416 if (this.prev.p2 != p1) throw new Error();
417 if (this.p1.e == null) this.p1.e = this;
418 if (!added) added = true;
420 private boolean added = false;
422 public T makeT(int colorclass) { return t==null ? (t = new T(this, colorclass)) : t; }
424 public double crossAngle() {
425 Vec v1 = t.norm().times(-1);
426 Vec v2 = pair.t.norm().times(-1);
427 return Math.acos(v1.norm().dot(v2.norm()));
430 /** angle between this half-edge and the next */
431 public double angle() {
432 Vec v1 = next.p2.p.minus(p2.p);
433 Vec v2 = this.p1.p.minus(p2.p);
434 return Math.acos(v1.norm().dot(v2.norm()));
437 public void makeAdjacent(E e) {
438 if (this.next == e) return;
439 if (p2 != e.p1) throw new Error("cannot make adjacent -- no shared vertex");
440 if (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free");
442 E freeIncident = p2.getFreeIncident(e, this);
444 e.prev.next = freeIncident.next;
445 freeIncident.next.prev = e.prev;
447 freeIncident.next = this.next;
448 this.next.prev = freeIncident;
457 /** creates an isolated edge out in the middle of space */
458 public E(Point p1, Point p2) {
459 if (vertices.get(p1) != null) throw new Error();
460 if (vertices.get(p2) != null) throw new Error();
461 this.p1 = new Vertex(p1);
462 this.p2 = new Vertex(p2);
463 this.prev = this.next = this.pair = new E(this, this, this);
465 this.p2.e = this.pair;
469 /** adds a new half-edge from prev.p2 to p2 */
470 public E(E prev, Point p) {
472 p2 = vertices.get(p);
473 if (p2 == null) p2 = new Vertex(p);
477 if (p2.getE(p1) != null) throw new Error();
479 this.next = this.pair = new E(this, this, prev.next);
481 E q = p2.getFreeIncident();
483 this.next.prev = this;
485 this.prev.next = this;
486 this.pair = new E(q, this, z);
488 if (p2.e==null) p2.e = this.pair;
492 /** adds a new half-edge to the mesh with a given predecessor, successor, and pair */
493 public E(E prev, E pair, E next) {
501 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); }
502 public boolean has(Vertex v) { return v==p1 || v==p2; }
503 public float length() { return p1.p.minus(p2.p).mag(); }
504 public String toString() { return p1+"->"+p2; }
508 public E makeE(Point p1, Point p2) {
509 Vertex v1 = vertices.get(p1);
510 Vertex v2 = vertices.get(p2);
511 if (v1 != null && v2 != null) {
513 if (e != null) return e;
515 if (e != null) return e;
517 if (v1 != null) return new E(v1.getFreeIncident(), p2);
518 if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
519 return new E(p1, p2);
521 public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
523 Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
524 float dot = norm.dot(norm2);
525 //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
526 if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
528 E e12 = makeE(p1, p2);
529 E e23 = makeE(p2, p3);
530 E e31 = makeE(p3, p1);
531 while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
532 e12.makeAdjacent(e23);
533 e23.makeAdjacent(e31);
534 e31.makeAdjacent(e12);
536 T ret = e12.makeT(colorclass);
537 if (e12.t == null) throw new Error();
538 if (e23.t == null) throw new Error();
539 if (e31.t == null) throw new Error();
543 /** [UNIQUE] a triangle (face) */
544 public final class T extends Triangle {
546 public final int color;
547 public final int colorclass;
549 T(E e1, int colorclass) {
553 if (e1==e2 || e1==e3) throw new Error();
554 if (e3.next!=e1) throw new Error();
555 if (e1.t!=null || e2.t!=null || e3.t!=null) throw new Error("non-manifold surface or disagreeing normals");
558 e1.next.next.t = this;
560 // FIXME: check for sealed/watertight surface once construction is complete (and infer normal(s)?)
562 int color = Math.abs(random.nextInt());
565 if (e1().pair.t != null && color == e1().pair.t.color) { color++; continue; }
566 if (e2().pair.t != null && color == e2().pair.t.color) { color++; continue; }
567 if (e3().pair.t != null && color == e3().pair.t.color) { color++; continue; }
571 this.colorclass = colorclass;
574 public E e1() { return e1; }
575 public E e2() { return e1.next; }
576 public E e3() { return e1.prev; }
577 public Vertex v1() { return e1.p1; }
578 public Vertex v2() { return e1.p2; }
579 public Vertex v3() { return e1.next.p2; }
580 public Point p1() { return e1.p1.p; }
581 public Point p2() { return e1.p2.p; }
582 public Point p3() { return e1.next.p2.p; }
583 public boolean hasE(E e) { return e1==e || e1.next==e || e1.prev==e; }
584 public boolean has(Vertex v) { return v1()==v || v2()==v || v3()==v; }
586 public void removeFromRTree() { triangles.remove(this); }
587 public void addToRTree() { triangles.insert(this); }
588 public void destroy() { triangles.remove(this); }
589 public void reinsert() { triangles.remove(this); triangles.add(this); }
591 public boolean shouldBeDrawn() {
592 if (e1().bind_to.set.size() == 0) return false;
593 if (e2().bind_to.set.size() == 0) return false;
594 if (e3().bind_to.set.size() == 0) return false;