- public boolean intersects(T t) {
- double A0=t.v1().p.x, A1=t.v1().p.y, A2=t.v1().p.z;
- double B0=t.v2().p.x, B1=t.v2().p.y, B2=t.v2().p.z;
- double C0=t.v3().p.x, C1=t.v3().p.y, C2=t.v3().p.z;
- double j0=p1.p.x, j1=p1.p.y, j2=p1.p.z;
- double k0=p2.p.x, k1=p2.p.y, k2=p2.p.z;
+ }
+
+ public E makeE(Point p1, Point p2) {
+ Vert v1 = vertices.get(p1);
+ Vert v2 = vertices.get(p2);
+ if (v1 != null && v2 != null) {
+ E e = v1.getE(v2);
+ if (e != null) return e;
+ e = v2.getE(v1);
+ if (e != null) return e;
+ }
+ if (v1 != null) return new E(v1.getFreeIncident(), p2);
+ if (v2 != null) return new E(v2.getFreeIncident(), p1).pair;
+ return new E(p1, p2);
+ }
+ public T newT(Point p1, Point p2, Point p3, Vec norm, int colorclass) {
+ if (norm != null) {
+ Vec norm2 = p3.minus(p1).cross(p2.minus(p1));
+ float dot = norm.dot(norm2);
+ //if (Math.abs(dot) < EPointSILON) throw new Error("dot products within evertsilon of each other: "+norm+" "+norm2);
+ if (dot < 0) { Point p = p1; p1=p2; p2 = p; }
+ }
+ E e12 = makeE(p1, p2);
+ E e23 = makeE(p2, p3);
+ E e31 = makeE(p3, p1);
+ while(e12.next != e23 || e23.next != e31 || e31.next != e12) {
+ e12.makeAdjacent(e23);
+ e23.makeAdjacent(e31);
+ e31.makeAdjacent(e12);
+ }
+ T ret = e12.makeT(colorclass);
+ if (e12.t == null) throw new Error();
+ if (e23.t == null) throw new Error();
+ if (e31.t == null) throw new Error();
+ return ret;
+ }
+
+
+ public class FaceIterator implements Iterator<T> {
+ private HashSet<T> visited = new HashSet<T>();
+ private LinkedList<T> next = new LinkedList<T>();
+ public FaceIterator() { }
+ public FaceIterator(Vert v) { next.addFirst(v.e.t); }
+ public boolean hasNext() { return next.peek()!=null; }
+ public void remove() { throw new Error(); }
+ public T next() {
+ T ret = next.removeFirst();
+ if (ret == null) return null;
+ visited.add(ret);
+ T t1 = ret.e1().pair.t;
+ T t2 = ret.e2().pair.t;
+ T t3 = ret.e3().pair.t;
+ if (t1 != null && !visited.contains(t1)) next.addFirst(t1);
+ if (t2 != null && !visited.contains(t2)) next.addFirst(t2);
+ if (t3 != null && !visited.contains(t3)) next.addFirst(t3);
+ return ret;
+ }
+ }
+
+ /** [UNIQUE] a triangle (face) */
+ public final class T extends Triangle {
+ public final E e1;
+ public final int color;
+ public final int colorclass;
+
+ public boolean intersects(Point p1, Point p2) {
+ double A0=v1().p.x, A1=v1().p.y, A2=v1().p.z;
+ double B0=v2().p.x, B1=v2().p.y, B2=v2().p.z;
+ double C0=v3().p.x, C1=v3().p.y, C2=v3().p.z;
+ double j0=p1.x, j1=p1.y, j2=p1.z;
+ double k0=p2.x, k1=p2.y, k2=p2.z;