/** * Check to see if the trapezoid lies inside the polygon. * * @param t The trapezoid to test against the polygon * @return true if the trapezoid lies completely inside the polygon */ private boolean insidePolygon(SeidelTrapezoid t) { if((!t.valid) || ((t.leftSegment <= 0) || (t.rightSegment <= 0))) return false; if(((t.u0 <= 0) && (t.u1 <= 0)) || ((t.d0 <= 0) && (t.d1 <= 0))) { int rseg = t.rightSegment; return greaterThan(segments[rseg].v1, segments[rseg].v0); } return false; }
boolean is_swapped = false; if(greaterThan(s.v1, s.v0)) // Get higher vertex in v0
monotoneChain[p].marked = true; if(greaterThan(vertexChain[v].point, ymax))
double area; if(greaterThan(s.v1, s.v0)) /* seg. going upwards */
if(greaterThan(v, rptr.yVal)) // above ret_val = locateEndpoint(v, vo, rptr.rightChild); else if(equalsEpsilon(v, rptr.yVal)) if(greaterThan(vo, rptr.yVal)) // above ret_val = locateEndpoint(v, vo, rptr.rightChild); else