#define BIG 16384
#define CHANSZ(w) (((w)-3)/2)
#define IS_SMALL(v) (CHANSZ(v) < 2)
-/* #define CHANSZ(w) (w) */
/* updateWt:
* At present, we use a step function. When a bound is reached, the weight
vp = g->vertices + v;
vp->color = SCANNING;
- /* g->vertices[v].d = time; */
adj = vp->adj_list;
time = time + 1;
time = DFS_visit(g, id, time, sp);
}
vp->color = SCANNED;
- /* g->vertices[v].f = time; */
pushStack (sp, v);
return (time + 1);
}
int left, right; /* children */
} qnode_t;
-/* static int chain_idx, op_idx, mon_idx; */
static int q_idx;
static int tr_idx;
static int QSIZE;
if (FP_EQUAL(tr[t].lo.y, tr[tlast].lo.y) &&
FP_EQUAL(tr[t].lo.x, tr[tlast].lo.x) && tribot)
{ /* bottom forms a triangle */
- /* int tmpseg; */
if (is_swapped)
tmptriseg = seg[segnum].prev;
else
tmptriseg = seg[segnum].next;
- /* if ((tmpseg > 0) && is_left_of(tmpseg, seg, &s.v0)) */
if (tmptriseg > 0 && is_left_of(tmptriseg, seg, &s.v0))
{
/* L-R downward cusp */
else
{
- /* int tmpseg = tr[tr[t].d0].rseg; */
double y0, yt;
pointf tmppt;
int tnext, i_d0, i_d1;