论文标题
部分可观测时空混沌系统的无模型预测
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
论文作者
论文摘要
在平面汇合的正交图（PCOD）中，有向图（Digraph）的顶点作为平面的点绘制为点，边缘为正交polylines，从垂直段开始，并以水平段结尾。边缘可能在其第一个或最后一个段重叠，但不得与其他相交。 PCOD可以看作是坎廷斯基图纸的有向变体，也可以看作是挖掘纸的平面L绘制。边缘中的最大细分顶点数为拆分复杂度。如果每一个边缘以单调增加的y坐标绘制，则PCOD将向上向上，如果没有边缘以减小Y坐标为单位，则准上的Quasi向上。我们研究PCOD和（准）向上PCOD的分裂复杂性，用于各种图形。
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may overlap in their first or last segment, but must not intersect otherwise. PCODs can be seen as a directed variant of Kandinsky drawings or as planar L-drawings of subdivisions of digraphs. The maximum number of subdivision vertices in an edge is then the split complexity. A PCOD is upward if each edge is drawn with monotonically increasing y-coordinates and quasi-upward if no edge starts with decreasing y-coordinates. We study the split complexity of PCODs and (quasi-)upward PCODs for various classes of graphs.
