public KdTreeStrategy(IEnumerable <IP> points, ILog2 log = null) { _log = log ?? new NoLog(); var vectors = points.Select(p => new DenseVector(new[] { p.X, p.Y })).ToList(); Tree = KdTree <Vector <double>, double> .Construct(2, vectors.ToArray()); }
public Algorithm( IPoints points, IRectangle rect, StrategyType type = StrategyType.Grid, ILog2 log = null) { _log = log ?? new NoLog(); Rectangle = rect; Points = points.Data; Singles = new List<IP>(); Knn = new NearestNeighbor(); GridContainer = new GridContainer(Rectangle, Points); switch (type) { case StrategyType.Naive: Strategy = new NaiveStrategy(_log); break; case StrategyType.Grid: Strategy = new GridStrategy(_log); break; case StrategyType.KdTree: Strategy = new KdTreeStrategy(Points); break; default: throw new NotImplementedException("Unknown strategy"); } //_log.Info(MethodBase.GetCurrentMethod(), "object init"); }
public Algorithm( IPoints points, IRectangle rect, StrategyType type = StrategyType.Grid, ILog2 log = null) { _log = log ?? new NoLog(); Rectangle = rect; Points = points.Data; Singles = new List <IP>(); Knn = new NearestNeighbor(); GridContainer = new GridContainer(Rectangle, Points); switch (type) { case StrategyType.Naive: Strategy = new NaiveStrategy(_log); break; case StrategyType.Grid: Strategy = new GridStrategy(_log); break; case StrategyType.KdTree: Strategy = new KdTreeStrategy(Points); break; default: throw new NotImplementedException("Unknown strategy"); } //_log.Info(MethodBase.GetCurrentMethod(), "object init"); }
void Application_Start(object sender, EventArgs e) { _log = new NoLog(); // Log4Net(); _log.Info(MethodBase.GetCurrentMethod(), "Init"); // Init Google Maps Clustering GmcInit.Init(HttpContext.Current.Server.MapPath("~") + @"\AreaGMC\Files\Points.csv"); RegisterRoutes(); }
public GridStrategy(ILog2 log = null) { _log = log ?? new NoLog(); }
public Account(ILog2 log) { this.log = log; }
public KdTreeStrategy(IEnumerable<IP> points, ILog2 log = null) { _log = log ?? new NoLog(); var vectors = points.Select(p => new DenseVector(new[] { p.X, p.Y })).ToList(); Tree = KdTree<Vector<double>, double>.Construct(2, vectors.ToArray()); }
public NaiveStrategy(ILog2 log = null) { _log = log ?? new NoLog(); }