Ejemplo n.º 1
0
 ///<summary>
 /// Computes the Euclidean distance (L2 metric) from a <see cref="Coordinate"/> to a <see cref="IGeometry"/>.
 ///</summary>
 /// <param name="geom">The geometry</param>
 /// <param name="pt">The Point</param>
 /// <param name="ptDist">The <c>PointPairDistance</c></param>
 public static void ComputeDistance(IGeometry geom, Coordinate pt, PointPairDistance ptDist)
 {
     if (geom is ILineString)
     {
         ComputeDistance((ILineString)geom, pt, ptDist);
     }
     else if (geom is IPolygon)
     {
         ComputeDistance((IPolygon)geom, pt, ptDist);
     }
     else if (geom is IGeometryCollection)
     {
         var gc = (IGeometryCollection)geom;
         for (var i = 0; i < gc.NumGeometries; i++)
         {
             var g = gc.GetGeometryN(i);
             ComputeDistance(g, pt, ptDist);
         }
     }
     else
     {
         // assume geom is Point
         ptDist.SetMinimum(geom.Coordinate, pt);
     }
 }
Ejemplo n.º 2
0
 ///<summary>
 /// Computes the Euclidean distance (L2 metric) from a <see cref="Coordinate"/> to a <see cref="Polygon"/>.
 ///</summary>
 /// <param name="poly">The <c>Polygon</c></param>
 /// <param name="pt">The Point</param>
 /// <param name="ptDist">The <c>PointPairDistance</c></param>
 public static void ComputeDistance(IPolygon poly, Coordinate pt, PointPairDistance ptDist)
 {
     ComputeDistance(poly.ExteriorRing, pt, ptDist);
     for (var i = 0; i < poly.NumInteriorRings; i++)
     {
         ComputeDistance(poly.GetInteriorRingN(i), pt, ptDist);
     }
 }
Ejemplo n.º 3
0
        ///<summary>
        /// Computes the Euclidean distance (L2 metric) from a <see cref="Coordinate"/> to a <see cref="ILineString"/>.
        ///</summary>
        /// <param name="line">The <c>LineString</c></param>
        /// <param name="pt">The Point</param>
        /// <param name="ptDist">The <c>PointPairDistance</c></param>
        public static void ComputeDistance(ILineString line, Coordinate pt, PointPairDistance ptDist)
        {
            var coords      = line.Coordinates;
            var tempSegment = new LineSegment();

            for (var i = 0; i < coords.Length - 1; i++)
            {
                tempSegment.SetCoordinates(coords[i], coords[i + 1]);
                // this is somewhat inefficient - could do better
                var closestPt = tempSegment.ClosestPoint(pt);
                ptDist.SetMinimum(closestPt, pt);
            }
        }
Ejemplo n.º 4
0
        private void ComputeOrientedDistance(IGeometry discreteGeom, IGeometry geom, PointPairDistance ptDist)
        {
            var distFilter = new MaxPointDistanceFilter(geom);

            discreteGeom.Apply(distFilter);
            ptDist.SetMaximum(distFilter.MaxPointDistance);

            if (_densifyFrac > 0)
            {
                var fracFilter = new MaxDensifiedByFractionDistanceFilter(geom, _densifyFrac);
                discreteGeom.Apply(fracFilter);
                ptDist.SetMaximum(fracFilter.MaxPointDistance);
            }
        }
Ejemplo n.º 5
0
 public void SetMinimum(PointPairDistance ptDist)
 {
     SetMinimum(ptDist._pt[0], ptDist._pt[1]);
 }
Ejemplo n.º 6
0
        ///<summary>
        /// Computes the Euclidean distance (L2 metric) from a <see cref="Coordinate"/> to a <see cref="LineSegment"/>.
        ///</summary>
        /// <param name="segment">The <c>LineSegment</c></param>
        /// <param name="pt">The Point</param>
        /// <param name="ptDist">The <c>PointPairDistance</c></param>
        public static void ComputeDistance(LineSegment segment, Coordinate pt, PointPairDistance ptDist)
        {
            var closestPt = segment.ClosestPoint(pt);

            ptDist.SetMinimum(closestPt, pt);
        }