import java.util.*;
import edu.berkeley.qfat.geom.*;
import edu.berkeley.qfat.geom.Point;
+import edu.berkeley.qfat.geom.Polygon;
// TO DO:
// - real anneal
*/
+/*
+
+
+ */
+
// FIXME: re-orient goal (how?)
/** magnification factor */
private static final float MAG = 1;
- public static final float MATCHING_EPSILON = 0.01f;
+ public static final float MATCHING_EPSILON = 0.0001f;
+
+ public void generateTile(Matrix[] matrices, Mesh mesh) {
+ HashSet<HalfSpace> halfSpaces = new HashSet<HalfSpace>();
+ HashSet<Polygon> polygons = new HashSet<Polygon>();
+ for(Matrix m : matrices) {
+ Vec v = m.getTranslationalComponent();
+ if (v.mag() < 0.0001) continue;
+ v = v.times(0.5f);
+ Point p = Point.ORIGIN.plus(v);
+ HalfSpace hs = new HalfSpace(p, Point.ORIGIN.minus(p).norm());
+ halfSpaces.add(hs);
+ polygons.add(new Polygon(hs));
+ }
+ for(Polygon p : polygons) {
+ System.out.println(p.plane.norm + " " + p.plane.dvalue);
+ for(HalfSpace hs : halfSpaces) {
+ if (p.plane==hs) continue;
+ p = p.intersect(hs);
+ }
+ p.tesselate(mesh);
+ }
+ }
+
+ private void quad(Mesh mesh, Matrix m, Point p1_, Point p2_, Point p3_, Point p4_) {
+ Point p1 = m.times(p1_);
+ Point p2 = m.times(p2_);
+ Point p3 = m.times(p3_);
+ Point p4 = m.times(p4_);
+ Point c = new Point((p1.x+p2.x+p3.x+p4.x)/4,
+ (p1.y+p2.y+p3.y+p4.y)/4,
+ (p1.z+p2.z+p3.z+p4.z)/4);
+ mesh.newT(p1, p2, c, null, 0);
+ mesh.newT(p2, p3, c, null, 0);
+ mesh.newT(p3, p4, c, null, 0);
+ mesh.newT(p4, p1, c, null, 0);
+ }
public Main(StlFile stlf, Frame f) {
super(f);
}
// rotate to align major axis -- this probably needs to be done by a human.
- goal.transform(Matrix.rotate(new Vec(0, 0, 1), (float)(Math.PI/2)));
+ //goal.transform(Matrix.rotate(new Vec(0, 0, 1), (float)(Math.PI/2)));
+ goal.transform(Matrix.rotate(new Vec(0, 1, 0), (float)(Math.PI/2)));
float goal_width = goal.diagonal().dot(new Vec(1, 0, 0));
float goal_height = goal.diagonal().dot(new Vec(0, 1, 0));
float height = (float)0.08;
float depth = (float)0.3;
*/
+
float width = (float)0.7;
float depth = (float)0.08;
float height = (float)0.4;
float halfup = 0;
translations = new Matrix[] {
- /*
- Matrix.translate(new Vec(lshift, depth, halfup)),
- Matrix.translate(new Vec(rshift, depth, halfup)),
- Matrix.translate(new Vec(lshift, -depth, halfup)),
- Matrix.translate(new Vec(rshift, -depth, halfup)),
- */
+
+ //Matrix.translate(new Vec(lshift, depth, 0)),
+ //Matrix.translate(new Vec(rshift, depth, 0)),
+ //Matrix.translate(new Vec(lshift, -depth, 0)),
+ //Matrix.translate(new Vec(rshift, -depth, 0)),
//Matrix.translate(new Vec(0, depth, 0)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
//Matrix.translate(new Vec(0, -depth, 0)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+ //Matrix.translate(new Vec(0, 0, height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+ //Matrix.translate(new Vec(0, 0, -height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
- Matrix.translate(new Vec(0, 0, height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
- Matrix.translate(new Vec(0, 0, -height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
- /*
Matrix.translate(new Vec(0, depth, 0)),
Matrix.translate(new Vec(0, -depth, 0)),
Matrix.translate(new Vec(0, 0, height)),
Matrix.translate(new Vec(0, 0, -height)),
- */
+
+ //Matrix.translate(new Vec(lshift, depth, height/2)),
+ //Matrix.translate(new Vec(lshift, depth, -height/2)),
+ //Matrix.translate(new Vec(rshift, -depth, height/2)),
+ //Matrix.translate(new Vec(rshift, -depth, -height/2)),
+ //Matrix.translate(new Vec(rshift, 0, height)),
+ //Matrix.translate(new Vec(rshift, 0, -height)),
+
+ Matrix.translate(new Vec( width, 0, 0)),
+ Matrix.translate(new Vec(-width, 0, 0)),
+
+ };
+
+ generateTile(translations, tile);
+
+ /*
+ translations = new Matrix[] {
+
+ //Matrix.translate(new Vec(lshift, depth, halfup)),
+ //Matrix.translate(new Vec(rshift, depth, halfup)),
+ //Matrix.translate(new Vec(lshift, -depth, halfup)),
+ //Matrix.translate(new Vec(rshift, -depth, halfup)),
+
+
+ //Matrix.translate(new Vec(0, depth, 0)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+ //Matrix.translate(new Vec(0, -depth, 0)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+
+ Matrix.translate(new Vec(0, 0, height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+ Matrix.translate(new Vec(0, 0, -height)).times(Matrix.rotate(new Vec(0, 0, 1), (float)Math.PI)),
+
+ //Matrix.translate(new Vec(0, depth, 0)),
+ //Matrix.translate(new Vec(0, -depth, 0)),
+ //Matrix.translate(new Vec(0, 0, height)),
+ //Matrix.translate(new Vec(0, 0, -height)),
+
//Matrix.translate(new Vec(lshift, depth, height/2)),
//Matrix.translate(new Vec(lshift, depth, -height/2)),
//Matrix.translate(new Vec(rshift, -depth, height/2)),
if (e.p1.p.x == e.p2.p.x && e.p1.p.z == e.p2.p.z) continue;
e.shatter();
}
+ */
+
+ /*
+ height = 4;
+ width = 4;
+ depth = 1;
+
+ Matrix mm = Matrix.scale(0.1f);
+ // top
+ quad(tile, mm,
+ new Point( 2, 2, 0),
+ new Point( 1, 1, -1),
+ new Point(-1, 1, -1),
+ new Point(-2, 2, 0));
+ quad(tile, mm,
+ new Point(-2, 2, 0),
+ new Point(-1, 1, 1),
+ new Point( 1, 1, 1),
+ new Point( 2, 2, 0));
+ quad(tile, mm,
+ new Point( 1, 1, -1),
+ new Point( 1, 1, 1),
+ new Point(-1, 1, 1),
+ new Point(-1, 1, -1));
+
+ // bottom
+ quad(tile, mm,
+ new Point(-2, -2, 0),
+ new Point(-1, -1, -1),
+ new Point( 1, -1, -1),
+ new Point( 2, -2, 0));
+ quad(tile, mm,
+ new Point( 2, -2, 0),
+ new Point( 1, -1, 1),
+ new Point(-1, -1, 1),
+ new Point(-2, -2, 0));
+ quad(tile, mm,
+ new Point(-1, -1, -1),
+ new Point(-1, -1, 1),
+ new Point( 1, -1, 1),
+ new Point( 1, -1, -1));
+
+ // left
+ quad(tile, mm,
+ new Point( 2, -2, 0),
+ new Point( 1, -1, -1),
+ new Point( 1, 1, -1),
+ new Point( 2, 2, 0));
+ quad(tile, mm,
+ new Point( 2, 2, 0),
+ new Point( 1, 1, 1),
+ new Point( 1, -1, 1),
+ new Point( 2, -2, 0));
+ quad(tile, mm,
+ new Point( 1, -1, -1),
+ new Point( 1, -1, 1),
+ new Point( 1, 1, 1),
+ new Point( 1, 1, -1));
+
+ // bottom
+ quad(tile, mm,
+ new Point(-2, 2, 0),
+ new Point(-1, 1, -1),
+ new Point(-1, -1, -1),
+ new Point(-2, -2, 0));
+ quad(tile, mm,
+ new Point(-2, -2, 0),
+ new Point(-1, -1, 1),
+ new Point(-1, 1, 1),
+ new Point(-2, 2, 0));
+ quad(tile, mm,
+ new Point(-1, 1, -1),
+ new Point(-1, 1, 1),
+ new Point(-1, -1, 1),
+ new Point(-1, -1, -1));
+
+ float factor = (float)Math.pow(tile.volume() / goal.volume(), 1.0/3.0);
+ goal.transform(Matrix.scale(factor/2.4f));
- for(Matrix m : translations) {
+ /*
+ translations = new Matrix[] {
+
+ Matrix.translate(new Vec(0, 0.2f,0))
+ .times(Matrix.rotate(new Vec(0,1,0), (float)( 1*Math.PI/2))),
+
+ Matrix.translate(new Vec(0,-0.2f,0))
+ .times(Matrix.rotate(new Vec(0,1,0), (float)(-1*Math.PI/2))),
+
+ //Matrix.translate(new Vec( 0.2f,0,0))
+ //.times(Matrix.rotate(new Vec(1,0,0), (float)( 1*Math.PI/2))),
+ //Matrix.translate(new Vec(-0.2f,0,0))
+ //.times(Matrix.rotate(new Vec(1,0,0), (float)(-1*Math.PI/2))),
+
+ //Matrix.translate(new Vec( 0.2f, 0,0))
+ //.times(Matrix.rotate(new Vec(0,0,1), (float)( 1*Math.PI/2)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 3*Math.PI/2))),
+
+ //Matrix.translate(new Vec(-0.2f, 0,0))
+ //.times(Matrix.rotate(new Vec(0,0,1), (float)( 3*Math.PI/2)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 3*Math.PI/2))),
+
+ //Matrix.rotate(new Vec(0,0,1), (float)( 0*Math.PI/2))
+ //.times(Matrix.translate(new Vec(0, -0.2f, 0)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 1*Math.PI/2))),
+ //Matrix.rotate(new Vec(0,0,1), (float)( 1*Math.PI/2))
+ //.times(Matrix.translate(new Vec(0, -0.2f, 0)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 1*Math.PI/2))),
+
+ //Matrix.rotate(new Vec(0,0,1), (float)( 0*Math.PI/2))
+ //.times(Matrix.translate(new Vec(0, -0.2f, 0)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 1*Math.PI/2))),
+ //Matrix.rotate(new Vec(0,0,1), (float)( 0*Math.PI/2))
+ //.times(Matrix.translate(new Vec(0, -0.2f, 0)))
+ //.times(Matrix.rotate(new Vec(0,1,0), (float)( 1*Math.PI/2))),
+
+ Matrix.ONE,
+ };
+ */
+
+ for(Matrix m1 : translations) {
+ for(Matrix m2 : translations) {
for(Mesh.T t1 : tile) {
for(Mesh.T t2 : tile) {
if (t1==t2) continue;
+ Matrix m = m1.inverse().times(m2);
if ((t1.v1().p.times(m).minus(t2.v1().p).mag() < MATCHING_EPSILON) &&
(t1.v2().p.times(m).minus(t2.v3().p).mag() < MATCHING_EPSILON) &&
(t1.v3().p.times(m).minus(t2.v2().p).mag() < MATCHING_EPSILON)) {
}
}
}
+ }
//xMesh.Vertex mid = lbf.getE(mbn).shatter();
// rescale to match volume
- float factor = (float)Math.pow(tile.volume() / goal.volume(), 1.0/3.0);
- goal.transform(Matrix.scale(factor));
+
+
// translate to match centroid
goal.transform(Matrix.translate(tile.centroid().minus(goal.centroid())));
Thread.yield();
repaint();
}
- for(int i=0; i<Math.min(oldverts,200); i++) {
+ for(int i=0; i<Math.min(oldverts,50); i++) {
Mesh.E e = es.poll();
verts++;
//System.out.println("shatter " + e);
//e.shatter(e.midpoint(), null, null, true, true);
-
e.shatter();
Thread.yield();
repaint();
tile.rebindPoints();
}
- public synchronized void rand(float temp, Mesh.Vertex p) {
+ public synchronized void rand(double temp, Mesh.Vertex p) {
p.reComputeErrorAround();
double tile_error = tile.error();
double goal_error = goal.error();
- float max = p.averageEdgeLength()/10;
+ //float max = p.averageEdgeLength()/10;
+ float max = 0.01f;
+
Vec v = new Vec(random.nextFloat(), random.nextFloat(), random.nextFloat());
v = v.norm().times((random.nextFloat() - 0.5f) * max);
//System.out.println(max + " " + p.averageEdgeLength() + " " + v.mag());
Matrix m = Matrix.translate(v);
+ //System.out.println(v.mag() + " " + max);
boolean good = p.move(m, false);
- if (!good) { /*misses++;*/ return; }
+ //if (!good) { /*misses++;*/ return; }
double new_tile_error = tile.error();
double new_goal_error = goal.error();
double tile_delta = (new_tile_error - tile_error) / tile_error;
double goal_delta = (new_goal_error - goal_error) / goal_error;
double delta = tile_delta + goal_delta;
- double swapProbability = Math.exp((-1 * delta) / (((double)temp)/1000000));
+ double swapProbability = Math.exp((-1 * delta) / temp);
+ //System.out.println(swapProbability);
boolean doSwap = good && (Math.random() < swapProbability);
//boolean doSwap = good && (tile_delta <= 0 && goal_delta <= 0);
//boolean doSwap = good && (tile_delta + goal_delta <= 0);
+
+ //if (temp < 0.000001) doSwap = good && (tile_delta <= 0 && goal_delta <= 0);
+
if (doSwap) {
tile_error = new_tile_error;
goal_error = new_goal_error;
float hits = 0;
float misses = 0;
public void anneal() throws Exception {
- float hightemp = 1;
- float temp = hightemp;
- float last = 10;
+ double hightemp = 1;
+ double temp = hightemp;
+ double last = 10;
boolean seek_upward = false;
double acceptance = 1;
while(true) {
double ratio = (hits+misses==0) ? 1 : (hits / (hits+misses));
hits = 0;
misses = 0;
- float gamma = 1;
+ double gamma = 1;
acceptance = (ratio+acceptance)/2;
accepts = (int)(Math.ceil(ratio*100));
temps = (int)(Math.ceil(temp*1000));
breakit();
}
seek_upward = true;
- } else if (acceptance > 0.96) gamma = 0.4f;
- else if (acceptance > 0.9) gamma = 0.5f;
- else if (acceptance > 0.8) gamma = 0.65f;
- else if (acceptance > 0.6) gamma = 0.7f;
- else if (acceptance > 0.3) gamma = 0.8f;
+ } else if (acceptance > 0.96) gamma = 0.1f;
+ else if (acceptance > 0.9) gamma = 0.2f;
+ else if (acceptance > 0.8) gamma = 0.3f;
+ else if (acceptance > 0.6) gamma = 0.4f;
+ else if (acceptance > 0.3) gamma = 0.6f;
else if (acceptance > 0.15) gamma = 0.9f;
- else if (acceptance > 0.05) gamma = 0.95f;
+ else if (acceptance > 0.05) gamma = 0.94f;
else if (acceptance > 0.01) gamma = 0.98f;
else { /*breaks++;*/ }
+ /*
if (seek_upward) {
if (acceptance > 0.2) seek_upward = false;
else gamma = 2-gamma;
}
+ */
- temp = temp * gamma;
+ if (anneal)
+ temp = temp * gamma;
HashSet<Mesh.Vertex> hs = new HashSet<Mesh.Vertex>();
int count = 0;
long then = System.currentTimeMillis();
- for(int i=0; i<40; i++) {
+ for(int i=0; i<400; i++) {
if (anneal) {
count++;
Mesh.Vertex v = pts[Math.abs(random.nextInt()) % pts.length];
Thread.yield();
repaint();
}
+
+ /*
PriorityQueue<Mesh.E> es = new PriorityQueue<Mesh.E>();
for(Mesh.T t : tile) {
float max = 5;
if (t.aspect() < 0.1 && e.length()>e.next.length() && e.length()>e.prev.length()) es.add(e);
}
}
- /*
for(int i=0; i<5; i++) {
Mesh.E e = es.poll();
if (e==null) break;
e.shatter();
}
- */
+
+
tile.rebindPoints();
+ */
+
System.out.println("temp="+temp + " ratio="+(Math.ceil(acceptance*100)) + " " +
"points_per_second=" +
(count*1000)/((double)(System.currentTimeMillis()-then)));
-
for(Mesh.Vertex p : goal.vertices()) p.recomputeFundamentalQuadricIfNeighborChanged();
synchronized(safeTriangles) {
safeTriangles.clear();
for(Mesh.T t : tile)
- if (t.shouldBeDrawn())
+ //if (t.shouldBeDrawn())
safeTriangles.add(t);
}
}
public static void main(String[] s) throws Exception {
StlFile stlf = new StlFile();
- stlf.load("fish.stl");
+ stlf.load("torus.stl");
+ //stlf.load("fish.stl");
//stlf.load("monkey.stl");
Frame f = new Frame();
Main main = new Main(stlf, f);
public void transform(Matrix m) {
ArrayList<Vertex> set = new ArrayList<Vertex>();
for(Vertex v : vertices) set.add(v);
- for(Vertex v : set) v.transform(m.times(v.p), true);
+ for(Vertex v : set) v.transform(m.times(v.p), true, null);
}
public void rebuild() { /*vertices.rebuild();*/ }
/** a vertex in the mesh */
public final class Vertex extends HasQuadric implements Visitor {
- public Point p, oldp, goodp;
+ public Point p, goodp;
+ public Point oldp;
E e; // some edge *leaving* this point
private boolean illegal = false;
if (quadric_count != 0)
nerror = (nerror + quadric.preAndPostMultiply(p))/(quadric_count+1);
+ if (!immutableVertices && quadric_count == 0)
+ nerror *= 2;
+
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
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);
// t2' = t2.getMatrix(t1) * M * t1
// t1 = t1.getMatrix(t2) * t2
// M * t1 = M * t1.getMatrix(t2) * t2
- for(Vertex v : (Iterable<Vertex>)getBoundPeers())
- good &= v.transform(v.getBindingMatrix(this).times(m).times(this.p),
- ignoreProblems);
+ Point op = this.p;
+ Point pt = m.times(this.p);
+ for(Vertex v : (Iterable<Vertex>)getBoundPeers()) {
+ Point pt2 = v.getBindingMatrix(this).times(pt);
+ /*
+ if (Math.abs( v.p.minus(pt2).mag() / pt.minus(op).mag() ) > 5)
+ throw new Error(v.p+" "+pt2+"\n"+op+" "+pt+"\n"+v.getBindingMatrix(this));
+ if (Math.abs( v.p.minus(pt2).mag() / pt.minus(op).mag() ) < 1/5) throw new Error();
+ */
+ good &= v.transform(pt2,
+ ignoreProblems, v.getBindingMatrix(this));
+ }
for(Vertex v : (Iterable<Vertex>)getBoundPeers())
- if (good || ignoreProblems) v.reComputeErrorAround();
- else v.transform(v.oldp, true);
-
+ v.recomputeFundamentalQuadricIfNeighborChanged();
return good;
}
/** does NOT update bound pairs! */
- private boolean transform(Point newp, boolean ignoreProblems) {
+ private boolean transform(Point newp, boolean ignoreProblems, Matrix yes) {
this.oldp = this.p;
if (immutableVertices) throw new Error();
unApplyQuadricToNeighbor();
+
+
+ illegal = false;
+ if (this.p.minus(newp).mag() > 0.1 && !ignoreProblems) {
+ /*
+ try {
+ throw new Exception(""+this.p.minus(newp).mag()+" "+ignoreProblems+" "+yes);
+ } catch(Exception e) {
+ e.printStackTrace();
+ }
+ */
+ illegal = true;
+ }
+
this.p = newp;
reinsert();
applyQuadricToNeighbor();
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;
+ for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next)
+ e.p2.quadricStale = true;
return !illegal;
}
public void checkLegality() {
- /*
for(E e = this.e; e!=null; e=e.pair.next==this.e?null:e.pair.next) {
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 (e.t.aspect() < 0.2) illegal = true;
}
- */
if (!illegal) triangles.range(oldp, this.p, (Visitor<T>)this);
}
public void bindTo(Vertex p) { bindTo(Matrix.ONE, p); }
}
- public class BindingGroup {
- private HashSet<E> set = new HashSet<E>();
- public BindingGroup bind_others;
- public BindingGroup other() { return bind_others; }
- public BindingGroup(BindingGroup bind_others) { this.bind_others = bind_others; }
- public BindingGroup() { this.bind_others = new BindingGroup(this); }
- public BindingGroup(E e) { this(); set.add(e); }
- public void add(E e) {
- if (set.contains(e)) return;
- set.add(e);
- BindingGroup e_bind_peers = e.bind_peers;
- BindingGroup e_bind_to = e.bind_to;
- e.bind_peers = this;
- e.bind_to = bind_others;
- for (E epeer : e_bind_peers.set) add(epeer);
- for (E eother : e_bind_to.set) bind_others.add(eother);
- /*
- for(E eother : bind_others.set) {
- if (e.next.bind_to.set.contains(eother.prev)) {
- e.next.next.bindEdge(eother.prev.prev);
- }
- if (e.prev.bind_to.set.contains(eother.next)) {
- e.prev.prev.bindEdge(eother.next.next);
- }
- }
- */
- }
- public void dobind(E e) {
- for(E ebound : set) {
- e.p1.bindTo(Matrix.ONE, ebound.p2);
- e.p2.bindTo(Matrix.ONE, ebound.p1);
- }
- }
- }
/** [UNIQUE] an edge */
public final class E extends HasBindingGroup implements Comparable<E> {
E prev; // previous half-edge
E next; // next half-edge
E pair; // partner half-edge
- public BindingGroup bind_peers = new BindingGroup(this);
- public BindingGroup bind_to = bind_peers.other();
boolean shattered = false;
public boolean intersects(T t) { return t.intersects(p1.p, p2.p); }
pair._bindEdge(e.pair, m);
}
public void _bindEdge(E e, Matrix m) {
- //bind_to.add(e);
-
e = e.pair;
/*
//assumes edges are identical length at binding time
}
public void dobind() {
- //bind_to.dobind(this);
for(E e : (Iterable<E>)getBoundPeers()) {
if (e==this) continue;
p1.bindTo(getBindingMatrix(e), e.p1);
newT(r.p, mid, e.p2.p, null, 0);
newT(l.p, mid, e.p1.p, null, 0);
newT(l.p, e.p2.p, mid, null, 0);
- /*
- */
}
for(E e : (Iterable<E>)getBoundPeers()) {
Point mid = e.midpoint();
e.p1.getE(mid).pair. bindTo(e.getBindingMatrix(firste), first.pair);
e.p2.getE(mid).pair. bindTo(e.getBindingMatrix(firste), firstq);
e.p2.getE(mid).pair.pair.bindTo(e.getBindingMatrix(firste), firstq.pair);
- //e.p1.getE(mid).pair.prev.bindTo(e.pair.getBindingMatrix(firstx), first.pair.prev);
}
return null;
}
pair.next.t = null;
pair.prev.t = null;
- this.bind_to = null;
- pair.bind_to = null;
- this.bind_peers = null;
- pair.bind_peers = null;
pair.prev.next = next;
next.prev = pair.prev;
prev.next = pair.next;
this.prev.next = this;
this.next.prev = this;
this.pair.pair = this;
- bind_peers.add(this);
if (this.next.p1 != p2) throw new Error();
if (this.prev.p2 != p1) throw new Error();
if (this.p1.e == null) this.p1.e = this;
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 (t != null || e.t != null) throw new Error("cannot make adjacent -- edges not both free ");
E freeIncident = p2.getFreeIncident(e, this);