org.h2gis.utilities.jts_utils.Contouring Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of spatial-utilities Show documentation
Show all versions of spatial-utilities Show documentation
Collection of methods to fetch spatial metadata in SFS database like PostGIS or H2Spatial.
Theses functions can be commonly used either in PostGIS or in H2.
Spatial utilities publish also a DataSourceFactory wrapper that provide JDBC Wrapper for spatial functionality.
/**
* H2GIS is a library that brings spatial support to the H2 Database Engine
* .
*
* H2GIS is distributed under GPL 3 license. It is produced by CNRS
* outsideTriangles,
Deque intervalTriangles) throws TopologyException {
if(beginIncluded > currentTriangle.getMaxMarker() || endExcluded < currentTriangle.getMinMarker()) {
return false;
}
short vertIso1Start = -1, vertIso1Stop = -1; // for beginIncluded -
// Vertice of the
// triangle where the
// split Origin and
// destination will be
// done
short vertIso2Start = -1, vertIso2Stop = -1; // for endExcluded -
// Vertice of the triangle where the split Origin and destination will be done
short sideIso1Start = -1, sideIso1Stop = -1; // for beginIncluded - Side
// of the triangle where
// the split Origin and
// destination will be
// done
short sideIso2Start = -1, sideIso2Stop = -1; // for endExcluded - Side
// of the triangle where
// the split Origin and
// destination will be
// done
Coordinate posIso1Start = new Coordinate(), posIso1Stop = new Coordinate();
Coordinate posIso2Start = new Coordinate(), posIso2Stop = new Coordinate();
// Process ISO 1 beginIncluded
// Find if we include some vertices
if (isoEqual(currentTriangle.m1, beginIncluded)) {
vertIso1Start = 0;
}
if (isoEqual(currentTriangle.m2, beginIncluded)) {
if (vertIso1Start == -1) {
vertIso1Start = 1;
} else {
vertIso1Stop = 1;
}
}
if (isoEqual(currentTriangle.m3, beginIncluded)) {
if (vertIso1Start == -1) {
vertIso1Start = 2;
} else {
vertIso1Stop = 2;
}
}
// Find if we need to split a side (interval between two points)
if (vertIso1Start == -1 || vertIso1Stop == -1) {
sideIso1Start = findTriangleSide(currentTriangle, beginIncluded,
sideIso1Start, posIso1Start);
if (sideIso1Start != -1) {
sideIso1Stop = findTriangleSide(currentTriangle, beginIncluded,
sideIso1Start, posIso1Stop);
}
}
// Process ISO 2 endExcluded
// Find if we include some vertices
if (isoEqual(currentTriangle.m1, endExcluded)) {
vertIso2Start = 0;
}
if (isoEqual(currentTriangle.m2, endExcluded)) {
if (vertIso2Start == -1) {
vertIso2Start = 1;
} else {
vertIso2Stop = 1;
}
}
if (isoEqual(currentTriangle.m3, endExcluded)) {
if (vertIso2Start == -1) {
vertIso2Start = 2;
} else {
vertIso2Stop = 2;
}
}
// Find if we need to split a side (interval between two points)
if (vertIso2Start == -1 || vertIso2Stop == -1) {
sideIso2Start = findTriangleSide(currentTriangle, endExcluded,
sideIso2Start, posIso2Start);
if (sideIso2Start != -1) {
sideIso2Stop = findTriangleSide(currentTriangle, endExcluded,
sideIso2Start, posIso2Stop);
}
}
// /////////////////////////////
// Split by specified parameters
// Final possibilities
if ((sideIso1Start == -1 && sideIso2Start == -1)
&& ((vertIso1Start != -1 && vertIso1Stop == -1) || (vertIso2Start != -1 && vertIso2Stop == -1))) {
// Only one vertex in the range domain
if ((vertIso1Start != -1 && currentTriangle.getMaxMarker(vertIso1Start) < beginIncluded)
|| (vertIso2Start != -1 && currentTriangle.getMinMarker(vertIso2Start) > endExcluded)) {
return false;
} else {
// Covered totally by the range
intervalTriangles.add(currentTriangle);
return true;
}
} else if ((vertIso1Start == -1 && sideIso1Start == -1
&& vertIso2Start == -1 && sideIso2Start == -1)
|| // No iso limits inside the triangle
(vertIso1Start != -1 && vertIso1Stop != -1 && vertIso2Start != -1)
|| // Side == Iso 1 and the third vertice == Iso2
(vertIso2Start != -1 && vertIso2Stop != -1 && vertIso1Start != -1) // Side
// ==
// Iso
// 2
// and
// the
// third
// vertice
// ==
// Iso1
) { // Covered totally by the range
intervalTriangles.add(currentTriangle);
return true;
} else if (((vertIso1Start != -1 || sideIso1Start != -1) && !((vertIso2Start != -1 || sideIso2Start != -1))) ||
(!(vertIso1Start != -1 || sideIso1Start != -1))) // Range
// begin notfound but
{
// Side to side
if (sideIso1Start != -1 && sideIso1Stop != -1) {
// Split triangle in three
// ///////////////////////////////////
// First triangle in the shared vertex side
// Find the shared vertex between each
TriMarkers aloneTri = new TriMarkers(), firstTwinTri = new TriMarkers(), secondTwinTri = new TriMarkers();
short sharedVertex = getSplittedTriangle(sideIso1Start,
sideIso1Stop, posIso1Start, posIso1Stop, beginIncluded,
currentTriangle, aloneTri, firstTwinTri, secondTwinTri);
if (currentTriangle.getMarker(sharedVertex) < beginIncluded) {
outsideTriangles.add(aloneTri);
// ///////////////////////////////////
// Second and third triangle, at the other side as interval
// surface
intervalTriangles.add(firstTwinTri);
intervalTriangles.add(secondTwinTri);
return true;
} else {
intervalTriangles.add(aloneTri);
// ///////////////////////////////////
// Second and third triangle, at the other side as external
// surface
outsideTriangles.add(firstTwinTri);
outsideTriangles.add(secondTwinTri);
return true;
}
} else if (sideIso2Start != -1 && sideIso2Stop != -1) {
// Split triangle in three
// ///////////////////////////////////
// First triangle in the shared vertex side
// Find the shared vertex between each
TriMarkers aloneTri = new TriMarkers(), firstTwinTri = new TriMarkers(), secondTwinTri = new TriMarkers();
short sharedVertex = getSplittedTriangle(sideIso2Start,
sideIso2Stop, posIso2Start, posIso2Stop, endExcluded,
currentTriangle, aloneTri, firstTwinTri, secondTwinTri);
if (currentTriangle.getMarker(sharedVertex) > endExcluded) {
outsideTriangles.add(aloneTri);
// ///////////////////////////////////
// Second and third triangle, at the other side as interval
// surface
intervalTriangles.add(firstTwinTri);
intervalTriangles.add(secondTwinTri);
return true;
} else {
intervalTriangles.add(aloneTri);
// ///////////////////////////////////
// Second and third triangle, at the other side as external
// surface
outsideTriangles.add(firstTwinTri);
outsideTriangles.add(secondTwinTri);
return true;
}
}
// Only One range found
if ((vertIso1Start != -1 && vertIso1Stop != -1)
|| (vertIso2Start != -1 && vertIso2Stop != -1)) {
// Case side covered by iso
short thirdVert = -1;
if (vertIso1Start != 0 && vertIso2Start != 0) {
thirdVert = 0;
}
if (vertIso1Start != 1 && vertIso1Stop != 1
&& vertIso2Start != 1 && vertIso2Stop != 1) {
thirdVert = 1;
}
if (vertIso1Stop != 2 && vertIso2Stop != 2) {
thirdVert = 2;
}
if (currentTriangle.getMarker(thirdVert) >= beginIncluded
&& currentTriangle.getMarker(thirdVert) < endExcluded) {
intervalTriangles.add(currentTriangle);
return true;
} else {
// Triangle is out of range
return false;
}
}
// Side to vertice
if (vertIso1Start != -1) {
// Split triangle in two
// TODO check this conditional branch
short vertOutside = -1, vertInside = -1;
if (currentTriangle.m1 < beginIncluded) {
vertOutside = 0;
if (vertIso1Start == 1) {
vertInside = 2;
} else {
vertInside = 1;
}
} else if (currentTriangle.m2 < beginIncluded) {
vertOutside = 1;
if (vertIso1Start == 0) {
vertInside = 2;
} else {
vertInside = 0;
}
} else if (currentTriangle.m3 < beginIncluded) {
vertOutside = 2;
if (vertIso1Start == 0) {
vertInside = 1;
} else {
vertInside = 0;
}
}
outsideTriangles.add(new TriMarkers(currentTriangle.getVertice(vertIso1Start), currentTriangle.getVertice(vertOutside), posIso1Start, beginIncluded,
currentTriangle.getMarker(vertOutside), beginIncluded));
intervalTriangles.add(new TriMarkers(currentTriangle.getVertice(vertIso1Start), currentTriangle.getVertice(vertInside), posIso1Start, beginIncluded,
currentTriangle.getMarker(vertInside), beginIncluded));
return true;
} else if (vertIso2Start != -1) {
// Split triangle in two
short vertOutside = -1, vertInside = -1;
double maxMarker = currentTriangle.getMaxMarker();
if (isoEqual(currentTriangle.m1, maxMarker)) {
vertOutside = 0;
if (vertIso2Start == 1) {
vertInside = 2;
} else {
vertInside = 1;
}
} else if (isoEqual(currentTriangle.m2, maxMarker)) {
vertOutside = 1;
if (vertIso2Start == 0) {
vertInside = 2;
} else {
vertInside = 0;
}
} else {
vertOutside = 2;
if (vertIso2Start == 0) {
vertInside = 1;
} else {
vertInside = 0;
}
}
TriMarkers outsideTriangle = new TriMarkers(
currentTriangle.getVertice(vertIso2Start), currentTriangle.getVertice(vertOutside), posIso2Start,
endExcluded, currentTriangle.getMarker(vertOutside), endExcluded);
TriMarkers intervalTriangle = new TriMarkers(
currentTriangle.getVertice(vertIso2Start), currentTriangle.getVertice(vertInside), posIso2Start,
endExcluded, currentTriangle.getMarker(vertInside), endExcluded);
if(CHECK_RESULT) {
// Check that new triangle are in the right side
if(!(intervalTriangle.getMinMarker() >= beginIncluded && intervalTriangle.getMaxMarker() <= endExcluded)) {
throw new TopologyException("Computation error out of bound triangle");
}
if(outsideTriangle.getMaxMarker() < endExcluded) {
throw new TopologyException("Computation error out of bound triangle");
}
}
outsideTriangles.add(outsideTriangle);
intervalTriangles.add(intervalTriangle);
return true;
}
} else {
// Begin and end range inside the triangle
// First step, make outside inferior triangle
Deque insideTriangles = new LinkedList();
splitInterval(beginIncluded, Double.POSITIVE_INFINITY,
currentTriangle, outsideTriangles, insideTriangles);
// distribute inside and outside superior triangle from the end iso
for (TriMarkers insideTri : insideTriangles) {
splitInterval(Double.NEGATIVE_INFINITY, endExcluded, insideTri,
outsideTriangles, intervalTriangles);
}
return true;
}
// Unknown case throw
throw new TopologyException(
"Unhandled triangle splitting case :\n vertIso1Start("
+ vertIso1Start + "), vertIso1Stop(" + vertIso1Stop
+ "), vertIso2Start(" + vertIso2Start
+ "), vertIso2Stop(" + vertIso2Stop
+ "), sideIso1Start(" + sideIso1Start
+ "), sideIso1Stop(" + sideIso1Stop
+ "), sideIso2Start(" + sideIso2Start
+ "), sideIso2Stop(" + sideIso2Stop + ")");
}
/**
*
* @param triangleData Triangle Coordinates and Marker values
* @param isoLvls Iso level to extract.
* @return processedTriangles Return sub-triangle corresponding to iso levels. iso level are stored in markers (same for m0,m1,m2)
* @throws TopologyException
*/
public static Map> processTriangle(TriMarkers triangleData, List isoLvls) throws TopologyException {
TriMarkers currentTriangle = triangleData;
Map> toDriver = new HashMap>();
// For each iso interval
Deque triangleToProcess = new LinkedList();
triangleToProcess.add(currentTriangle);
do {
currentTriangle = triangleToProcess.pop();
Double beginInterval = Double.NEGATIVE_INFINITY;
short isolvl = 0;
for (Double endInterval : isoLvls) {
Deque triangleToDriver;
if (!toDriver.containsKey(isolvl)) {
triangleToDriver = new LinkedList();
toDriver.put(isolvl, triangleToDriver);
} else {
triangleToDriver = toDriver.get(isolvl);
}
if (splitInterval(beginInterval, endInterval,
currentTriangle, triangleToProcess,
triangleToDriver)) {
break;
}
beginInterval = endInterval;
isolvl++;
}
} while (!triangleToProcess.isEmpty());
return toDriver;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy