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

1. 发明授权

US06300957B1 Mapping a node-link structure to a rendering space beginning from any node 失效
标题翻译：将节点链接结构映射到从任何节点开始的渲染空间
公开(公告)号：US06300957B1
公开(公告)日：2001-10-09
申请号：US09124529
申请日：1998-07-29
申请人： Ramana B. Rao , John O. Lamping , Tichomir G. Tenev
发明人： Ramana B. Rao , John O. Lamping , Tichomir G. Tenev
IPC分类号： G06T1120
CPC分类号： G06T11/206
摘要： A node-link structure laid out in a space with negative curvature, such as the hyperbolic plane, is mapped to a rendering space, such as the unit disk, beginning from a starting element that has both a parent and a child. Data identifying the starting element are obtained, such as based on user signals. The starting element can be located at a starting position in the unit disk. Then a set of other elements can be mapped, each reachable from the starting element by a path that leads only through elements in the set. Each element's position in the negatively curved space relative to a preceding element on its path and the position of the preceding element in the rendering space can be used to obtain the element's position in the rendering space. The positions in the unit disk can then be used to present a representation of the node-link structure. The set of elements can include only a mapping root and descendants, where the mapping root is on an upward path from the starting element, but precedes the first element that maps to a position in the unit disk outside a precision horizon. A criterion can be applied to determine whether to map each element's descendants. If the rendering space has an active region within the precision horizon, it may not be necessary to map descendants if an element is outside the precision horizon or is outside the active region but has a parent inside the active region.
摘要翻译：在具有负曲率的空间（例如双曲面）中布置的节点链接结构被映射到从具有父节点和子节点的起始元素开始的呈现空间，诸如单位盘。获得识别起始元件的数据，例如基于用户信号。启动元件可以位于单元盘的起始位置。然后，可以映射一组其他元素，每个元素可以通过仅通过集合中的元素的路径从起始元素到达。每个元素在负弯曲空间中相对于其路径上的先前元素的位置和前一元素在渲染空间中的位置可用于获得元素在渲染空间中的位置。然后可以使用单位磁盘中的位置来呈现节点链接结构的表示。元素集可以仅包括映射根和后代，其中映射根位于起始元素的向上路径上，但在第一个元素之前，映射到单位磁盘外的精度水平位置。可以应用一个标准来确定是否映射每个元素的后代。如果渲染空间在精度范围内具有活动区域，则如果元素在精度水平线之外，或者在活动区域之外但在活动区域内具有父级，则可能无需映射后代。

2. 发明授权

US06654761B2 Controlling which part of data defining a node-link structure is in memory 失效
标题翻译：控制定义节点链接结构的数据的哪一部分在内存中
公开(公告)号：US06654761B2
公开(公告)日：2003-11-25
申请号：US09124474
申请日：1998-07-29
申请人： Tichomir G. Tenev , John O. Lamping , Ramana B. Rao
发明人： Tichomir G. Tenev , John O. Lamping , Ramana B. Rao
IPC分类号： G06F700
CPC分类号： G06F17/30958 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： In a series of iterations, each of which automatically traverses a set of elements of a node-link structure, an iteration modifies the part of node-link data defining the structure that is in memory. The modified part of node-link data is more likely to define the set of elements that will be traversed by the next iteration. The iteration can determine whether to remove any of the part of node-link data, and then apply a criterion, such as a navigation history criterion or a least recently traversed criterion, to determine which of the part to remove. The iteration can also determine whether its set of elements includes an element with children that are not defined by the part of node-link data in memory, and can obtain a modified part that defines those children. Each iteration can, for example, prepare and present a representation of the node-link structure.
摘要翻译：在一系列迭代中，每个迭代自动遍历节点链接结构的一组元素，迭代修改定义存储器中的结构的节点链接数据的一部分。节点链接数据的修改部分更有可能定义将由下一次迭代遍历的元素集合。迭代可以确定是否删除节点链接数据的任何部分，然后应用诸如导航历史标准或最近最少遍历的标准之类的标准来确定要删除哪个部分。迭代还可以确定它的元素集合是否包含一个没有由内存中的节点链接数据部分定义的子节点的元素，并且可以获得定义这些子节点的修改部分。例如，每个迭代可以准备并呈现节点链接结构的表示。

