/** assumes v is an halfplane! - returns another (none halfplane) triangle */ private static Triangle findnext2(Point p, Triangle v) { if (v.getAbTriangle() != null && !v.getAbTriangle().isHalfplane()) return v.getAbTriangle(); if (v.getBcTriangle() != null && !v.getBcTriangle().isHalfplane()) return v.getBcTriangle(); if (v.getCaTriangle() != null && !v.getCaTriangle().isHalfplane()) return v.getCaTriangle(); return null; }
private void allTriangles(Triangle curr, Vector<Triangle> front, int mc) { if (curr != null && curr.getMc() == mc && !front.contains(curr)) { front.add(curr); allTriangles(curr.getAbTriangle(), front, mc); allTriangles(curr.getBcTriangle(), front, mc); allTriangles(curr.getCaTriangle(), front, mc); } }
private void initTriangles() { if (modCount == modCount2) return; if (this.size() > 2) { modCount2 = modCount; Vector<Triangle> front = new Vector<Triangle>(); triangles = new Vector<Triangle>(); front.add(this.startTriangle); while (front.size() > 0) { Triangle t = front.remove(0); if (t.isMark() == false) { t.setMark(true); triangles.add(t); if (t.getAbTriangle() != null && !t.getAbTriangle().isMark()) { front.add(t.getAbTriangle()); } if (t.getBcTriangle() != null && !t.getBcTriangle().isMark()) { front.add(t.getBcTriangle()); } if (t.getCaTriangle() != null && !t.getCaTriangle().isMark()) { front.add(t.getCaTriangle()); } } } for (int i = 0; i < triangles.size(); i++) { triangles.elementAt(i).setMark(false); } } }
t.setCanext(firstT); firstT.setBcTriangle(t); tp.setBcTriangle(firstT.getAbTriangle()); firstT.getAbTriangle().setCanext(tp); firstT = t; firstP = p; t.setCanext(tp); tp.setBcTriangle(t); tp.setCanext(lastT.getAbTriangle()); lastT.getAbTriangle().setBcTriangle(tp); lastT = t; lastP = p; tp = new Triangle(u.getB(), p); u.setB(p); u.getAbTriangle().setA(p); t.setAbTriangle(tp); tp.setAbTriangle(t); t.setCanext(u); u.setBcTriangle(t); tp.setCanext(u.getAbTriangle().getCaTriangle()); u.getAbTriangle().getCaTriangle().setBcTriangle(tp); tp.setBcTriangle(u.getAbTriangle()); u.getAbTriangle().setCanext(tp); if (firstT == u) { firstT = t;
private Triangle treatDegeneracyInside(Triangle t, Point p) { if (t.getAbTriangle().isHalfplane() && p.pointLineTest(t.getB(), t.getA()) == Point.ONSEGMENT) return extendOutside(t.getAbTriangle(), p); if (t.getBcTriangle().isHalfplane() && p.pointLineTest(t.getC(), t.getB()) == Point.ONSEGMENT) return extendOutside(t.getBcTriangle(), p); if (t.getCaTriangle().isHalfplane() && p.pointLineTest(t.getA(), t.getC()) == Point.ONSEGMENT) return extendOutside(t.getCaTriangle(), p); return null; }
startTriangle = extendOutside(firstT.getAbTriangle(), p); allCollinear = false; break;
private static Triangle findnext1(Point p, Triangle v) { if (p.pointLineTest(v.getA(), v.getB()) == Point.RIGHT && !v.getAbTriangle().isHalfplane()) return v.getAbTriangle(); if (p.pointLineTest(v.getB(), v.getC()) == Point.RIGHT && !v.getBcTriangle().isHalfplane()) return v.getBcTriangle(); if (p.pointLineTest(v.getC(), v.getA()) == Point.RIGHT && !v.getCaTriangle().isHalfplane()) return v.getCaTriangle(); if (p.pointLineTest(v.getA(), v.getB()) == Point.RIGHT) return v.getAbTriangle(); if (p.pointLineTest(v.getB(), v.getC()) == Point.RIGHT) return v.getBcTriangle(); if (p.pointLineTest(v.getC(), v.getA()) == Point.RIGHT) return v.getCaTriangle(); return null; }
private Triangle extendOutside(Triangle t, Point p) { if (p.pointLineTest(t.getA(), t.getB()) == Point.ONSEGMENT) { Triangle dg = new Triangle(t.getA(), t.getB(), p); Triangle hp = new Triangle(p, t.getB()); t.setB(p); dg.setAbTriangle(t.getAbTriangle()); dg.getAbTriangle().switchneighbors(t, dg); dg.setBcTriangle(hp); hp.setAbTriangle(dg); dg.setCanext(t); t.setAbTriangle(dg); hp.setBcTriangle(t.getBcTriangle()); hp.getBcTriangle().setCanext(hp); hp.setCanext(t); t.setBcTriangle(hp); return dg; } Triangle ccT = extendcounterclock(t, p); Triangle cT = extendclock(t, p); ccT.setBcTriangle(cT); cT.setCanext(ccT); startTriangleHull = cT; return cT.getAbTriangle(); }
private void flip(Triangle t, int mc) { Triangle u = t.getAbTriangle(); Triangle v; t.setMc(mc); v = new Triangle(u.getB(), t.getB(), t.getC()); v.setAbTriangle(u.getBcTriangle()); t.setAbTriangle(u.getAbTriangle()); } else if (t.getA() == u.getB()) { v = new Triangle(u.getC(), t.getB(), t.getC()); } else if (t.getA() == u.getC()) { v = new Triangle(u.getA(), t.getB(), t.getC()); v.setAbTriangle(u.getAbTriangle()); t.setAbTriangle(u.getCaTriangle()); } else { v.getAbTriangle().switchneighbors(u, v); v.getBcTriangle().switchneighbors(t, v); t.setBcTriangle(v); v.setCanext(t); t.setB(v.getA()); t.getAbTriangle().switchneighbors(u, t); t.circumcircle();
private Triangle extendInside(Triangle t, Point p) { Triangle h1, h2; h1 = treatDegeneracyInside(t, p); if (h1 != null) return h1; h1 = new Triangle(t.getC(), t.getA(), p); h2 = new Triangle(t.getB(), t.getC(), p); t.setC(p); t.circumcircle(); h1.setAbTriangle(t.getCaTriangle()); h1.setBcTriangle(t); h1.setCanext(h2); h2.setAbTriangle(t.getBcTriangle()); h2.setBcTriangle(h1); h2.setCanext(t); h1.getAbTriangle().switchneighbors(t, h1); h2.getAbTriangle().switchneighbors(t, h2); t.setBcTriangle(h2); t.setCanext(h1); return t; }
deletedTriangle.getAbTriangle().switchneighbors(deletedTriangle, addedTriangle); addedTriangle.setAbTriangle(deletedTriangle.getAbTriangle()); addedTriangle.setCanext(deletedTriangle.getAbTriangle()); addedTriangle.setBcTriangle(deletedTriangle.getAbTriangle());
if (!halfplane.getAbTriangle().isHalfplane()) { neighbor = halfplane.getAbTriangle(); } else if (!halfplane.getBcTriangle().isHalfplane()) { neighbor = halfplane.getBcTriangle();