在绘制图表时,有哪些最先进的重叠技术? (最好与图西兹有关) 还有任何现有的软件,能够以纸面方式绘制图表?
当前布局 - http://www.evecakes.com/doodles/master.gif
在左上角的粉色部分看起来很好，而淡蓝色部分存在一些可以避免的边缘重叠。
对于一般的图形，确定具有最少交叉边的平面图布局（交叉数）的问题是NP难的。因此，使用了一些启发式方法（例如基于力的布局算法）。
以下页面简要介绍了Graphviz算法，并提供了一些使用它们获益的建议。 它还包含指向PDF文件的链接，这些文件应该包含有关算法的更多信息：
将此翻译成中文：http://rss.acs.unt.edu/Rdoc/library/Rgraphviz/html/GraphvizLayouts.html http://rss.acs.unt.edu/Rdoc/library/Rgraphviz/html/GraphvizLayouts.html
希望有所帮助。
The following open source Java library has a couple of algorithms which may help in laying out planar graphs. https://github.com/trickl/trickl-graph
尤其是,以下课程为解决这一问题提供了分析性解决办法:
ChrobakPayneLayout (based on the Boost C++ implementation by Aaron Windsor) http://www.boost.org/doc/libs/1_37_0/libs/graph/doc/straight_line_drawing.html
)：基于无锚点分布式定位技术的无缝布局。
你可能想要做的是使用这样的东西作为第一次“尝试”，确保没有重叠，尽管可能不太好看。然后，您可以应用力导向算法，以更公平地将节点空间分开。
不幸的是，这个库刚刚发布，所以文档很少。然而，它可能通过提供一些真实的代码而不仅仅是理论而有用。
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...