3. 发明授权

US6108698A Node-link data defining a graph and a tree within the graph 失效
标题翻译：节点链接数据定义图中的树和树
公开(公告)号：US6108698A
公开(公告)日：2000-08-22
申请号：US124338
申请日：1998-07-29
申请人： Tichomir G. Tenev , Ramana B. Rao , Harold J. Shinsato, Jr. , John O. Lamping
发明人： Tichomir G. Tenev , Ramana B. Rao , Harold J. Shinsato, Jr. , John O. Lamping
IPC分类号： G06F3/048 , G06F12/00 , G06F17/30 , G06F13/00
CPC分类号： G06F17/30958
摘要： Node-link data defining a graph also include tree defining data. The node-link data with the tree defining data further define a tree within the graph. The tree defining data indicate a set of elements in the graph that are represented in the tree. Each of a subset of elements in the set is represented more than once in the tree. For at least one element in the subset, the tree defining data indicate which representations of the element have descendants in the tree and which representations have none. The tree defining data can, for example, be expansion flags for links in the graph that are in the set of elements, with each links expansion flag indicating whether the link's to-node is expanded or contracted in the tree. In response to each of a series of expand and contract signals from a user, an iteration can modify the tree defining data and use it to present a representation of the graph with the indicated node expanded or contracted as requested.
摘要翻译：定义图形的节点链接数据还包括树定义数据。具有树定义数据的节点链接数据进一步在图中定义树。定义数据的树表示在树中表示的图中的一组元素。集合中的每个元素的子集在树中被表示多于一次。对于子集中的至少一个元素，定义数据的树指示该元素的哪些表示在树中具有后代，哪些表示没有。定义数据的树可以例如是用于在图元集合中的链接的扩展标志，每个链接扩展标志指示该链接的节点是否在树中被扩展或收缩。响应于来自用户的一系列扩展和合同信号中的每一个，迭代可以修改树定义数据，并使用它来呈现具有所请求的扩展或收缩的指示节点的图形的表示。

4. 发明授权

US08232995B2 Local relative layout of node-link structures in space with negative curvature 失效
标题翻译：具有负曲率的空间中节点链接结构的局部相对布局
公开(公告)号：US08232995B2
公开(公告)日：2012-07-31
申请号：US09124805
申请日：1998-07-29
申请人： John O. Lamping , Ramana B. Rao , Tichomir G. Tenev
发明人： John O. Lamping , Ramana B. Rao , Tichomir G. Tenev
IPC分类号： G06T11/20 , G06F15/16
CPC分类号： G06T11/206
摘要： A node-link structure is laid out in a space with negative curvature, such as the hyperbolic plane. Nearby relationship data are obtained for an element in the structure, indicating information about nearby node-link relationships; then layout data for the element are obtained, based on the nearby relationship data. The layout data indicate the element's position relative to a parent in the negatively curved space. The layout data can indicate a position displacement and an angle displacement between the parent and the element. The nearby relationship data can be obtained by counting grandchildren of the parent for each child of the parent that is in a set that are being or have been laid out. The counts can be used to obtain a radius and an angle for each child in the set, and the radii and angles can be used to obtain the position displacement and angle displacement. The nearby node-link relationships can thus include only relationships among the parent and its children and grandchildren.
摘要翻译：节点链接结构布置在具有负曲率的空间中，例如双曲面。获取结构中的元素的附近关系数据，指示关于附近节点 - 链接关系的信息; 然后根据附近的关系数据获得元素的布局数据。布局数据表示元素在负弯曲空间中相对于父母的位置。布局数据可以指示位置位移和母体和元素之间的角度位移。附近的关系数据可以通过对正在或已经布置的集合中的父母的每个孩子的父母的孙子计数来获得。可以使用计数来获得组中每个孩子的半径和角度，并且可以使用半径和角度来获得位置位移和角位移。因此，附近的节点链接关系可以仅包括父母与其子孙之间的关系。

5. 发明授权

