/**
* Find the innermost enclosing shell EdgeRing containing the argument EdgeRing, if any. The
* innermost enclosing ring is the <i>smallest</i> enclosing ring. The algorithm used depends on
* the fact that: <br>
* ring A contains ring B iff envelope(ring A) contains envelope(ring B) <br>
* This routine is only safe to use if the chosen point of the hole is known to be properly
* contained in a shell (which is guaranteed to be the case if the hole does not touch its shell)
*
* @return containing EdgeRing, if there is one or null if no containing EdgeRing is found
*/
public static EdgeRing findEdgeRingContaining(EdgeRing testEr, List shellList) {
LinearRing testRing = testEr.getRing();
Envelope testEnv = testRing.getEnvelopeInternal();
Coordinate testPt = testRing.getCoordinateN(0);
EdgeRing minShell = null;
Envelope minShellEnv = null;
for (Iterator it = shellList.iterator(); it.hasNext(); ) {
EdgeRing tryShell = (EdgeRing) it.next();
LinearRing tryShellRing = tryShell.getRing();
Envelope tryShellEnv = tryShellRing.getEnvelopeInternal();
// the hole envelope cannot equal the shell envelope
// (also guards against testing rings against themselves)
if (tryShellEnv.equals(testEnv)) continue;
// hole must be contained in shell
if (!tryShellEnv.contains(testEnv)) continue;
testPt =
CoordinateArrays.ptNotInList(testRing.getCoordinates(), tryShellRing.getCoordinates());
boolean isContained = false;
if (CGAlgorithms.isPointInRing(testPt, tryShellRing.getCoordinates())) isContained = true;
// check if this new containing ring is smaller than the current minimum ring
if (isContained) {
if (minShell == null || minShellEnv.contains(tryShellEnv)) {
minShell = tryShell;
minShellEnv = minShell.getRing().getEnvelopeInternal();
}
}
}
return minShell;
}
public Polygon nextPolygon() {
final LinearRing shell = nextLinearRing();
final int nbHoles = 1; // getNumberOfHolesPerPolygon();
final LinearRing[] holes = new LinearRing[nbHoles];
for (int i = 0; i < nbHoles; i++) {
do {
holes[i] = nextLinearRing(shell.getEnvelopeInternal());
} while (!shell.contains(holes[i]));
}
return gf.createPolygon(shell, holes);
}
/**
* ********************************************************************** Protected method for
* setting envelope of triangle
*
* @return envelope of triangle
*/
public Envelope setEnvelope() {
Coordinate[] newPoint = new Coordinate[4];
newPoint[0] = A;
newPoint[1] = B;
newPoint[2] = C;
newPoint[3] = A;
CoordinateArraySequence newPointsTriangle = new CoordinateArraySequence(newPoint);
LinearRing trianglesPoints = new LinearRing(newPointsTriangle, new GeometryFactory());
return trianglesPoints.getEnvelopeInternal();
}
