C# (CSharp) Algorithms RectHV.Intersects примеры использования

Intersects() публичный Метод

public Intersects ( RectHV that ) : bool
that	RectHV
Результат	bool

Пример #1

Файл: KdTree.cs Проект: beginor/practice

 private void Range(KdNode node, RectHV nrect, RectHV rect, Queue<Point2D> queue) {
     if (node == null) {
         return;
     }
     if (rect.Intersects(nrect)) {
         var p = new Point2D(node.X, node.Y);
         if (rect.Contains(p)) {
             queue.Enqueue(p);
         }
         Range(node.Left, LeftRect(nrect, node), rect, queue);
         Range(node.Right, RightRect(nrect, node), rect, queue);
     }
 }

Пример #2

 private void Range(KdNode node, RectHV nrect, RectHV rect, Queue <Point2D> queue)
 {
     if (node == null)
     {
         return;
     }
     if (rect.Intersects(nrect))
     {
         var p = new Point2D(node.X, node.Y);
         if (rect.Contains(p))
         {
             queue.Enqueue(p);
         }
         Range(node.Left, LeftRect(nrect, node), rect, queue);
         Range(node.Right, RightRect(nrect, node), rect, queue);
     }
 }