/**
* Trims a grid of lines for points outside a polygon
*
* @param waypoints2 Polygon vertices
* @param grid Array with Grid lines
* @return array with the trimmed grid lines
*/
private List<LineLatLng> trimGridLines(List<LatLng> waypoints2, List<LineLatLng> grid) {
List<LineLatLng> hatchLines = new ArrayList<LineLatLng>();
// find intersections
for (LineLatLng gridLine : grid) {
double closestDistance = Double.MAX_VALUE;
double farestDistance = Double.MIN_VALUE;
LatLng closestPoint = null;
LatLng farestPoint = null;
int crosses = 0;
for (int b = 0; b < waypoints2.size(); b++) {
LatLng newlatlong;
if (b != waypoints2.size() - 1) {
newlatlong =
GeoTools.FindLineIntersection(
waypoints2.get(b), waypoints2.get(b + 1), gridLine.p1, gridLine.p2);
} else { // Don't forget the last polygon line
newlatlong =
GeoTools.FindLineIntersection(
waypoints2.get(b), waypoints2.get(0), gridLine.p1, gridLine.p2);
}
if (newlatlong != null) {
crosses++;
if (closestDistance > GeoTools.getDistance(gridLine.p1, newlatlong)) {
closestPoint = new LatLng(newlatlong.latitude, newlatlong.longitude);
closestDistance = GeoTools.getDistance(gridLine.p1, newlatlong);
}
if (farestDistance < GeoTools.getDistance(gridLine.p1, newlatlong)) {
farestPoint = new LatLng(newlatlong.latitude, newlatlong.longitude);
farestDistance = GeoTools.getDistance(gridLine.p1, newlatlong);
}
}
}
switch (crosses) {
case 0:
case 1:
break;
default: // TODO handle multiple crossings in a better way
case 2:
hatchLines.add(new LineLatLng(closestPoint, farestPoint));
break;
}
}
return hatchLines;
}
private List<LatLng> sampleLine(LatLng from, LatLng to, double samplingDistance) {
List<LatLng> result = new ArrayList<LatLng>();
double heading = GeoTools.getHeadingFromCoordinates(from, to);
double totalLength = GeoTools.getDistance(from, to);
double distance = 0;
while (distance < totalLength) {
result.add(GeoTools.newCoordFromBearingAndDistance(from, heading, distance));
distance += samplingDistance;
}
return result;
}
/**
* Generates a list of waypoints from a list of hatch lines, choosing the best way to organize the
* mission. Uses the extreme points of the lines as waypoints.
*
* @param lastLocation The last location of the mission, used to chose where to start filling the
* polygon with the hatch
* @param altitude Altitude of the waypoints
* @param hatchLines List of lines to be ordered and added
*/
private List<waypoint> waypointsFromHatch(
LatLng lastLocation, Double altitude, List<LineLatLng> hatchLines) {
List<waypoint> gridPoints = new ArrayList<waypoint>();
LineLatLng closest = GeoTools.findClosestLine(lastLocation, hatchLines);
LatLng lastpnt;
if (GeoTools.getDistance(closest.p1, lastLocation)
< GeoTools.getDistance(closest.p2, lastLocation)) {
lastpnt = closest.p1;
} else {
lastpnt = closest.p2;
}
while (hatchLines.size() > 0) {
if (GeoTools.getDistance(closest.p1, lastpnt) < GeoTools.getDistance(closest.p2, lastpnt)) {
gridPoints.add(new waypoint(closest.p1, altitude));
gridPoints.add(new waypoint(closest.p2, altitude));
lastpnt = closest.p2;
hatchLines.remove(closest);
if (hatchLines.size() == 0) break;
closest = GeoTools.findClosestLine(closest.p2, hatchLines);
} else {
gridPoints.add(new waypoint(closest.p2, altitude));
gridPoints.add(new waypoint(closest.p1, altitude));
lastpnt = closest.p1;
hatchLines.remove(closest);
if (hatchLines.size() == 0) break;
closest = GeoTools.findClosestLine(closest.p1, hatchLines);
}
}
return gridPoints;
}