I know how to do a easier variation of this problem, is not a simple problem, I think I can help you only with a start point... :)
1) Do you perceive that I can firstly calculate the shortest distance between 2 points based on lines and the rectangle edges, ok? You take all the paths with all arests that not are secant to the obstacles to point A to the desired point, and take the shortest. (If the problem was only this, was still not so simple) look first figure path_direct, You trace the shortest distance to 1 point to all others. 2) You substitute each vector in figure 1 by the X and Y components Figure 2: path_components 3) Line matching for minimal number of rects This part is on your own way :) I helped anything? This is not complete, or optimized, only a idea, but repair if you want to calculate only the total length of the lines, my representation is almost correct, you only need rearrange the segments :) I did included a .svg if it could help you to express your ideas. 2007/6/14, monu <[EMAIL PROTECTED]>: > > Please anyone help me.................. > > On 6/14/07, Monu Rathour < [EMAIL PROTECTED]> wrote: > > > > There are some rectangles and some pin-vertices's in a two dimensional > > plane. I have to join pin-vertices's such that lines are rectilinear and > > line should not cross over the rectangles. > > > > How to write a mathematical formula for calculating path length ? > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
<<inline: path_direct.png>>
<<inline: path_components.png>>
<<inline: geometry distance direct.svg>>
<<inline: geometry distance components.svg>>