US06377259B2 Presenting node-link structures with modification 失效
标题翻译：呈现具有修改的节点链接结构
公开(公告)号：US06377259B2
公开(公告)日：2002-04-23
申请号：US09124528
申请日：1998-07-29
申请人： Tichomir G. Tenev , Ramana B. Rao , John O. Lamping
发明人： Tichomir G. Tenev , Ramana B. Rao , John O. Lamping
IPC分类号： G06T1120
CPC分类号： G06T11/206
摘要： A sequence of steps presents node-link representations on a display. The sequence includes a first step, a last step, and at least one intermediate step. The first step presents a first representation that represents a first node-link structure. The last step presents a last representation that represents a second node-link structure that is a modified version of the first node-link structure. Both node-link structures include a set of shared elements that include a moving element. The moving element is represented by features that have different positions in the first and last representations. Each intermediate step presents an intermediate representation that includes features representing a subset of the shared elements including the moving element, and each element in the subset is also represented by features in the first and last representations. The feature representing the moving element has object constancy through the sequence of steps. The modification can include both deletion and insertion, and the sequence can include a first subsequence in which features are deleted and a second subsequence in which features are inserted. Moving elements can follow paths that are not parallel straight lines. Separate changes can be concurrently animated.
摘要翻译：一系列步骤在显示器上呈现节点链接表示。序列包括第一步骤，最后步骤和至少一个中间步骤。第一步提供表示第一个节点链接结构的第一个表示。最后一步呈现代表作为第一个节点链接结构的修改版本的第二个节点链接结构的最后一个表示。两个节点链接结构都包括一组包含移动元素的共享元素。移动元件由在第一和最后表示中具有不同位置的特征表示。每个中间步骤呈现中间表示，其包括表示包括移动元素的共享元素的子集的特征，并且子集中的每个元素也由第一和最后表示中的特征表示。表示移动元素的特征通过步骤顺序具有对象持续性。修改可以包括删除和插入，并且该序列可以包括删除特征的第一子序列和其中插入特征的第二子序列。移动元件可以遵循不平行直线的路径。单独的更改可以同时动画。

6. 发明授权

US06628312B1 Interactive interface for visualizing and manipulating multi-dimensional data 有权
标题翻译：用于可视化和操纵多维数据的交互界面
公开(公告)号：US06628312B1
公开(公告)日：2003-09-30
申请号：US09203480
申请日：1998-12-02
申请人： Ramana B. Rao , Tichomir G. Tenev , Stuart K. Card
发明人： Ramana B. Rao , Tichomir G. Tenev , Stuart K. Card
IPC分类号： G06F314
CPC分类号： G06F17/245
摘要： A software visualization tool consistent with the present invention integrates OLAP functionality with focus+context based techniques for navigation through and inspection of large multidimensional datasets. Focus+context based navigation techniques are used to increase the clarity and information content provided to the user. The visualization tool supports a number of operations of the data set, including: select-slice, aggregation, promote/demote, repeat-variables, and sort.
摘要翻译：与本发明一致的软件可视化工具将OLAP功能与基于焦点+上下文的技术相结合，用于导航和检查大型多维数据集。使用基于焦点+上下文的导航技术来增加提供给用户的清晰度和信息内容。可视化工具支持数据集的多个操作，包括：select-slice，聚合，升级/降级，重复变量和排序。

7. 发明授权

