Voronoi.Algorithms.FortuneHelpers.Vector.Dist C# (CSharp) Method

        public static double Dist(Vector V1, Vector V2)
        {
            if(V1.Dim != V2.Dim)
                return -1;
            int i;
            double E = 0,D;
            for(i=0;i<V1.Dim;i++)
            {
                D=(V1[i]-V2[i]);
                E+=D*D;
            }
            return E;
        }

        public static VoronoiGraph FilterVG(VoronoiGraph VG, double minLeftRightDist)
        {
            VoronoiGraph VGErg = new VoronoiGraph();

            foreach (VoronoiEdge VE in VG.Edges)
            {
                if (Math.Sqrt(Vector.Dist(VE.LeftData, VE.RightData)) >= minLeftRightDist)
                {
                    VGErg.Edges.Add(VE);
                }
            }
            foreach (VoronoiEdge VE in VGErg.Edges)
            {
                VGErg.Vertizes.Add(VE.VVertexA);
                VGErg.Vertizes.Add(VE.VVertexB);
            }
            return(VGErg);
        }