专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US5515487A Displaying partial graphs by expanding and collapsing nodes 失效
标题翻译：通过展开和折叠节点显示部分图形
公开(公告)号：US5515487A
公开(公告)日：1996-05-07
申请号：US229249
申请日：1994-04-18
申请人： Phillip J. Beaudet , Eduardus A. T. Merks
发明人： Phillip J. Beaudet , Eduardus A. T. Merks
IPC分类号： G06T11/20 , G06T11/00
CPC分类号： G06T11/206
摘要： A method for selectively displaying portions of complex graphics including trees, directed acyclic graphics, and cyclic graphics on a computer display screen while retaining information concerning all nodes interconnections so that graphic information can be correctly recalled as required. Relevant interconnection information concerning a node or nodes to be collapsed or expanded are collected and analyzed. Elements of that interconnect information are displayed while retaining all information needed to display any obscured or hidden portions of the graphic when required. All nodes connected to each selected node are identified and each identified node is assigned to a first set of nodes. A second set of nodes is created that is initially empty. Each node is removed from the first set of nodes and assigned to the second set of nodes. All nodes connected to a remove node are identified and compared to nodes already stored in the first set of nodes. When nodes are not found in the first set of nodes, the nodes are added to the second set of nodes. This process of removing and identifying connected nodes are repeated until the first set of nodes is empty.
摘要翻译：一种在计算机显示屏幕上有选择地显示包括树，有向非循环图形和循环图形在内的复杂图形的部分的方法，同时保留关于所有节点互连的信息，以便可以根据需要正确地调用图形信息。收集和分析有关要折叠或展开的节点的相关互连信息。显示该互连信息的元素，同时保留在需要时显示图形的任何隐蔽或隐藏部分所需的所有信息。识别连接到每个选定节点的所有节点，并将每个已识别的节点分配给第一组节点。创建最初为空的第二组节点。每个节点从第一组节点中移除并分配给第二组节点。连接到移除节点的所有节点被识别并与已经存储在第一组节点中的节点进行比较。当在第一组节点中没有找到节点时，节点被添加到第二组节点。重复这个删除和识别连接的节点的过程，直到第一组节点为空。

IPRDB

热门服务

关于我们

友情链接

联系方式