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); }
bool MyTestHullEdges(Edge edge, int index, List <Edge> vector) { return(edge.IsPartOfConvexHull()); }
bool MyTestHullEdges(Edge edge, int index, List<Edge> vector) { return (edge.IsPartOfConvexHull()); }