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 DiscreteFrechetDistance Bresenham algorithm #783

Merged
merged 5 commits into from
Oct 14, 2021

Conversation

dr-jts
Copy link
Contributor

@dr-jts dr-jts commented Oct 13, 2021

This fixes a bug in the DiscreteFrechetDistance Bresenham algorithm for matrix diagonals which caused an ArrayIndexOutOfBoundsException when one geometry had more than twice the vertices of the other one.

It also simplifies the code to reflect the limited requirement of computing the diagonal of a matrix, rather than a general line.

Also included are Javadoc improvements, some renaming, and moving performance test classes into test.perf.algorithm.distance.

Signed-off-by: Martin Davis mtnclimb@gmail.com

@dr-jts
Copy link
Contributor Author

dr-jts commented Oct 13, 2021

@FObermaier Can you review this fix for #764 ?

Signed-off-by: Martin Davis <mtnclimb@gmail.com>
Signed-off-by: Martin Davis <mtnclimb@gmail.com>
Signed-off-by: Martin Davis <mtnclimb@gmail.com>
Signed-off-by: Martin Davis <mtnclimb@gmail.com>
Signed-off-by: Martin Davis <mtnclimb@gmail.com>
@dr-jts dr-jts merged commit 6486f15 into locationtech:master Oct 14, 2021
@dr-jts dr-jts deleted the fix-frechetdist-bresenham branch October 14, 2021 18:45
@jodygarnett jodygarnett added this to the 1.19.0 milestone Jun 21, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants