Technique for drawing directed graphs
    1.
    发明授权
    Technique for drawing directed graphs 失效
    绘制有向图的技术

    公开(公告)号:US4953106A

    公开(公告)日:1990-08-28

    申请号:US355731

    申请日:1989-05-23

    IPC分类号: G06T11/20

    CPC分类号: G06T11/206

    摘要: The present invention relates to a computer-implemented technique for drawing directed graphs providing reduced crossings and improved picture quality. An edge list description provided by a user is processed to produce a ranking of all nodes that minimizes the weighted sum of all edges, an edge cost being the product of its weight and length. Nodes within a ranking are then positioned to reduce edge crossings using a heuristic based on node positions in adjacent ranks. Such heuristic uses a generalized median as a weighting function plus node transposition to avoid senseless edge crossings before proceeding to a next rank. Nodes are then positioned to minimize the weighted sum of horizontal distances among connected nodes. Spline control points are then computed for interconnected nodes, and a code sequence for a drawing is generated.

    摘要翻译: 本发明涉及一种计算机实现的技术,用于绘制提供减少的交叉和改善的画面质量的有向图。 处理由用户提供的边缘列表描述以产生使所有边缘的加权和最小化的所有节点的等级,边缘成本是其权重和长度的乘积。 然后定位排名中的节点,以使用基于相邻队列中的节点位置的启发式来减少边缘交叉。 这种启发式使用广义中值作为加权函数加上节点转置,以避免在进入下一个等级之前无意义的边缘交叉。 然后定位节点以使连接的节点之间的水平距离的加权和最小化。 然后为互连节点计算样条控制点,并生成绘图的代码序列。

    Methods, Systems, and Products for Graphing Data
    2.
    发明申请
    Methods, Systems, and Products for Graphing Data 失效
    图形数据的方法,系统和产品

    公开(公告)号:US20100149186A1

    公开(公告)日:2010-06-17

    申请号:US12332477

    申请日:2008-12-11

    IPC分类号: G06T11/20

    CPC分类号: G06T11/60 G06T11/206

    摘要: Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity graph is generated using triangulation. Nodal overlaps are removed.

    摘要翻译: 披露图形数据的方法,系统和产品。 检索包含顶点位置的布局。 使用三角测量法生成近似图。 节点重叠被删除。

    Methods, systems, and products for graphing data to reduce overlap
    3.
    发明授权
    Methods, systems, and products for graphing data to reduce overlap 失效
    用于绘制数据以减少重叠的方法,系统和产品

    公开(公告)号:US08654126B2

    公开(公告)日:2014-02-18

    申请号:US12332477

    申请日:2008-12-11

    IPC分类号: G06T11/20

    CPC分类号: G06T11/60 G06T11/206

    摘要: Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity graph is generated using triangulation. Nodal overlaps are removed.

    摘要翻译: 披露图形数据的方法,系统和产品。 检索包含顶点位置的布局。 使用三角测量法生成近似图。 节点重叠被删除。