From ae20a3207e0e3f058f8609aae9d7f191cf1e65a0 Mon Sep 17 00:00:00 2001
From: Luc Maisonobe <luc@orekit.org>
Date: Fri, 25 Apr 2014 17:09:02 +0200
Subject: [PATCH] Removed a check that is not needed anymore.
The indices are now checked at caller level.
---
.../orekit/rugged/core/duvenhage/DuvenhageAlgorithm.java | 7 -------
1 file changed, 7 deletions(-)
diff --git a/src/main/java/org/orekit/rugged/core/duvenhage/DuvenhageAlgorithm.java b/src/main/java/org/orekit/rugged/core/duvenhage/DuvenhageAlgorithm.java
index 33e38ea7..ea9cf9c2 100644
--- a/src/main/java/org/orekit/rugged/core/duvenhage/DuvenhageAlgorithm.java
+++ b/src/main/java/org/orekit/rugged/core/duvenhage/DuvenhageAlgorithm.java
@@ -174,13 +174,6 @@ public class DuvenhageAlgorithm implements IntersectionAlgorithm {
throw RuggedException.createInternalError(null);
}
- if (FastMath.min(entryLat, exitLat) < 0 || FastMath.max(entryLat, exitLat) >= tile.getLatitudeRows() ||
- FastMath.min(entryLon, exitLon) < 0 || FastMath.max(entryLon, exitLon) >= tile.getLongitudeColumns()) {
- // search segment is outside of tile (probably due to the 1 offset with respect
- // to a boundary crossing index when splitting line-of-sight in the caller
- return null;
- }
-
if (entryLat == exitLat && entryLon == exitLon) {
// we have narrowed the search down to a single Digital Elevation Model pixel
GeodeticPoint intersection = tile.pixelIntersection(entry, ellipsoid.convertLos(entry, los),
--
GitLab