Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix Distance3Dop geometries order #480

Merged
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@
* The distance computation also finds a pair of points in the input geometries
* which have the minimum distance between them. If a point lies in the interior
* of a line segment, the coordinate computed is a close approximation to the
* exact point.
* exact point for X and Y ordinates. Z ordinate is not interpolated.
* <p>
* The algorithms used are straightforward O(n^2) comparisons. This worst-case
* performance could be improved on by using Voronoi techniques or spatial
Expand Down Expand Up @@ -189,7 +189,7 @@ private void computeMinDistance() {
minDistanceLocation = new GeometryLocation[2];

int geomIndex = mostPolygonalIndex();
boolean flip = geomIndex == 0;
boolean flip = geomIndex == 1;
computeMinDistanceMultiMulti(geom[geomIndex], geom[1-geomIndex], flip);
}

Expand Down
Loading