public static int CompareSitesDistances_MAX(Edge edge0, Edge edge1) { float length0 = edge0.SitesDistance(); float length1 = edge1.SitesDistance(); if (length0 < length1) { return(1); } if (length0 > length1) { return(-1); } return(0); }
public static int CompareSitesDistances_MAX(Edge edge0, Edge edge1) { float num = edge0.SitesDistance(); float num2 = edge1.SitesDistance(); if (num < num2) { return(1); } if (num > num2) { return(-1); } return(0); }
public List <Circle> Circles() { List <Circle> list = new List <Circle>(); for (int i = 0; i < _sites.Count; i++) { float radius = 0f; Edge edge = _sites[i].NearestEdge(); if (!edge.IsPartOfConvexHull()) { radius = edge.SitesDistance() * 0.5f; } list.Add(new Circle(_sites[i].x, _sites[i].y, radius)); } return(list); }
/* * * @return the largest circle centered at each site that fits in its region; * if the region is infinite, return a circle of radius 0. */ public List <Circle> Circles() { List <Circle> circles = new List <Circle>(); foreach (Site site in sites) { float radius = 0; Edge nearestEdge = site.NearestEdge(); if (!nearestEdge.IsPartOfConvexHull()) { radius = nearestEdge.SitesDistance() * 0.5f; } circles.Add(new Circle(site.x, site.y, radius)); } return(circles); }
/** * * @return the largest circle centered at each site that fits in its region; * if the region is infinite, return a circle of radius 0. * */ public List <Circle> Circles() { List <Circle> circles = new List <Circle> (); Site site; for (int i = 0; i < _sites.Count; i++) { site = _sites [i]; float radius = 0f; Edge nearestEdge = site.NearestEdge(); if (!nearestEdge.IsPartOfConvexHull()) { radius = nearestEdge.SitesDistance() * 0.5f; } circles.Add(new Circle(site.x, site.y, radius)); } return(circles); }
public static float CompareSitesDistancesMax(Edge edge0, Edge edge1) { float length0 = edge0.SitesDistance(); float length1 = edge1.SitesDistance(); if (length0 < length1) { return 1; } if (length0 > length1) { return -1; } return 0; }