|
|
Orchid XP v8 wrote:
> Amusingly, many of the algorithmic steps appear to be identical to what
> I came up with myself. What I don't have is a special
> algorithmic stage to rearrange the nodes (since I explicitly don't
> *want* their horizontal positioning rearranged for these particular
> graphs), and a stage for properly routing the edges (which is why they
> keep intersecting things).
Mmm, how ingenious. They add extra "invisible" nodes to each row that an
edge passes through, and then jiggle the invisible nodes around as a
means for deciding how to route the edge.
Of course, they then apply a complex algorithm to decide exactly how to
produce the best possible spline path through the general area reserved.
I doubt I'll go to that much trouble. But I could certainly use
invisible nodes to avoid unecessary intersections...
Post a reply to this message
|
|