| 第12行： |
第12行： |
| | | | |
| | | | |
| − | '''<font color="#ff8000">图的绘制 Graph Drawing</font>'''是 '''<font color="#ff8000">数学 Mathematics</font>''' 和 '''<font color="#ff8000">计算机科学 Computer Science</font>'''的一个交叉领域，它结合了'''<font color="#ff8000">几何图形理论 Geometric Graph Theory</font>'''和 '''<font color="#ff8000">信息可视化 Information Visualization</font>'''的方法，可以用于对来自社会网络分析、制图学、语言学和生物信息学等各种应用场景进行二维描述。 | + | '''图的绘制 Graph Drawing'''是数学和计算机科学的一个交叉领域，它结合了'''[[几何图形理论 geometric graph theory</font>]]'''和 '''[[信息可视化 information visualization]]'''的方法，可以用于对来自社会网络分析、制图学、语言学和生物信息学等各种应用场景进行二维描述。 |
| | | | |
| | | | |
| | + | 图形或'''[[网络图 network diagram]]'''的绘制是通过从图形抽象出的顶点和边表示的。这里说的图不应与图形本身混淆：毫不相似的图可以对应于同一个图形。<ref name="dett6">{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, p. 6.</ref>抽象地说，重要的是哪一对顶点是由边连在一起。然而，在具体的绘图中，这些顶点和边的排列影响了它的可理解性、可用性、制造成本和美学。<ref name="dett-viii"/>如果图形通过添加和删除边缘（动态绘制图形）而随时间变化，并且目的是保存用户的心理映射，那么问题会变得更糟糕。<ref>{{harvtxt|Misue|Eades|Lai|Sugiyama|1995}}</ref> |
| | | | |
| − | A drawing of a graph or '''network diagram''' is a pictorial representation of the [[vertex (graph theory)|vertices]] and [[edge (graph theory)|edges]] of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph.<ref name="dett6">{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, p. 6.</ref> In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and [[aesthetics]].<ref name="dett-viii"/> The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map.<ref>{{harvtxt|Misue|Eades|Lai|Sugiyama|1995}}</ref>
| |
| | | | |
| − | A drawing of a graph or network diagram is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph. In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics.The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map.
| |
| | | | |
| − | 图形或'''<font color="#ff8000">网络图 Network Diagram</font>'''的绘制是通过从图形抽象出的顶点和边表示的。这里说的图不应与图形本身混淆: 毫不相似的图可以对应于同一个图形。抽象地说，重要的是哪一对顶点是由边连在一起。然而，在具体的绘图中，这些顶点和边的排列影响了它的可理解性、可用性、制造成本和美学。如果图形通过添加和删除边缘(动态绘制图形)而随时间变化，并且目的是保存用户的心理映射，那么问题会变得更糟糕。
| + | ==绘图惯例 Graphical conventions== |
| | | | |
| | + | [[File:4node-digraph-natural.svg|thumb|upright=0.5|图2：带箭头显示边方向的[[有向图]]]] |
| | | | |
| | + | 图经常绘制成节点链接图，其中顶点可以是为圆框、方框或文本标签，边表示为'''<font color="#ff8000">欧式平面 Euclidean Plane</font>'''上的线段、折线或曲线。<ref name="dett-viii">{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, p. viii.</ref>节点链接图可以追溯到13世纪雷蒙·卢尔 Ramon Llull的作品，他为得到'''完全图'''，绘制了这种类型的图，以便分析形而上学概念集合之间的所有成对组合。<ref>{{citation|contribution=Two thousand years of combinatorics|first=Donald E.|last=Knuth|authorlink=Donald Knuth|pages=7–37|title=Combinatorics: Ancient and Modern|publisher=Oxford University Press|year=2013|editor1-first=Robin|editor1-last=Wilson|editor2-first=John J.|editor2-last=Watkins}}.</ref> |
| | | | |
| − | ==Graphical conventions 画图公约==
| |
| − |
| |
| − | [[File:4node-digraph-natural.svg|thumb|upright=0.5|
| |
| − | 图2：[[Directed graph]] with arrowheads showing edge directions 带箭头显示边方向的有向图]]
| |
| − |
| |
| − |
| |
| − |
| |
| − | Graphs are frequently drawn as node–link diagrams in which the vertices are represented as disks, boxes, or textual labels and the edges are represented as [[line segment]]s, [[Polygonal chain|polylines]], or curves in the [[Euclidean plane]].<ref name="dett-viii">{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, p. viii.</ref> Node–link diagrams can be traced back to the 13th century work of [[Ramon Llull]], who drew diagrams of this type for [[complete graph]]s in order to analyze all pairwise combinations among sets of metaphysical concepts.<ref>{{citation|contribution=Two thousand years of combinatorics|first=Donald E.|last=Knuth|authorlink=Donald Knuth|pages=7–37|title=Combinatorics: Ancient and Modern|publisher=Oxford University Press|year=2013|editor1-first=Robin|editor1-last=Wilson|editor2-first=John J.|editor2-last=Watkins}}.</ref>
| |
| − |
| |
| − | Graphs are frequently drawn as node–link diagrams in which the vertices are represented as disks, boxes, or textual labels and the edges are represented as line segments, polylines, or curves in the Euclidean plane. Node–link diagrams can be traced back to the 13th century work of Ramon Llull, who drew diagrams of this type for complete graphs in order to analyze all pairwise combinations among sets of metaphysical concepts.
| |
| − |
| |
| − | 图经常绘制成节点链接图，其中顶点可以是为圆盘、框或文本标签，边表示为'''<font color="#ff8000">欧几里德平面 Euclidean Plane</font>'''上的'''<font color="#ff8000">线段 Line Segments</font>'''、'''<font color="#ff8000">折线 Polylines</font>'''或曲线。节点链接图可以追溯到13世纪雷蒙 · 卢尔的作品，他为得到完全图，绘制了这种类型的图，以便分析形而上学概念集合之间的所有成对组合。
| |
| − |
| |
| − |
| |
| − |
| |
| − | In the case of [[directed graph]]s, [[Arrow (symbol)|arrowheads]] form a commonly used graphical convention to show their [[Orientability|orientation]];<ref name="dett6"/> however, user studies have shown that other conventions such as tapering provide this information more effectively.<ref>{{harvtxt|Holten|van Wijk|2009}}; {{harvtxt|Holten|Isenberg|van Wijk|Fekete|2011}}.</ref> [[Upward planar drawing]] uses the convention that every edge is oriented from a lower vertex to a higher vertex, making arrowheads unnecessary.<ref>{{harvtxt|Garg|Tamassia|1995}}.</ref>
| |
| − |
| |
| − | In the case of directed graphs, arrowheads form a commonly used graphical convention to show their orientation; Upward planar drawing uses the convention that every edge is oriented from a lower vertex to a higher vertex, making arrowheads unnecessary.
| |
| − |
| |
| − | 在'''<font color="#ff8000">有向图 Directed Graphs</font>'''的情况下，'''<font color="#ff8000">箭头 Arrowheads</font>'''我们规定它们的方向; '''<font color="#ff8000">在向上平面绘图中 Upward Planar Drawing</font>'''：每个边都从较低的顶点定向到较高的顶点，由此，就不再需要箭头指明方向。
| |
| | | | |
| | + | 在[[有向图]]中，绘图惯例规定用箭头表示它们的方向；<ref name="dett6"/> 然而，用户研究表明，其他惯例（例如，渐缩）可以更有效地提供此信息。<ref>{{harvtxt|Holten|van Wijk|2009}}; {{harvtxt|Holten|Isenberg|van Wijk|Fekete|2011}}.</ref>向上的平面绘图绘图惯例是，每个边都从较低的顶点定向到较高的顶点，从而不需要箭头。<ref>{{harvtxt|Garg|Tamassia|1995}}.</ref> |
| | | | |
| | | | |
| 第51行： |
第33行： |
| | Alternative conventions to node–link diagrams include adjacency representations such as circle packings, in which vertices are represented by disjoint regions in the plane and edges are represented by adjacencies between regions; intersection representations in which vertices are represented by non-disjoint geometric objects and edges are represented by their intersections; visibility representations in which vertices are represented by regions in the plane and edges are represented by regions that have an unobstructed line of sight to each other; confluent drawings, in which edges are represented as smooth curves within mathematical train tracks; fabrics, in which nodes are represented as horizontal lines and edges as vertical lines; and visualizations of the adjacency matrix of the graph. | | Alternative conventions to node–link diagrams include adjacency representations such as circle packings, in which vertices are represented by disjoint regions in the plane and edges are represented by adjacencies between regions; intersection representations in which vertices are represented by non-disjoint geometric objects and edges are represented by their intersections; visibility representations in which vertices are represented by regions in the plane and edges are represented by regions that have an unobstructed line of sight to each other; confluent drawings, in which edges are represented as smooth curves within mathematical train tracks; fabrics, in which nodes are represented as horizontal lines and edges as vertical lines; and visualizations of the adjacency matrix of the graph. |
| | | | |
| − | 节点链接图可被其他画图方式替代，包括邻接表示法，如'''<font color="#ff8000">圆填充 Circle Packings</font>'''，其中顶点表示为平面上不相交的区域，边表示为区域之间的邻接; '''<font color="#ff8000">交点表示 Intersection representations</font>'''，其中顶点由非相交的几何对象表示，而边由其交点表示；可见性：其中顶点由平面中的区域表示，边由彼此无视线障碍的区域表示; 汇流图，其中边表示为数学轨迹上的光滑曲线; 连接物，其中顶点表示为水平线，边表示为垂直线; 以及图形'''<font color="#ff8000">邻接矩阵 Adjiacency Matrix</font>'''的可视化结点。
| + | 节点链接图的替代约定包括邻接表示，例如圆堆积，其中，顶点由平面中的不相交区域表示，边缘由区域之间的邻接表示； 交点表示，其中顶点由不相交的几何对象表示，而边线由其交点表示； 可见性表示，其中顶点由平面中的区域表示，边缘由彼此无障碍视线的区域表示； 融合图，其中边缘表示为数学火车轨道内的平滑曲线； 织物，其中节点表示为水平线，边缘表示为垂直线； 以及图表的邻接矩阵的可视化。 |
| | + | |
| | + | 节点链接图的替代绘制替代，包括邻接表示法，如'''圆填充 Circle Packings'''，其中，顶点表示为平面上不相交的区域，边表示为区域之间的邻接； '''<font color="#ff8000">交点表示 Intersection representations</font>'''，其中顶点由非相交的几何对象表示，而边由其交点表示；可见性：其中顶点由平面中的区域表示，边由彼此无视线障碍的区域表示; 汇流图，其中边表示为数学轨迹上的光滑曲线; 连接物，其中顶点表示为水平线，边表示为垂直线; 以及图形'''<font color="#ff8000">邻接矩阵 Adjiacency Matrix</font>'''的可视化结点。 |
| | | | |
| − | ==Quality measures 质量度量== | + | == 质量度量 Quality measures== |
| | | | |
| | Many different quality measures have been defined for graph drawings, in an attempt to find objective means of evaluating their aesthetics and usability.<ref>{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, Section 2.1.2, Aesthetics, pp. 14–16; {{harvtxt|Purchase|Cohen|James|1997}}.</ref> In addition to guiding the choice between different layout methods for the same graph, some layout methods attempt to directly optimize these measures. | | Many different quality measures have been defined for graph drawings, in an attempt to find objective means of evaluating their aesthetics and usability.<ref>{{harvtxt|Di Battista|Eades|Tamassia|Tollis|1994}}, Section 2.1.2, Aesthetics, pp. 14–16; {{harvtxt|Purchase|Cohen|James|1997}}.</ref> In addition to guiding the choice between different layout methods for the same graph, some layout methods attempt to directly optimize these measures. |
| 第228行： |
第212行： |
| | Edraw Max 2D商业技术制图软件 | | Edraw Max 2D商业技术制图软件 |
| | | | |
| − | ==References 参考文献== | + | ==考文献== |
| | | | |
| | ;Footnotes | | ;Footnotes |
| 第237行： |
第221行： |
| | | | |
| | {{reflist|colwidth=30em}} | | {{reflist|colwidth=30em}} |
| − |
| |
| − |
| |
| − |
| |
| − | ;General references
| |
| − |
| |
| − | General references
| |
| | | | |
| | 一般参考资料 | | 一般参考资料 |
| 第248行： |
第226行： |
| | {{refbegin|colwidth=30em}} | | {{refbegin|colwidth=30em}} |
| | | | |
| − | *{{citation | + | *{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | last3 = Tamassia | first3 = Roberto | last4 = Tollis | first4 = Ioannis G. | journal =Computational Geometry: Theory and Applications | pages = 235–282 | title = Algorithms for Drawing Graphs: an Annotated Bibliography| url = http://www.cs.brown.edu/people/rt/gd.html| volume = 4 | issue = 5 |
| − | | |
| − | | last1 = Di Battista | first1 = Giuseppe
| |
| − | | |
| − | | last1 = Di Battista | first1 = Giuseppe
| |
| − | | |
| − | 最后1个 Di Battista 最初1个 Giuseppe
| |
| − | | |
| − | | last2 = Eades | first2 = Peter | author2-link = Peter Eades
| |
| − | | |
| − | | last2 = Eades | first2 = Peter | author2-link = Peter Eades
| |
| − | | |
| − | 作者: 彼得 · 艾德斯
| |
| − | | |
| − | | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia
| |
| − | | |
| − | | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia
| |
| − | | |
| − | | last 3 Tamassia | first3 Roberto | author3-link Roberto Tamassia
| |
| − | | |
| − | | last4 = Tollis | first4 = Ioannis G.
| |
| − | | |
| − | | last4 = Tollis | first4 = Ioannis G. | |
| − | | |
| − | 4 | last 4 Tollis | first4 Ioannis g.
| |
| − | | |
| − | | journal = [[Computational Geometry (journal)|Computational Geometry: Theory and Applications]]
| |
| − | | |
| − | | journal = Computational Geometry: Theory and Applications
| |
| − | | |
| − | 计算几何: 理论与应用
| |
| − | | |
| − | | pages = 235–282
| |
| − | | |
| − | | pages = 235–282
| |
| − | | |
| − | 第235-282页
| |
| − | | |
| − | | title = Algorithms for Drawing Graphs: an Annotated Bibliography
| |
| − | | |
| − | | title = Algorithms for Drawing Graphs: an Annotated Bibliography
| |
| − | | |
| − | 图形绘制的算法: 附有注释的参考书目
| |
| − | | |
| − | | url = http://www.cs.brown.edu/people/rt/gd.html
| |
| − | | |
| − | | url = http://www.cs.brown.edu/people/rt/gd.html
| |
| − | | |
| − | Http://www.cs.brown.edu/people/rt/gd.html
| |
| − | | |
| − | | volume = 4
| |
| − | | |
| − | | volume = 4
| |
| − | | |
| − | 第四卷
| |
| − | | |
| − | | issue = 5
| |
| − | | |
| − | | issue = 5
| |
| − | | |
| − | 第五期
| |
| − | | |
| − | | year = 1994 | doi=10.1016/0925-7721(94)00014-x}}.
| |
| − | | |
| | | year = 1994 | doi=10.1016/0925-7721(94)00014-x}}. | | | year = 1994 | doi=10.1016/0925-7721(94)00014-x}}. |
| − | | + | *{{citation | last1 = Di Battista | first1 = Giuseppe | last2 = Eades | first2 = Peter | | last3 = Tamassia | first3 = Roberto | | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia | last4 = Tollis | first4 = Ioannis G. | isbn = 978-0-13-301615-4 | publisher = Prentice Hall | title = Graph Drawing: Algorithms for the Visualization of Graphs | year = 1998}}. |
| − | 1994年 | doi 10.1016 / 0925-7721(94)00014-x }。
| + | *{{citation | doi = 10.1109/2945.841119| last1 = Herman | first1 = Ivan | last2 = Melançon | first2 = Guy | last3 = Marshall | first3 = M. Scott | journal = IEEE Transactions on Visualization and Computer Graphics | pages = 24–43| title = Graph Visualization and Navigation in Information Visualization: A Survey | issue = 1 | volume = 6 | year = 2000 }}. |
| − | | + | *{{citation | last1 = Jünger | first1 = Michael | last2 = Mutzel | first2 = Petra | isbn = 978-3-540-00881-1 | publisher = Springer-Verlag| title = Graph Drawing Software | year = 2004}}. |
| − | *{{citation | + | citation|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|publisher=Springer-Verlag|series=[[Lecture Notes in Computer Science]]|volume=2025|year=2001|doi=10.1007/3-540-44969-8|isbn=978-3-540-42062-0}}. |
| − | | + | citation|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|url=http://cs.brown.edu/~rt/gdhandbook/|year=2014|access-date=2013-08-28|archive-url=https://web.archive.org/web/20130815181243/http://cs.brown.edu/~rt/gdhandbook/|archive-date=2013-08-15|url-status=dead}}. |
| − | | last1 = Di Battista | first1 = Giuseppe
| |
| − | | |
| − | | last1 = Di Battista | first1 = Giuseppe
| |
| − | | |
| − | 最后1个 Di Battista 最初1个 Giuseppe
| |
| − | | |
| − | | last2 = Eades | first2 = Peter | author2-link = Peter Eades
| |
| − | | |
| − | | last2 = Eades | first2 = Peter | author2-link = Peter Eades
| |
| − | | |
| − | 作者: 彼得 · 艾德斯
| |
| − | | |
| − | | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia
| |
| − | | |
| − | | last3 = Tamassia | first3 = Roberto | author3-link = Roberto Tamassia | |
| − | | |
| − | | last 3 Tamassia | first3 Roberto | author3-link Roberto Tamassia
| |
| − | | |
| − | | last4 = Tollis | first4 = Ioannis G.
| |
| − | | |
| − | | last4 = Tollis | first4 = Ioannis G.
| |
| − | | |
| − | 4 | last 4 Tollis | first4 Ioannis g.
| |
| − | | |
| − | | isbn = 978-0-13-301615-4
| |
| − | | |
| − | | isbn = 978-0-13-301615-4
| |
| − | | |
| − | | isbn 978-0-13-301615-4
| |
| − | | |
| − | | publisher = [[Prentice Hall]]
| |
| − | | |
| − | | publisher = Prentice Hall
| |
| − | | |
| − | 出版商 Prentice Hall
| |
| − | | |
| − | | title = Graph Drawing: Algorithms for the Visualization of Graphs
| |
| − | | |
| − | | title = Graph Drawing: Algorithms for the Visualization of Graphs
| |
| − | | |
| − | 图形绘制: 图形可视化的算法
| |
| − | | |
| − | | year = 1998}}.
| |
| − | | |
| − | | year = 1998}}.
| |
| − | | |
| − | 1998年。
| |
| − | | |
| − | *{{citation | |
| − | | |
| − | | doi = 10.1109/2945.841119
| |
| − | | |
| − | | doi = 10.1109/2945.841119
| |
| − | | |
| − | 10.1109 / 2945.841119
| |
| − | | |
| − | | last1 = Herman | first1 = Ivan
| |
| − | | |
| − | | last1 = Herman | first1 = Ivan
| |
| − | | |
| − | 最后1个赫尔曼最初1个伊凡
| |
| − | | |
| − | | last2 = Melançon | first2 = Guy
| |
| − | | |
| − | | last2 = Melançon | first2 = Guy
| |
| − | | |
| − | 最后2个梅兰，最初2个盖伊
| |
| − | | |
| − | | last3 = Marshall | first3 = M. Scott
| |
| − | | |
| − | | last3 = Marshall | first3 = M. Scott
| |
| − | | |
| − | 3 m · 斯科特
| |
| − | | |
| − | | journal = IEEE Transactions on Visualization and Computer Graphics
| |
| − | | |
| − | | journal = IEEE Transactions on Visualization and Computer Graphics
| |
| − | | |
| − | 可视化与计算机图形学科学杂志
| |
| − | | |
| − | | pages = 24–43
| |
| − | | |
| − | | pages = 24–43
| |
| − | | |
| − | 第24-43页
| |
| − | | |
| − | | title = Graph Visualization and Navigation in Information Visualization: A Survey
| |
| − | | |
| − | | title = Graph Visualization and Navigation in Information Visualization: A Survey
| |
| − | | |
| − | 信息可视化的图形可视化和导航: 一个调查
| |
| − | | |
| − | | issue = 1
| |
| − | | |
| − | | issue = 1
| |
| − | | |
| − | 第一期
| |
| − | | |
| − | | volume = 6
| |
| − | | |
| − | | volume = 6
| |
| − | | |
| − | 第六卷
| |
| − | | |
| − | | year = 2000 }}.
| |
| − | | |
| − | | year = 2000 }}.
| |
| − | | |
| − | 2000年开始。
| |
| − | | |
| − | *{{citation | |
| − | | |
| − | | last1 = Jünger | first1 = Michael
| |
| − | | |
| − | | last1 = Jünger | first1 = Michael
| |
| − | | |
| − | 1 j nger | first1 Michael
| |
| − | | |
| − | | last2 = Mutzel | first2 = Petra | author2-link = Petra Mutzel
| |
| − | | |
| − | | last2 = Mutzel | first2 = Petra | author2-link = Petra Mutzel
| |
| − | | |
| − | 2 Petra | author2-link Petra Mutzel
| |
| − | | |
| − | | isbn = 978-3-540-00881-1
| |
| − | | |
| − | | isbn = 978-3-540-00881-1 | |
| − | | |
| − | [国际标准图书馆编号978-3-540-00881-1]
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | 出版商 Springer-Verlag
| |
| − | | |
| − | | title = Graph Drawing Software
| |
| − | | |
| − | | title = Graph Drawing Software
| |
| − | | |
| − | 图形绘制软件
| |
| − | | |
| − | | year = 2004}}.
| |
| − | | |
| − | | year = 2004}}.
| |
| − | | |
| − | 2004年开始。
| |
| − | | |
| − | *{{citation|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|editor2-link=Dorothea Wagner|publisher=Springer-Verlag|series=[[Lecture Notes in Computer Science]]|volume=2025|year=2001|doi=10.1007/3-540-44969-8|isbn=978-3-540-42062-0}}.
| |
| − | | |
| − | *{{citation|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|url=http://cs.brown.edu/~rt/gdhandbook/|year=2014|access-date=2013-08-28|archive-url=https://web.archive.org/web/20130815181243/http://cs.brown.edu/~rt/gdhandbook/|archive-date=2013-08-15|url-status=dead}}.
| |
| | | | |
| | {{refend}} | | {{refend}} |
| − |
| |
| − |
| |
| | | | |
| | ;Specialized subtopics | | ;Specialized subtopics |
| − |
| |
| − | Specialized subtopics
| |
| − |
| |
| − | 专门的副主题
| |
| | | | |
| | {{refbegin|colwidth=30em}} | | {{refbegin|colwidth=30em}} |
| 第488行： |
第246行： |
| | *{{citation|contribution=Layered drawings of digraphs|first1=Oliver|last1=Bastert|first2=Christian|last2=Matuszewski|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|editor2-link=Dorothea Wagner|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2025|year=2001|pages=87–120|doi=10.1007/3-540-44969-8_5|isbn=978-3-540-42062-0}}. | | *{{citation|contribution=Layered drawings of digraphs|first1=Oliver|last1=Bastert|first2=Christian|last2=Matuszewski|title=Drawing Graphs: Methods and Models|editor1-first=Michael|editor1-last=Kaufmann|editor2-first=Dorothea|editor2-last=Wagner|editor2-link=Dorothea Wagner|publisher=Springer-Verlag|series=Lecture Notes in Computer Science|volume=2025|year=2001|pages=87–120|doi=10.1007/3-540-44969-8_5|isbn=978-3-540-42062-0}}. |
| | | | |
| − | *{{citation | + | *{{citation | last = Beckman | first = Brian | publisher = Microsoft Research | series = Tech. Report MSR-TR-94-04 | title = Theory of Spectral Graph Layout | url = http://research.microsoft.com/apps/pubs/default.aspx?id=69611 | year = 1994}}. |
| − | | |
| − | | last = Beckman | first = Brian
| |
| − | | |
| − | | last = Beckman | first = Brian
| |
| − | | |
| − | | 最后一个 Beckman | 第一个 Brian
| |
| − | | |
| − | | publisher = Microsoft Research
| |
| − | | |
| − | | publisher = Microsoft Research
| |
| − | | |
| − | 微软研究院
| |
| − | | |
| − | | series = Tech. Report MSR-TR-94-04
| |
| − | | |
| − | | series = Tech. Report MSR-TR-94-04
| |
| − | | |
| − | 系列技术。Msr-tr-94-04报告
| |
| − | | |
| − | | title = Theory of Spectral Graph Layout
| |
| − | | |
| − | | title = Theory of Spectral Graph Layout
| |
| − | | |
| − | 光谱图布局理论
| |
| − | | |
| − | | url = http://research.microsoft.com/apps/pubs/default.aspx?id=69611
| |
| − | | |
| − | | url = http://research.microsoft.com/apps/pubs/default.aspx?id=69611
| |
| − | | |
| − | Http://research.microsoft.com/apps/pubs/default.aspx?id=69611
| |
| − | | |
| − | | year = 1994}}.
| |
| − | | |
| − | | year = 1994}}.
| |
| − | | |
| − | 1994年。
| |
| − | | |
| | *{{citation|first1=Ulrik|last1=Brandes|first2=Linton C.|last2=Freeman|first3=Dorothea|last3=Wagner|author3-link=Dorothea Wagner|contribution=Social Networks|pages=805–839|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}. | | *{{citation|first1=Ulrik|last1=Brandes|first2=Linton C.|last2=Freeman|first3=Dorothea|last3=Wagner|author3-link=Dorothea Wagner|contribution=Social Networks|pages=805–839|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}. |
| − |
| |
| | *{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}. | | *{{citation|first1=Giuseppe|last1=Di Battista|first2=Massimo|last2=Rimondini|contribution=Computer Networks|pages=763–803|editor-first=Roberto|editor-last=Tamassia|editor-link=Roberto Tamassia|title=Handbook of Graph Drawing and Visualization|publisher=CRC Press|year=2014}}. |
| | | | |
| − | *{{citation | + | *{{citation | last1 = Doğrusöz | first1 = Uğur | last2 = Madden | first2 = Brendan| last3 = Madden | first3 = Patrick | editor-last = North | editor-first = Stephen| contribution = Circular layout in the Graph Layout toolkit | doi = 10.1007/3-540-62495-3_40 | pages = 92–100| publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings | volume = 1190 | year = 1997| isbn = 978-3-540-62495-0 | doi-access = free }}. |
| − | | + | *{{citation| last1 = Eiglsperger | first1 = Markus | last2 = Fekete | first2 = Sándor | last3 = Klau | first3 = Gunnar | contribution = Orthogonal graph drawing | doi = 10.1007/3-540-44969-8_6 |
| − | | last1 = Doğrusöz | first1 = Uğur
| + | | editor1-last = Kaufmann | editor1-first = Michael | editor2-last = Wagner | editor2-first = Dorothea |pages = 121–171 | publisher = Springer Berlin / Heidelberg |
| − | | + | | series = Lecture Notes in Computer Science | title = Drawing Graphs | volume = 2025 | year = 2001| isbn = 978-3-540-42062-0 }}. |
| − | | last1 = Doğrusöz | first1 = Uğur
| + | *{{citation | last = Freese | first = Ralph | editor-last = Eklund | editor-first = Peter | contribution = Automated lattice drawing | doi = 10.1007/978-3-540-24651-0_12 | pages = 589–590 |
| − | | + | | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf | volume = 2961 | year = 2004| isbn = 978-3-540-21043-6 | citeseerx = 10.1.1.69.6245 }}. |
| − | | last1 = Doğrusöz | first1 = Uğur
| |
| − | | |
| − | | last2 = Madden | first2 = Brendan
| |
| − | | |
| − | | last2 = Madden | first2 = Brendan
| |
| − | | |
| − | 2 Madden | first2 Brendan
| |
| − | | |
| − | | last3 = Madden | first3 = Patrick
| |
| − | | |
| − | | last3 = Madden | first3 = Patrick
| |
| − | | |
| − | 最后3个马登最初3个帕特里克
| |
| − | | |
| − | | editor-last = North | editor-first = Stephen
| |
| − | | |
| − | | editor-last = North | editor-first = Stephen
| |
| − | | |
| − | | 编辑-最后的北 | 编辑-第一斯蒂芬
| |
| − | | |
| − | | contribution = Circular layout in the Graph Layout toolkit
| |
| − | | |
| − | | contribution = Circular layout in the Graph Layout toolkit
| |
| − | | |
| − | | 贡献图形布局工具包中的循环布局
| |
| − | | |
| − | | doi = 10.1007/3-540-62495-3_40
| |
| − | | |
| − | | doi = 10.1007/3-540-62495-3_40
| |
| − | | |
| − | 10.1007 / 3-540-62495-340
| |
| − | | |
| − | | pages = 92–100
| |
| − | | |
| − | | pages = 92–100
| |
| − | | |
| − | 第92-100页
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | 出版商 Springer-Verlag
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | 计算机科学系列讲稿
| |
| − | | |
| − | | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings
| |
| − | | |
| − | | title = Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996, Proceedings
| |
| − | | |
| − | 图形绘制研讨会，美国加州伯克利，1996年9月18-20日，美国国家科学院院刊
| |
| − | | |
| − | | volume = 1190
| |
| − | | |
| − | | volume = 1190
| |
| − | | |
| − | 第1190卷
| |
| − | | |
| − | | year = 1997| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | | year = 1997| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | 1997年标题链接国际图形绘制专题研讨会
| |
| − | | |
| − | | isbn = 978-3-540-62495-0
| |
| − | | |
| − | | isbn = 978-3-540-62495-0
| |
| − | | |
| − | | isbn 978-3-540-62495-0
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | 免费访问
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation | |
| − | | |
| − | | last1 = Eiglsperger | first1 = Markus
| |
| − | | |
| − | | last1 = Eiglsperger | first1 = Markus
| |
| − | | |
| − | 1 | last 1 Eiglsperger | first1 Markus
| |
| − | | |
| − | | last2 = Fekete | first2 = Sándor
| |
| − | | |
| − | | last2 = Fekete | first2 = Sándor
| |
| − | | |
| − | | last2 = Fekete | first2 = Sándor
| |
| − | | |
| − | | last3 = Klau | first3 = Gunnar
| |
| − | | |
| − | | last3 = Klau | first3 = Gunnar
| |
| − | | |
| − | 3 Klau | first3 Gunnar
| |
| − | | |
| − | | contribution = Orthogonal graph drawing
| |
| − | | |
| − | | contribution = Orthogonal graph drawing
| |
| − | | |
| − | | 贡献正交图绘制
| |
| − | | |
| − | | doi = 10.1007/3-540-44969-8_6
| |
| − | | |
| − | | doi = 10.1007/3-540-44969-8_6
| |
| − | | |
| − | 10.1007 / 3-540-44969-86
| |
| − | | |
| − | | editor1-last = Kaufmann | editor1-first = Michael | |
| − | | |
| − | | editor1-last = Kaufmann | editor1-first = Michael
| |
| − | | |
| − | 1-last Kaufmann | editor1-first Michael
| |
| − | | |
| − | | editor2-last = Wagner | editor2-first = Dorothea | editor2-link = Dorothea Wagner
| |
| − | | |
| − | | editor2-last = Wagner | editor2-first = Dorothea | editor2-link = Dorothea Wagner
| |
| − | | |
| − | 2- 最后一位瓦格纳 | 2- 第一位多萝西娅 | 2- 链接多萝西娅 · 瓦格纳
| |
| − | | |
| − | | pages = 121–171
| |
| − | | |
| − | | pages = 121–171
| |
| − | | |
| − | 第121-171页
| |
| − | | |
| − | | publisher = Springer Berlin / Heidelberg
| |
| − | | |
| − | | publisher = Springer Berlin / Heidelberg
| |
| − | | |
| − | | 出版商斯普林格 · 柏林 / 海德堡
| |
| − | | |
| − | | series = Lecture Notes in Computer Science | |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | 计算机科学系列讲稿
| |
| − | | |
| − | | title = Drawing Graphs
| |
| − | | |
| − | | title = Drawing Graphs
| |
| − | | |
| − | | 题目绘制图形
| |
| − | | |
| − | | volume = 2025
| |
| − | | |
| − | | volume = 2025
| |
| − | | |
| − | 2025年
| |
| − | | |
| − | | year = 2001| isbn = 978-3-540-42062-0
| |
| − | | |
| − | | year = 2001| isbn = 978-3-540-42062-0
| |
| − | | |
| − | 2001 | isbn 978-3-540-42062-0
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation | |
| − | | |
| − | | last = Freese | first = Ralph
| |
| − | | |
| − | | last = Freese | first = Ralph
| |
| − | | |
| − | 最后一个自由 | 第一个拉尔夫
| |
| − | | |
| − | | editor-last = Eklund | editor-first = Peter
| |
| − | | |
| − | | editor-last = Eklund | editor-first = Peter
| |
| − | | |
| − | | 编辑-最后埃克伦 | 编辑-第一彼得
| |
| − | | |
| − | | contribution = Automated lattice drawing
| |
| − | | |
| − | | contribution = Automated lattice drawing
| |
| − | | |
| − | 自动点阵绘图
| |
| − | | |
| − | | doi = 10.1007/978-3-540-24651-0_12
| |
| − | | |
| − | | doi = 10.1007/978-3-540-24651-0_12
| |
| − | | |
| − | 10.1007 / 978-3-540-24651-012
| |
| − | | |
| − | | pages = 589–590
| |
| − | | |
| − | | pages = 589–590
| |
| − | | |
| − | 第589-590页
| |
| − | | |
| − | | publisher = Springer-Verlag | |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | 出版商 Springer-Verlag
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | 计算机科学系列讲稿
| |
| − | | |
| − | | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings
| |
| − | | |
| − | | title = Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings
| |
| − | | |
| − | | 题目概念格: 第二届形式概念分析国际会议，2004年，悉尼，澳大利亚，2004年2月23-26日，会议录
| |
| − | | |
| − | | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf
| |
| − | | |
| − | | url = http://www.math.hawaii.edu/~ralph/Preprints/latdrawing.pdf
| |
| − | | |
| − | Http://www.math.hawaii.edu/~ralph/preprints/latdrawing.pdf
| |
| − | | |
| − | | volume = 2961
| |
| − | | |
| − | | volume = 2961
| |
| − | | |
| − | 第2961卷
| |
| − | | |
| − | | year = 2004| isbn = 978-3-540-21043-6
| |
| − | | |
| − | | year = 2004| isbn = 978-3-540-21043-6
| |
| − | | |
| − | 2004 | isbn 978-3-540-21043-6
| |
| − | | |
| − | | citeseerx = 10.1.1.69.6245
| |
| − | | |
| − | | citeseerx = 10.1.1.69.6245
| |
| − | | |
| − | 10.1.1.69.6245
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Garg | first1 = Ashim
| |
| − | | |
| − | | last1 = Garg | first1 = Ashim
| |
| − | | |
| − | 1 | 最后1加格 | 首先1阿希姆
| |
| − | | |
| − | | last2 = Tamassia | first2 = Roberto
| |
| − | | |
| − | | last2 = Tamassia | first2 = Roberto
| |
| − | | |
| − | 2 Tamassia | first2 Roberto
| |
| − | | |
| − | | doi = 10.1007/BF01108622
| |
| − | | |
| − | | doi = 10.1007/BF01108622
| |
| − | | |
| − | | doi 10.1007 / BF01108622
| |
| − | | |
| − | | issue = 2
| |
| − | | |
| − | | issue = 2
| |
| − | | |
| − | 第二期
| |
| − | | |
| − | | journal = [[Order (journal)|Order]]
| |
| − | | |
| − | | journal = Order
| |
| − | | |
| − | | 日志订单
| |
| − | | |
| − | | mr = 1354797
| |
| − | | |
| − | | mr = 1354797
| |
| − | | |
| − | 1354797先生
| |
| − | | |
| − | | pages = 109–133
| |
| − | | |
| − | | pages = 109–133
| |
| − | | |
| − | 第109-133页
| |
| − | | |
| − | | title = Upward planarity testing
| |
| − | | |
| − | | title = Upward planarity testing
| |
| − | | |
| − | | 标题向上平面性测试
| |
| − | | |
| − | | volume = 12
| |
| − | | |
| − | | volume = 12
| |
| − | | |
| − | 第12卷
| |
| − | | |
| − | | year = 1995| citeseerx = 10.1.1.10.2237
| |
| − | | |
| − | | year = 1995| citeseerx = 10.1.1.10.2237
| |
| − | | |
| − | 1995年10.1.1.10.2237
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Holten | first1 = Danny
| |
| − | | |
| − | | last1 = Holten | first1 = Danny
| |
| − | | |
| − | | last1 = Holten | first1 = Danny
| |
| − | | |
| − | | last2 = Isenberg | first2 = Petra
| |
| − | | |
| − | | last2 = Isenberg | first2 = Petra
| |
| − | | |
| − | 2 Isenberg | first2 Petra
| |
| − | | |
| − | | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk
| |
| − | | |
| − | | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk
| |
| − | | |
| − | | last3 = van Wijk | first3 = Jarke J.| author3-link Jack van Wijk
| |
| − | | |
| − | | last4 = Fekete | first4 = Jean-Daniel
| |
| − | | |
| − | | last4 = Fekete | first4 = Jean-Daniel
| |
| − | | |
| − | 最后4个 Fekete 最早4个 Jean-Daniel
| |
| − | | |
| − | | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
| |
| − | | |
| − | | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
| |
| − | | |
| − | 对节点链接图中渐变的、动画的和纹理的有向边表示的可读性的扩展评估
| |
| − | | |
| − | | doi = 10.1109/PACIFICVIS.2011.5742390
| |
| − | | |
| − | | doi = 10.1109/PACIFICVIS.2011.5742390
| |
| − | | |
| − | 10.1109 / PACIFICVIS. 2011.5742390
| |
| − | | |
| − | | pages = 195–202
| |
| − | | |
| − | | pages = 195–202
| |
| − | | |
| − | 第195-202页
| |
| − | | |
| − | | title = IEEE Pacific Visualization Symposium (PacificVis 2011)
| |
| − | | |
| − | | title = IEEE Pacific Visualization Symposium (PacificVis 2011)
| |
| − | | |
| − | 美国电气和电子工程师协会太平洋可视化研讨会(PacificVis 2011)
| |
| − | | |
| − | | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf
| |
| − | | |
| − | | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf
| |
| − | | |
| − | Http://www.lri.fr/~isenberg/publications/papers/holten_2011_aep.pdf
| |
| − | | |
| − | | year = 2011| isbn = 978-1-61284-935-5
| |
| − | | |
| − | | year = 2011| isbn = 978-1-61284-935-5
| |
| − | | |
| − | | 2011年 | isbn 978-1-61284-935-5
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | |last1 = Holten
| |
| − | | |
| − | |last1 = Holten
| |
| − | | |
| − | 1 Holten
| |
| − | | |
| − | |first1 = Danny
| |
| − | | |
| − | |first1 = Danny
| |
| − | | |
| − | 首先是丹尼
| |
| − | | |
| − | |last2 = van Wijk
| |
| − | | |
| − | |last2 = van Wijk
| |
| − | | |
| − | 2 van Wijk
| |
| − | | |
| − | |first2 = Jarke J.
| |
| − | | |
| − | |first2 = Jarke J.
| |
| − | | |
| − | | first2 Jarke j.
| |
| − | | |
| − | |author2-link = Jack van Wijk
| |
| − | | |
| − | |author2-link = Jack van Wijk
| |
| − | | |
| − | | author2-link Jack van Wijk
| |
| − | | |
| − | |contribution = A user study on visualizing directed edges in graphs
| |
| − | | |
| − | |contribution = A user study on visualizing directed edges in graphs
| |
| − | | |
| − | 用户研究图形中的有向边可视化
| |
| − | | |
| − | |doi = 10.1145/1518701.1519054
| |
| − | | |
| − | |doi = 10.1145/1518701.1519054
| |
| − | | |
| − | 10.1145 / 1518701.1519054
| |
| − | | |
| − | |pages = 2299–2308
| |
| − | | |
| − | |pages = 2299–2308
| |
| − | | |
| − | 2299-2308页
| |
| − | | |
| − | |title = Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09)
| |
| − | | |
| − | |title = Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09)
| |
| − | | |
| − | | 第27届计算机系统中的人为因素国际会议论文集(CHI’09)
| |
| − | | |
| − | |url = http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | |url = http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | Http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | |year = 2009
| |
| − | | |
| − | |year = 2009
| |
| − | | |
| − | 2009年
| |
| − | | |
| − | |url-status = dead
| |
| − | | |
| − | |url-status = dead
| |
| − | | |
| − | 状态死机
| |
| − | | |
| − | |archiveurl = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | |archiveurl = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | Https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf
| |
| − | | |
| − | |archivedate = 2011-11-06
| |
| − | | |
| − | |archivedate = 2011-11-06
| |
| − | | |
| − | 2011-11-06
| |
| − | | |
| − | |isbn = 9781605582467
| |
| − | | |
| − | |isbn = 9781605582467
| |
| − | | |
| − | 9781605582467
| |
| − | | |
| − | |citeseerx = 10.1.1.212.5461
| |
| − | | |
| − | |citeseerx = 10.1.1.212.5461
| |
| − | | |
| − | 10.1.1.212.5461
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last = Koren
| |
| − | | |
| − | | last = Koren
| |
| − | | |
| − | 最后一个韩国
| |
| − | | |
| − | | first = Yehuda
| |
| − | | |
| − | | first = Yehuda
| |
| − | | |
| − | 首先是耶胡达
| |
| − | | |
| − | | doi = 10.1016/j.camwa.2004.08.015
| |
| − | | |
| − | | doi = 10.1016/j.camwa.2004.08.015
| |
| − | | |
| − | 10.1016 / j.camwa. 2004.08
| |
| − | | |
| − | | issue = 11–12
| |
| − | | |
| − | | issue = 11–12
| |
| − | | |
| − | 第11-12期
| |
| − | | |
| − | | journal = Computers & Mathematics with Applications
| |
| − | | |
| − | | journal = Computers & Mathematics with Applications
| |
| − | | |
| − | 计算机与数学与应用》杂志
| |
| − | | |
| − | | mr = 2154691
| |
| − | | |
| − | | mr = 2154691
| |
| − | | |
| − | 2154691先生
| |
| − | | |
| − | | pages = 1867–1888
| |
| − | | |
| − | | pages = 1867–1888
| |
| − | | |
| − | 1867-1888页
| |
| − | | |
| − | | title = Drawing graphs by eigenvectors: theory and practice
| |
| − | | |
| − | | title = Drawing graphs by eigenvectors: theory and practice
| |
| − | | |
| − | 按特征向量绘图: 理论与实践
| |
| − | | |
| − | | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf
| |
| − | | |
| − | | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf
| |
| − | | |
| − | Https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/dblp-journals-camwa-koren05.pdf
| |
| − | | |
| − | | volume = 49
| |
| − | | |
| − | | volume = 49
| |
| − | | |
| − | 第49卷
| |
| − | | |
| − | | year = 2005
| |
| − | | |
| − | | year = 2005
| |
| − | | |
| − | 2005年
| |
| − | | |
| − | | access-date = 2011-09-17
| |
| − | | |
| − | | access-date = 2011-09-17
| |
| − | | |
| − | 2011-09-17
| |
| − | | |
| − | | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf
| |
| − | | |
| − | | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf
| |
| − | | |
| − | | 档案-url https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/dblp-journals-camwa-koren05.pdf
| |
| − | | |
| − | | archive-date = 2012-04-02
| |
| − | | |
| − | | archive-date = 2012-04-02
| |
| − | | |
| − | 2012-04-02
| |
| − | | |
| − | | url-status = dead
| |
| − | | |
| − | | url-status = dead
| |
| − | | |
| − | 状态死机
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last = Longabaugh | first = William
| |
| − | | |
| − | | last = Longabaugh | first = William
| |
| − | | |
| − | 最后一次朗格伯格 | 第一次威廉
| |
| − | | |
| − | | doi = 10.1186/1471-2105-13-275
| |
| − | | |
| − | | doi = 10.1186/1471-2105-13-275
| |
| − | | |
| − | 10.1186 / 1471-2105-13-275
| |
| − | | |
| − | | journal = BMC Bioinformatics
| |
| − | | |
| − | | journal = BMC Bioinformatics
| |
| − | | |
| − | 生物信息学杂志
| |
| − | | |
| − | | pages = 275
| |
| − | | |
| − | | pages = 275
| |
| − | | |
| − | 第275页
| |
| − | | |
| − | | title = Combing the hairball with BioFabric: a new approach for visualization of large networks
| |
| − | | |
| − | | title = Combing the hairball with BioFabric: a new approach for visualization of large networks
| |
| − | | |
| − | 用 BioFabric 梳理毛团: 一种大型网络可视化的新方法
| |
| − | | |
| − | | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf
| |
| − | | |
| − | | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf
| |
| − | | |
| − | Http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf
| |
| − | | |
| − | | pmid = 23102059
| |
| − | | |
| − | | pmid = 23102059
| |
| − | | |
| − | 23102059
| |
| − | | |
| − | | volume = 13
| |
| − | | |
| − | | volume = 13
| |
| − | | |
| − | 第13卷
| |
| − | | |
| − | | year = 2012
| |
| − | | |
| − | | year = 2012
| |
| − | | |
| − | 2012年
| |
| − | | |
| − | | pmc=3574047}}.
| |
| − | | |
| − | | pmc=3574047}}.
| |
| − | | |
| − | 3574047}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Madden | first1 = Brendan
| |
| − | | |
| − | | last1 = Madden | first1 = Brendan
| |
| − | | |
| − | 最后一个疯狂橄榄球，最初一个布兰登
| |
| − | | |
| − | | last2 = Madden | first2 = Patrick
| |
| − | | |
| − | | last2 = Madden | first2 = Patrick
| |
| − | | |
| − | 2 Madden | first2 Patrick
| |
| − | | |
| − | | last3 = Powers | first3 = Steve
| |
| − | | |
| − | | last3 = Powers | first3 = Steve
| |
| − | | |
| − | 3 power | first3 Steve
| |
| − | | |
| − | | last4 = Himsolt | first4 = Michael
| |
| − | | |
| − | | last4 = Himsolt | first4 = Michael
| |
| − | | |
| − | 最后4希望 / 最初4迈克尔
| |
| − | | |
| − | | editor-last = Brandenburg | editor-first = Franz J.
| |
| − | | |
| − | | editor-last = Brandenburg | editor-first = Franz J.
| |
| − | | |
| − | 最后的勃兰登堡 | 最初的弗朗茨 j。
| |
| − | | |
| − | | contribution = Portable graph layout and editing
| |
| − | | |
| − | | contribution = Portable graph layout and editing
| |
| − | | |
| − | 便携式图形布局和编辑
| |
| − | | |
| − | | doi = 10.1007/BFb0021822
| |
| − | | |
| − | | doi = 10.1007/BFb0021822
| |
| − | | |
| − | 10.1007 / BFb0021822
| |
| − | | |
| − | | pages = 385–395
| |
| − | | |
| − | | pages = 385–395
| |
| − | | |
| − | 第385-395页
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | 出版商 Springer-Verlag
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | 计算机科学系列讲稿
| |
| − | | |
| − | | title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings
| |
| − | | |
| − | | title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings
| |
| − | | |
| − | 图形绘制: 图形绘制研讨会，GD’95，帕绍，1995年9月20-22日，美国国家科学院院刊
| |
| − | | |
| − | | volume = 1027
| |
| − | | |
| − | | volume = 1027
| |
| − | | |
| − | 第1027卷
| |
| − | | |
| − | | year = 1996| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | | year = 1996| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | 1996年标题链接国际图形绘制专题研讨会
| |
| − | | |
| − | | isbn = 978-3-540-60723-6
| |
| − | | |
| − | | isbn = 978-3-540-60723-6
| |
| − | | |
| − | [国际标准图书编号978-3-540-60723-6]
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | 免费访问
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Misue | first1= K.
| |
| − | | |
| − | | last1 = Misue | first1= K.
| |
| − | | |
| − | | 最后1米苏 | 最初1 k。
| |
| − | | |
| − | | last2 = Eades | first2= P.
| |
| − | | |
| − | | last2 = Eades | first2= P.
| |
| − | | |
| − | 2 Eades | first2 p.
| |
| − | | |
| − | | last3 = Lai | first3 = W.
| |
| − | | |
| − | | last3 = Lai | first3 = W.
| |
| − | | |
| − | 3 Lai | first3 w.
| |
| − | | |
| − | | last4 = Sugiyama | first4 = K.
| |
| − | | |
| − | | last4 = Sugiyama | first4 = K.
| |
| − | | |
| − | 最后4千。
| |
| − | | |
| − | | title = Layout Adjustment and the Mental Map
| |
| − | | |
| − | | title = Layout Adjustment and the Mental Map
| |
| − | | |
| − | | 标题布局调整和心理地图
| |
| − | | |
| − | | journal = Journal of Visual Languages and Computing
| |
| − | | |
| − | | journal = Journal of Visual Languages and Computing
| |
| − | | |
| − | 视觉语言与计算杂志
| |
| − | | |
| − | | volume = 6 | number = 2 | pages = 183–210 | year = 1995 | doi=10.1006/jvlc.1995.1010}}.
| |
| − | | |
| − | | volume = 6 | number = 2 | pages = 183–210 | year = 1995 | doi=10.1006/jvlc.1995.1010}}.
| |
| − | | |
| − | 183-210 | year 1995 | doi 10.1006 / jvlc. 1995.1010}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Nachmanson | first1 = Lev
| |
| − | | |
| − | | last1 = Nachmanson | first1 = Lev
| |
| − | | |
| − | 最后1纳克曼森最初1列弗
| |
| − | | |
| − | | last2 = Robertson | first2 = George
| |
| − | | |
| − | | last2 = Robertson | first2 = George
| |
| − | | |
| − | 2 Robertson | first2 George
| |
| − | | |
| − | | last3 = Lee | first3 = Bongshin
| |
| − | | |
| − | | last3 = Lee | first3 = Bongshin
| |
| − | | |
| − | 3 | last 3 Lee | first3 bongsin
| |
| − | | |
| − | | editor1-last = Hong | editor1-first = Seok-Hee
| |
| − | | |
| − | | editor1-last = Hong | editor1-first = Seok-Hee
| |
| − | | |
| − | | 编辑1-last Hong | 编辑1-first Seok-Hee
| |
| − | | |
| − | | editor2-last = Nishizeki | editor2-first = Takao | editor2-link = Takao Nishizeki
| |
| − | | |
| − | | editor2-last = Nishizeki | editor2-first = Takao | editor2-link = Takao Nishizeki
| |
| − | | |
| − | | editor2-last = Nishizeki | editor2-first = Takao | editor2-link = Takao Nishizeki
| |
| − | | |
| − | | editor3-last = Quan | editor3-first = Wu
| |
| − | | |
| − | | editor3-last = Quan | editor3-first = Wu
| |
| − | | |
| − | | 编辑3-last Quan | 编辑3-first Wu
| |
| − | | |
| − | | contribution = Drawing Graphs with GLEE
| |
| − | | |
| − | | contribution = Drawing Graphs with GLEE
| |
| − | | |
| − | 用 GLEE 绘制图表
| |
| − | | |
| − | | doi = 10.1007/978-3-540-77537-9_38
| |
| − | | |
| − | | doi = 10.1007/978-3-540-77537-9_38
| |
| − | | |
| − | 10.1007 / 978-3-540-77537-938
| |
| − | | |
| − | | pages = 389–394
| |
| − | | |
| − | | pages = 389–394
| |
| − | | |
| − | 第389-394页
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | publisher = Springer-Verlag
| |
| − | | |
| − | | 出版商 Springer-Verlag
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | series = Lecture Notes in Computer Science
| |
| − | | |
| − | | 计算机科学系列讲稿
| |
| − | | |
| − | | title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers
| |
| − | | |
| − | | title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers
| |
| − | | |
| − | 15 th International Symposium，GD 2007，Sydney，Australia，September 24-26，Revised Papers
| |
| − | | |
| − | | contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf
| |
| − | | |
| − | | contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf
| |
| − | | |
| − | | contribution-url ftp: / / ftp.research.microsoft. com / pub / tr / tr-2007-72.pdf
| |
| − | | |
| − | | volume = 4875
| |
| − | | |
| − | | volume = 4875
| |
| − | | |
| − | 第4875卷
| |
| − | | |
| − | | year = 2008| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | | year = 2008| title-link = International Symposium on Graph Drawing
| |
| − | | |
| − | | 2008年 | 国际图形绘制专题研讨会链接
| |
| − | | |
| − | | isbn = 978-3-540-77536-2
| |
| − | | |
| − | | isbn = 978-3-540-77536-2
| |
| − | | |
| − | [国际标准图书馆编号978-3-540-77536-2]
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | | doi-access = free
| |
| − | | |
| − | 免费访问
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | }}.
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Pach | first1 = János | author1-link = János Pach
| |
| − | | |
| − | | last1 = Pach | first1 = János | author1-link = János Pach
| |
| − | | |
| − | | last1 = Pach | first1 = János | author1-link = János Pach
| |
| − | | |
| − | | last2 = Sharir | first2 = Micha | author2-link = Micha Sharir
| |
| − | | |
| − | | last2 = Sharir | first2 = Micha | author2-link = Micha Sharir
| |
| − | | |
| − | 2 | last 2 Sharir | first2 Micha | author2-link Micha Sharir
| |
| − | | |
| − | | contribution = 5.5 Angular resolution and slopes
| |
| − | | |
| − | | contribution = 5.5 Angular resolution and slopes
| |
| − | | |
| − | | 贡献5.5角分辨率及斜坡
| |
| − | | |
| − | | pages = 126–127
| |
| − | | |
| − | | pages = 126–127
| |
| − | | |
| − | 第126-127页
| |
| − | | |
| − | | publisher = [[American Mathematical Society]]
| |
| − | | |
| − | | publisher = American Mathematical Society
| |
| − | | |
| − | 美国数学学会
| |
| − | | |
| − | | series = Mathematical Surveys and Monographs
| |
| − | | |
| − | | series = Mathematical Surveys and Monographs
| |
| − | | |
| − | | 系列数学调查和专著
| |
| − | | |
| − | | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
| |
| − | | |
| − | | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
| |
| − | | |
| − | 离散几何及其算法应用: alcal 系列讲座
| |
| − | | |
| − | | volume = 152
| |
| − | | |
| − | | volume = 152
| |
| − | | |
| − | 第152卷
| |
| − | | |
| − | | year = 2009}}.
| |
| − | | |
| − | | year = 2009}}.
| |
| − | | |
| − | 2009年开始。
| |
| − | | |
| − | *{{citation
| |
| − | | |
| − | | last1 = Purchase
| |
| − | | |
| − | | last1 = Purchase
| |
| − | | |
| − | | 最后一次购买
| |
| − | | |
| − | | first1 = H. C.
| |
| − | | |
| − | | first1 = H. C.
| |
| − | | |
| − | | first1 H.c.
| |
| − | | |
| − | | author1-link = Helen Purchase
| |
| − | | |
| − | | author1-link = Helen Purchase
| |
| − | | |
| − | | author1-link Helen Purchase
| |
| − | | |
| − | | last2 = Cohen
| |
| − | | |
| − | | last2 = Cohen
| |
| − | | |
| − | 2 Cohen
| |
| − | | |
| − | | first2 = R. F.
| |
| − | | |
| − | | first2 = R. F.
| |
| − | | |
| − | | first2 R.f.
| |
| − | | |
| − | | last3 = James
| |
| − | | |
| − | | last3 = James
| |
| − | | |
| − | 最后3名詹姆斯
| |
| − | | |
| − | | first3 = M. I.
| |
| | | | |
| − | | first3 = M. I.
| + | *{{citation | last1 = Garg | first1 = Ashim | last2 = Tamassia | first2 = Roberto | doi = 10.1007/BF01108622| issue = 2 | journal = Order | mr = 1354797 | pages = 109–133 | title = Upward planarity testing | volume = 12 | year = 1995| citeseerx = 10.1.1.10.2237 }}. |
| | | | |
| − | 第一季第三集。
| + | *{{citation | last1 = Holten | first1 = Danny | last2 = Isenberg | first2 = Petra | last3 = van Wijk | first3 = Jarke J. | author3-link = Jack van Wijk | last4 = Fekete | first4 = Jean-Daniel |
| − | | + | | last4 = Fekete | first4 = Jean-Daniel | contribution = An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs |
| − | | at = Article 4
| + | | doi = 10.1109/PACIFICVIS.2011.5742390 | pages = 195–202 | title = IEEE Pacific Visualization Symposium (PacificVis 2011) | url = http://www.lri.fr/~isenberg/publications/papers/Holten_2011_AEP.pdf | year = 2011| isbn = 978-1-61284-935-5 }}. |
| − | | |
| − | | at = Article 4
| |
| − | | |
| − | | 第四条 | |
| − | | |
| − | | doi = 10.1145/264216.264222
| |
| − | | |
| − | | doi = 10.1145/264216.264222
| |
| − | | |
| − | 10.1145 / 264216.264222
| |
| − | | |
| − | | journal = Journal of Experimental Algorithmics
| |
| − | | |
| − | | journal = Journal of Experimental Algorithmics | |
| − | | |
| − | 实验算法杂志
| |
| − | | |
| − | | title = An experimental study of the basis for graph drawing algorithms
| |
| − | | |
| − | | title = An experimental study of the basis for graph drawing algorithms
| |
| − | | |
| − | 关于图形绘制算法基础的实验研究
| |
| − | | |
| − | | url = https://secure.cs.uvic.ca/twiki/pub/Research/Chisel/ComputationalAestheticsProject/Vol2Nbr4.pdf | |
| − | | |
| − | | url = https://secure.cs.uvic.ca/twiki/pub/Research/Chisel/ComputationalAestheticsProject/Vol2Nbr4.pdf
| |
| − | | |
| − | Https://secure.cs.uvic.ca/twiki/pub/research/chisel/computationalaestheticsproject/vol2nbr4.pdf
| |
| − | | |
| − | | volume = 2
| |
| − | | |
| − | | volume = 2
| |
| − | | |
| − | 第二卷
| |
| − | | |
| − | | year = 1997
| |
| − | | |
| − | | year = 1997
| |
| − | | |
| − | 1997年
| |
| − | | |
| − | }}{{Dead link|date=January 2020 |bot=InternetArchiveBot |fix-attempted=yes }}.
| |
| | | | |
| | + | *{{citation |last1= Holten |first1 = Danny |last2 = van Wijk |first2= Jarke J. |contribution = A user study on visualizing directed edges in graphs |doi= 10.1145/1518701.1519054 |
| | + | |pages= 2299–2308 |title= Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09) |url= http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf |
| | + | |year = 2009 |url-status= dead |archiveurl = https://web.archive.org/web/20111106004500/http://www.win.tue.nl/~dholten/papers/directed_edges_chi.pdf|archivedate = 2011-11-06|isbn= 9781605582467 |
| | + | |citeseerx= 10.1.1.212.5461}}. |
| | + | *{{citation | last = Koren | first = Yehuda | doi = 10.1016/j.camwa.2004.08.015 | issue = 11–12 | journal = Computers & Mathematics with Applications | mr = 2154691 | pages = 1867–1888 | title = Drawing graphs by eigenvectors: theory and practice | url = https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| volume = 49| year = 2005| access-date = 2011-09-17 | archive-url = https://web.archive.org/web/20120402131402/https://akpublic.research.att.com/areas/visualization/papers_videos/pdf/DBLP-journals-camwa-Koren05.pdf| archive-date = 2012-04-02 | url-status = dead |
| | }}. | | }}. |
| | | | |
| − | }}.
| + | *{{citation | last = Longabaugh | first = William | doi = 10.1186/1471-2105-13-275 | journal = BMC Bioinformatics | pages = 275 | title = Combing the hairball with BioFabric: a new approach for visualization of large networks | url = http://www.biomedcentral.com/content/pdf/1471-2105-13-275.pdf| pmid = 23102059| volume = 13| year = 2012| pmc=3574047}}. |
| − | | |
| − | *{{citation | |
| − | | |
| − | | last = Saaty | first = Thomas L. | authorlink = Thomas L. Saaty
| |
| − | | |
| − | | last = Saaty | first = Thomas L. | authorlink = Thomas L. Saaty
| |
| − | | |
| − | 作者链接: Thomas l. Saaty
| |
| − | | |
| − | | journal = Proc. Natl. Acad. Sci. U.S.A.
| |
| − | | |
| − | | journal = Proc. Natl. Acad. Sci. U.S.A.
| |
| − | | |
| − | 华尔街日报。自然。Acad.科学。美国。
| |
| − | | |
| − | | pages = 688–690
| |
| − | | |
| − | | pages = 688–690
| |
| − | | |
| − | 第688-690页
| |
| − | | |
| − | | title = The minimum number of intersections in complete graphs
| |
| − | | |
| − | | title = The minimum number of intersections in complete graphs
| |
| − | | |
| − | | 标题完全图中的最小交叉点数
| |
| − | | |
| − | | volume = 52
| |
| − | | |
| − | | volume = 52
| |
| | | | |
| − | 第52卷
| + | *{{citation| last1 = Madden | first1 = Brendan| last2 = Madden | first2 = Patrick| last3 = Powers | first3 = Steve| last4 = Himsolt | first4 = Michael| editor-last = Brandenburg | editor-first = Franz J.| contribution = Portable graph layout and editing| doi = 10.1007/BFb0021822| pages = 385–395 | publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing: Symposium on Graph Drawing, GD '95, Passau, Germany, September 20–22, 1995, Proceedings | volume = 1027| year = 1996| title-link = International Symposium on Graph Drawing| isbn = 978-3-540-60723-6| doi-access = free }}. |
| | | | |
| − | | issue = 3 | year = 1964 | + | *{{citation | last1 = Misue | first1= K. | last2 = Eades | first2= P.| last3 = Lai | first3 = W.| last4 = Sugiyama | first4 = K. | title = Layout Adjustment and the Mental Map | journal = Journal of Visual Languages and Computing | volume = 6 | number = 2 | pages = 183–210 | year = 1995 | doi=10.1006/jvlc.1995.1010}}. |
| | | | |
| − | | issue = 3 | year = 1964
| + | *{{citation| last1 = Nachmanson | first1 = Lev | last2 = Robertson | first2 = George| last3 = Lee | first3 = Bongshin| editor1-last = Hong | editor1-first = Seok-Hee | editor2-last = Nishizeki | editor2-first = Takao| editor3-last = Quan | editor3-first = Wu| contribution = Drawing Graphs with GLEE| doi = 10.1007/978-3-540-77537-9_38| pages = 389–394| publisher = Springer-Verlag| series = Lecture Notes in Computer Science| title = Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24–26, 2007, Revised Papers| contribution-url = ftp://ftp.research.microsoft.com/pub/TR/TR-2007-72.pdf| volume = 4875| year = 2008|| isbn = 978-3-540-77536-2| doi-access = free }}. |
| | | | |
| − | 第三期1964年
| + | *{{citation| last1 = Pach | first1 = János | last2 = Sharir | first2 = Micha | contribution = 5.5 Angular resolution and slopes| pages = 126–127| publisher = American Mathematical Society | publisher = American Mathematical Society | series = Mathematical Surveys and Monographs | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures| volume = 152 |
| | + | | year = 2009}}. |
| | | | |
| − | | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}.
| + | *{{citation | last1 = Purchase | first1 = H. C. | last2 = Cohen | first2 = R. F. | last3 = James | first3 = M. I. | at = Article 4| doi = 10.1145/264216.264222| journal = Journal of Experimental Algorithmics | title = An experimental study of the basis for graph drawing algorithms| url = https://secure.cs.uvic.ca/twiki/pub/Research/Chisel/ComputationalAestheticsProject/Vol2Nbr4.pdf | volume = 2| year = 1997 }}{{Dead link|date=January 2020 |bot=InternetArchiveBot |fix-attempted=yes }}. |
| | | | |
| − | | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}.
| + | *{{citation | last = Saaty | first = Thomas L. | journal = Proc. Natl. Acad. Sci. U.S.A. | pages = 688–690 | title = The minimum number of intersections in complete graphs | volume = 52 |
| − | | + | | volume = 52| issue = 3 | year = 1964 | doi=10.1073/pnas.52.3.688| pmid = 16591215 | pmc = 300329}}. |
| − | 10.1073 / pnas. 52.3.688 | pmid 16591215 | pmc 300329}. | |
| | | | |
| | *{{citation|title=Social network analysis: a handbook|first=John|last=Scott|edition=2nd|publisher=Sage|year=2000|isbn=978-0-7619-6339-4|contribution=Sociograms and Graph Theory|url=https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA|pages=64–69}}. | | *{{citation|title=Social network analysis: a handbook|first=John|last=Scott|edition=2nd|publisher=Sage|year=2000|isbn=978-0-7619-6339-4|contribution=Sociograms and Graph Theory|url=https://books.google.com/books?id=Ww3_bKcz6kgC&pg=PA|pages=64–69}}. |
| 第1,636行： |
第290行： |
| | *{{citation|first1=Kozo|last1=Sugiyama|author1-link=Kozo Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=[[IEEE Systems, Man & Cybernetics Society|IEEE Transactions on Systems, Man, and Cybernetics]]|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}. | | *{{citation|first1=Kozo|last1=Sugiyama|author1-link=Kozo Sugiyama|first2=Shôjirô|last2=Tagawa|first3=Mitsuhiko|last3=Toda|title=Methods for visual understanding of hierarchical system structures|journal=[[IEEE Systems, Man & Cybernetics Society|IEEE Transactions on Systems, Man, and Cybernetics]]|volume=SMC-11|issue=2|pages=109–125|year=1981|mr=0611436|doi=10.1109/TSMC.1981.4308636}}. |
| | | | |
| − | *{{citation | + | *{{citation | last = Tantau | first = Till | doi = 10.7155/jgaa.00301 | issue = 4 | journal = Journal of Graph Algorithms and Applications | pages = 495–513 | title = Graph Drawing in TikZ | volume = 17 | year = 2013}}. |
| − | | |
| − | | last = Tantau | first = Till
| |
| − | | |
| − | | last = Tantau | first = Till
| |
| − | | |
| − | | last = Tantau | first = Till
| |
| − | | |
| − | | doi = 10.7155/jgaa.00301
| |
| − | | |
| − | | doi = 10.7155/jgaa.00301
| |
| − | | |
| − | 10.7155 / jgaa. 00301
| |
| − | | |
| − | | issue = 4
| |
| − | | |
| − | | issue = 4
| |
| − | | |
| − | 第四期
| |
| − | | |
| − | | journal = [[Journal of Graph Algorithms and Applications]]
| |
| − | | |
| − | | journal = Journal of Graph Algorithms and Applications
| |
| − | | |
| − | 图形算法和应用杂志
| |
| − | | |
| − | | pages = 495–513
| |
| − | | |
| − | | pages = 495–513
| |
| − | | |
| − | 第495-513页
| |
| − | | |
| − | | title = Graph Drawing in TikZ
| |
| − | | |
| − | | title = Graph Drawing in TikZ
| |
| − | | |
| − | | title Graph Drawing in TikZ
| |
| − | | |
| − | | volume = 17
| |
| − | | |
| − | | volume = 17
| |
| − | | |
| − | 第17卷
| |
| − | | |
| − | | year = 2013}}.
| |
| − | | |
| − | | year = 2013}}.
| |
| − | | |
| − | 2013年开始。
| |
| | | | |
| | * {{Citation | last1=Zapponi | first1=Leonardo | title=What is a Dessin d'Enfant | url=http://www.ams.org/notices/200307/what-is.pdf | date=August 2003 | journal=[[Notices of the American Mathematical Society]] | volume=50 | pages=788–789}}. | | * {{Citation | last1=Zapponi | first1=Leonardo | title=What is a Dessin d'Enfant | url=http://www.ams.org/notices/200307/what-is.pdf | date=August 2003 | journal=[[Notices of the American Mathematical Society]] | volume=50 | pages=788–789}}. |
| 第1,690行： |
第296行： |
| | {{refend}} | | {{refend}} |
| | | | |
| − | ==External links 外部链接== | + | ==其他链接== |
| | | | |
| | * [http://graphx.codeplex.com GraphX library for .NET]: open-source WPF library for graph calculation and visualization. Supports many layout and edge routing algorithms. | | * [http://graphx.codeplex.com GraphX library for .NET]: open-source WPF library for graph calculation and visualization. Supports many layout and edge routing algorithms. |
| 第1,697行： |
第303行： |
| | | | |
| | * {{dmoz|Science/Math/Combinatorics/Software/Graph_Drawing}} for many additional links related to graph drawing. | | * {{dmoz|Science/Math/Combinatorics/Software/Graph_Drawing}} for many additional links related to graph drawing. |
| − |
| |
| − |
| |
| − |
| |
| − | {{Graph representations}}
| |
| − |
| |
| − |
| |
| − |
| |
| − | [[Category:Graph drawing| ]]
| |
| − |
| |
| − | <noinclude>
| |
| − |
| |
| − | <small>This page was moved from [[wikipedia:en:Graph drawing]]. Its edit history can be viewed at [[图的绘制/edithistory]]</small></noinclude>
| |
| − |
| |
| − | [[Category:待整理页面]]
| |