US06901555B2 Tree visualization system and method based upon a compressed half-plane model of hyperbolic geometry 有权
标题翻译：基于双曲线几何的压缩半平面模型的树可视化系统和方法
公开(公告)号：US06901555B2
公开(公告)日：2005-05-31
申请号：US09901414
申请日：2001-07-09
申请人： Yozo Hida , John O. Lamping , Ramana B. Rao
发明人： Yozo Hida , John O. Lamping , Ramana B. Rao
IPC分类号： G06T11/20 , G09G5/00
CPC分类号： G06T11/206
摘要： A node-link structure is displayed within a display area, having a narrow rectangular shape with an edge along one side acting as a horizon of a hyperbolic space half-plane. Lower level node features that share a parent node feature have centers of area positioned on the display in order along a line parallel with the horizon, with sufficiently similar spacings along an axis perpendicular to the horizon from the region around a parent node feature, and with sufficiently similar spacings in a dimension parallel to the horizon from adjacent node features along the line, that the lower level node features sharing the parent node feature are perceptible as a group of related node features. The half-plane model with compression is used for layout of the node-link data, and the hyperbolic layout data is mapped to a Euclidean space for display.
摘要翻译：节点链接结构显示在显示区域内，具有窄的矩形形状，沿着一侧的边缘用作双曲线空间半平面的水平面。共享父节点特征的较低级节点特征具有沿着与水平线平行的线顺序地定位在显示器上的区域中心，沿着与父节点特征周围的区域垂直于水平线的轴线具有足够相似的间隔，并且与与沿着线路的相邻节点特征平行于水平线的维度上的足够相似的间隔，共享父节点特征的下级节点特征可被认为是一组相关节点特征。具有压缩的半平面模型用于节点链接数据的布局，双曲线布局数据映射到欧几里德空间进行显示。

8. 发明授权

US07620913B2 Tree visualization system and method based upon a compressed half-plane model of hyperbolic geometry 有权
标题翻译：基于双曲线几何的压缩半平面模型的树可视化系统和方法
公开(公告)号：US07620913B2
公开(公告)日：2009-11-17
申请号：US11082275
申请日：2005-03-17
申请人： Yozo Hida , John O. Lamping , Ramana B. Rao
发明人： Yozo Hida , John O. Lamping , Ramana B. Rao
IPC分类号： G06F3/048 , G06T11/20
CPC分类号： G06T11/206
摘要： A node-link structure is displayed within a display area having a narrow rectangular shape with an edge along one side acting as a horizon of a hyperbolic space half-plane. Lower level node features that share a parent node feature have centers of area positioned on the display in order along a line parallel with the horizon, with sufficiently similar spacings along an axis perpendicular to the horizon from the region around a parent node feature, and with sufficiently similar spacings in a dimension parallel to the horizon from adjacent node features along the line, that the lower level node features sharing the parent node feature are perceptible as a group of related node features. The half-plane model with compression is used for layout of the node-link data, and the hyperbolic layout data is mapped to a Euclidean space for display.
摘要翻译：节点链接结构显示在具有窄矩形形状的显示区域中，沿着一侧的边缘用作双曲线空间半平面的水平线。共享父节点特征的较低级节点特征具有沿着与水平线平行的线顺序地定位在显示器上的区域中心，沿着与父节点特征周围的区域垂直于水平线的轴线具有足够相似的间隔，并且与与沿着线路的相邻节点特征平行于水平线的维度上的足够相似的间隔，共享父节点特征的下级节点特征可被认为是一组相关节点特征。具有压缩的半平面模型用于节点链接数据的布局，双曲线布局数据映射到欧几里得空间进行显示。

9. 发明授权

