public class VertexHausdorffDistance
extends java.lang.Object
NOTE: This algorithm does NOT compute the full Hausdorff distance correctly, but an approximation that is correct for a large subset of useful cases. One important part of this subset is Linestrings that are roughly parallel to each other, and roughly equal in length - just what is needed for line matching.
Modifier and Type | Class and Description |
---|---|
static class |
VertexHausdorffDistance.MaxPointDistanceFilter |
Constructor and Description |
---|
VertexHausdorffDistance(com.vividsolutions.jts.geom.Geometry g0,
com.vividsolutions.jts.geom.Geometry g1) |
VertexHausdorffDistance(com.vividsolutions.jts.geom.LineSegment seg0,
com.vividsolutions.jts.geom.LineSegment seg1) |
Modifier and Type | Method and Description |
---|---|
double |
distance() |
static double |
distance(com.vividsolutions.jts.geom.Geometry g0,
com.vividsolutions.jts.geom.Geometry g1) |
com.vividsolutions.jts.geom.Coordinate[] |
getCoordinates() |
public VertexHausdorffDistance(com.vividsolutions.jts.geom.Geometry g0, com.vividsolutions.jts.geom.Geometry g1)
public VertexHausdorffDistance(com.vividsolutions.jts.geom.LineSegment seg0, com.vividsolutions.jts.geom.LineSegment seg1)