any idea to solve this problem

i have those lines, and i want to cross each three lines (three closest) with another line

i can´t figure how to make it, but still working on it, if any of you have an idea...........

Replies to This Discussion

Permalink Reply by David Rutten on June 23, 2012 at 2:43am

I'm not ignoring you, but I don't have a way of solving this. In fact it's not even possible to solve in some cases as three nearest lines might be positioned like this

which does not allow you to draw a single line that intersects them all. I'm also not certain what the metric for "closest" would be if you have more than three lines all intersecting each other. What groups of three can you find here:

This is not just splitting hairs, when designing a new algorithm it is important to always figure out whether:

There is ever a case with more than one possible solution.
There is ever a case with no possible solutions.
Does the algorithm change the state of the problem while it runs, i.e. whether run order matters.

David Rutten

david@mcneel.com

Poprad, Slovakia

Permalink Reply by jorge sainz de aja on June 23, 2012 at 6:15am

thank you david for the response, i also think that there is no a solution for this, i will try to skipe this steep and solve this by finding another way with an structure analisys................................

RSS