Algorithms

BillWoodruff wrote:

3. List set of rectangle pairs => all in rectangle array 'ra, which need to be 'connected' by 1-3 line segments.

BillWoodruff wrote:

Simplest case would be a straight line: two points; then three points for a path with one right-angle turn; and, finally four points for a path with two right-angle turns.

BillWoodruff wrote:

Where: intersections of lines are minimized.

// will compile .NET 4.0 Client
// rough sketch for Line 'primitive'
Public class ConnectingLine
{
   public Rectangle sourceRectangle { get; set; }
   public Rectangle sinkRectangle { get; set; }
   public List<Point> cPoints { get; set; }
}

// will compile .NET 4.0 Client
// rough sketch for Line Manager Class
public static class ConnectingLines
{
   // Line Collection
   static internal List<ConnectingLine> ConnectingLineList = new List<ConnectingLine>();

   // using automatic property initializers
   public static void Add(Rectangle r1, Rectangle r2, List<Point> lPts)
   {
     ConnectingLineList.Add(new ConnectingLine
     {
       sourceRectangle = r1, sinkRectangle = r2, cPoints = lPts
     });
   }
}

// 'hard-coded' simulation of a call to add a new connection ...
// case where a connection requires 4 points that define 3 lines
// stick this in a method and call it
// will compile .NET 4.0 Client. Execute in a method body and inspect results
  ConnectingLines.Add
  (
      new Rectangle (200, 200, 200, 200),
      new Rectangle (275, 500, 200, 200),
      new List<Point> {new Point (300,400), new Point(300,450), new Point(375, 450), new Point(375,500)}
  );

BillWoodruff wrote:

1. No two rectangles can be connected by more than one line between them, but every rectangle can be connected to all other rectangles it has not already connected to.

yogish293 wrote:

for this always we should know how much size is already installed/copied right...?