private static void renderHull(PtEntry pt) {
Inf inf = Inf.create();
int count = 30;
PtEntry ptStart = pt;
do {
inf.update();
if (pt.prev(true) != null) {
boolean valley = false;
valley =
(pt.prev(true).source() == pt.source() && pt.prev(true).orig().next(true) != pt.orig());
V.pushColor(MyColor.cBLUE);
V.pushStroke(valley ? STRK_RUBBERBAND : STRK_THICK);
V.drawLine(pt.prev(true), pt);
V.pop(2);
}
V.pushColor(MyColor.cDARKGREEN);
V.mark(pt, MARK_DISC, .6);
V.pop();
if (Editor.withLabels(true)) {
StringBuilder sb = new StringBuilder();
sb.append(" #" + pt.id());
if (pt.source() != null) sb.append(" <" + pt.source() + ">");
V.pushScale(.6);
V.draw(sb.toString(), MyMath.ptOnCircle(pt, MyMath.radians(30), 3), TX_FRAME | TX_BGND);
V.pop();
}
pt = pt.next(true);
if (count-- == 0) V.draw("too many points rendering!", 50, 50, TX_CLAMP);
} while (pt != ptStart && count > 0);
}
private static void insertValleys(
PtEntry hullPt, Object aSrc, Object bSrc) { // pa, MyPolygon pb) {
boolean db = C.vb(DB_INSERTVALLEY);
PtEntry ent = hullPt;
if (db && T.update()) T.msg("insertValleys");
do {
PtEntry next = ent.next(true);
if (ent.source() == next.source()) {
PtEntry orig = ent.orig();
if (orig.next(true) != next.orig()) {
PtEntry vPeak0 = ent;
PtEntry vPeak1 = next;
EdPolygon opp = (EdPolygon) (vPeak0.source() == aSrc ? bSrc : aSrc);
FPoint2 kernelPt = opp.getPointMod(C.vi(KERNELVERT));
// construct a chain from the vertices of the valley
PtEntry handle = new PtEntry(vPeak0);
PtEntry hNext = handle;
PtEntry e = vPeak0.orig();
while (e != vPeak1.orig()) {
inf.update();
e = e.next(true);
hNext = hNext.insert(new PtEntry(e), true);
}
if (C.vb(SKIPCONTOUR)) {
PtEntry h0 = handle.next(true);
PtEntry h1 = hNext.prev(true);
PtEntry.join(vPeak0, h0);
PtEntry.join(h1, vPeak1);
if (db && T.update())
T.msg("inserted unmodified valley" + T.show(vPeak0) + T.show(vPeak1));
} else {
if (!C.vb(DB_CONTOUR)) T.disable();
PtEntry hull = COper3.buildHullForChain(handle, kernelPt);
if (!C.vb(DB_CONTOUR)) T.enable();
// find entries corresponding to start, end of hull
PtEntry peak0 = null, peak1 = null;
{
PtEntry hEnt = hull;
while (peak0 == null || peak1 == null) {
inf.update();
if (hEnt.orig() == vPeak0.orig()) peak0 = hEnt;
if (hEnt.orig() == vPeak1.orig()) peak1 = hEnt;
hEnt = hEnt.next(true);
}
}
PtEntry.join(vPeak0, peak0.next(true));
PtEntry.join(peak1.prev(true), vPeak1);
if (db && T.update())
T.msg("inserted monotonic valley" + T.show(vPeak0) + T.show(vPeak1));
}
}
}
ent = next;
} while (ent != hullPt);
}