US5619632A Displaying node-link structure with region of greater spacings and peripheral branches 失效
标题翻译：显示具有较大间隔和外围分支的区域的节点链接结构
公开(公告)号：US5619632A
公开(公告)日：1997-04-08
申请号：US306074
申请日：1994-09-14
申请人： John O. Lamping , Ramana B. Rao
发明人： John O. Lamping , Ramana B. Rao
IPC分类号： G06F3/14 , G06F3/048 , G06F7/556 , G06F19/00 , G06T11/20 , G06T11/00
CPC分类号： G06T11/206
摘要： Node-link data defining a node-link structure are used to present a sequence of representations on a display. The last representation in the sequence is perceptible as a changed continuation of the first. Each representation includes bounded node features, each with a center of area and a nearest node spacing that define a mid-spacing circle. All mid-spacing circles together determine an outer convex hull enclosing a total area for the representation. The mid-spacing circles of a subset of more spaced node features determine an inner convex hull enclosing approximately half the total area and enclosing a region in which nearest node spacings are in general perceptibly greater than in another region outside the second convex hull. The node features also represent a peripheral branch with lower level nodes that are not represented by more spaced node features. In the peripheral branch, node features that share a parent have centers of area positioned approximately along an arc with sufficiently similar spacings from the center of area of the parent node feature and from adjacent node features that they are perceptible as a group of related node features. The inner convex hulls of the first and last representations include subsets of node features representing different sets of nodes. The sequence can produce a perception that one node feature's nearest node spacing increases while another's decreases. The representations can be presented by a series of iterations, and can be presented at animation speeds to produce a perception of continuously moving node features.
摘要翻译：定义节点链接结构的节点链接数据用于在显示器上呈现一系列表示。序列中的最后一个表现可以看作是第一个变化的延续。每个表示包括有界节点特征，每个具有区域的中心和定义中间间隔的最近的节点间隔。所有中间间隔的圆圈一起确定了外表面的外凸面，其中包含总面积。更多间隔节点特征的子集的中间间隔圆环确定包围大约一半总面积的内凸包，并且包围一个区域，其中最靠近的节点间距通常比第二凸包外的另一个区域更明显。节点特征还表示具有较低级别节点的外围分支，其不由更多间隔的节点特征表示。在外围分支中，共享一个父节点的节点特征具有大致沿弧线定位的中心，其具有与父节点特征的区域中心和相邻节点特征之间具有足够相似的间隔，它们被认为是一组相关节点特征。第一个和最后一个表示的内部凸包包括表示不同节点集合的节点特征的子集。该序列可以产生一个节点特征的最近节点间隔增加而另一个节点特征减小的感知。这些表示可以通过一系列迭代来呈现，并且可以以动画速度呈现以产生连续移动的节点特征的感知。

10. 发明授权

US5590250A Layout of node-link structures in space with negative curvature 失效
标题翻译：具有负曲率的空间节点链接结构的布局
公开(公告)号：US5590250A
公开(公告)日：1996-12-31
申请号：US306043
申请日：1994-09-14
申请人： John O. Lamping , Ramana B. Rao
发明人： John O. Lamping , Ramana B. Rao
IPC分类号： G06F3/14 , G06F3/048 , G06F9/44 , G06F19/00 , G06N5/04 , G06T11/20 , G06T11/60 , G06T11/80 , G06T1/40
CPC分类号： G06T11/206
摘要： Layout data indicate positions in a negatively curved layout space for nodes in a hierarchical branch of a node-link structure. The layout data indicate a parent position for parent nodes and, for children that share a parent node, child positions approximately along a circle in the layout space with the parent position approximately at the circle's center. Adjacent child positions are separated by approximately a base spacing. The radii of circles within the branch together approximate a function that increases slowly with number of child nodes such that the radii and spacings along circles are all approximately uniform within the branch. The layout data can be obtained from data defining the node-link structure. The layout data can be used to perform mappings, each obtaining positions for a subset of the nodes. The layout data can be used to present a first representation of the node-link structure on a display. In response to a user signal indicating a change from a first display position near a first feature to a second display position, a second representation can be presented that is perceptible as a changed continuation of the first. The second representation includes, near the second display position, a second feature representing the same part of the node-link structure as the first feature. The second representation can be obtained by a transformation of the layout space, which can be a discrete approximation of a hyperbolic plane.
摘要翻译：布局数据表示节点 - 链接结构的分层分支中节点的负弯曲布局空间中的位置。布局数据指示父节点的父位置，并且对于共享父节点的子节点，子空间大致沿着布局空间中的圆形位置，父位置大约在圆的中心。相邻的小孩位置大致分开一个基座间距。分支中的圆的半径一起近似一个随着子节点数的增加而缓慢增加的函数，使得圆中的半径和间距在分支内大致均匀。布局数据可以从定义节点链接结构的数据获得。布局数据可用于执行映射，每个获取节点的子集的位置。布局数据可用于在显示器上呈现节点链接结构的第一表示。响应于指示从第一特征附近的第一显示位置到第二显示位置的改变的用户信号，可以呈现可被认为是第一特征的改变的继续的第二表示。第二表示包括在第二显示位置附近的表示与第一特征的节点链接结构的相同部分的第二特征。可以通过布局空间的变换获得第二表示，其可以是双曲面的离散近似。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式