Patent application number | Description | Published |
20100063785 | Visualizing Relationships among Components Using Grouping Information - A graph processing module is described for visualizing relationships among components, such as software components within a software system. The graph processing module generates group results based on grouping information which identifies groups of individual components. The graph processing module uses the group results to bias component-level analysis that it performs on the components. In one case, the component-level analysis can involve similarity analysis (e.g., using multidimensional scaling) to assess the similarity among components and importance analysis (e.g., using a network page ranking algorithm) to assess the relative importance of the components. The results of the component-level analysis can be presented for visualization. The biasing effects of the grouping results provide insight into the relationships among the components. | 03-11-2010 |
20110181595 | Visualizing a Layered Graph Using Edge Bundling - A graph processing module is described for producing a visualization of a layered graph. The graph processing module operates by: bundling edges in the layered graph to produce respective edge bundles; ordering the edges associated with the edge bundles to reduce edge crossings; straightening the edges; and separating the edges in the edges bundles with respect to each other. The graph processing module can operate on a layered graph produced by the Sugiyama algorithm or some other technique, reducing clutter in the layered graph and thus improving a user's understanding of the layered graph. | 07-28-2011 |
20120127177 | CONTROLLING EDGE ROUTING USING LAYOUT CONSTRAINTS - A system and method for creating or editing a graph diagram. A system provides a mechanism to specify constraints on edge way points. Constraints may specify alignment with other way points, distribution of way points, spacing from other way points or nodes, or other types of constraints. A system may automatically determine edge way point constraints based on edge direction, edge type, target nodes or regions of nodes, or other characteristics of edges. The system enables a combination of constraints specified by a user and automatically determined by the system. Way points are positioned based on associated constraints, and edges are routed based on their associated way points. | 05-24-2012 |
20120280999 | ROUTING EDGES WITH ORDERED BUNDLES - A graph processing module is described for producing a processed graph in three phases. In a bundling phase, the graph processing module selects edges that are used to constitute paths to produce a bundled graph. In an ordering phase, the graph processing module orders paths within the bundled graph to produce an ordered bundled graph. In a separating phase, the graph processing module separates paths in the ordered bundled graph. Among other features, the graph processing module performs the selecting operation by minimizing a cost function; this has the effect of promoting bundling in the bundled graph while discouraging the presence of overly long edges in the bundled graph. The graph processing module can perform the ordering operation by selecting the ordering of paths passing through each edge based on a consideration of ordering constraints within a common subpath associated with the edge. | 11-08-2012 |
Patent application number | Description | Published |
20090198725 | VISUALIZING TREE STRUCTURES WITH DIFFERENT EDGE LENGTHS - A system described herein includes a receiver component that receives multiple data elements, wherein each of the data elements has a common attribute, and wherein the several data elements are hierarchically related. The system may further include an assignor component that independently assigns each of the multiple data elements to one of a plurality of layers, wherein a data element is assigned to a layer based at least in part upon a value of the common attribute that corresponds to the data element. The system may also include a renderer component that receives assignments made by the assignor component and graphically renders a tree structure based at least in part upon the assignments. Furthermore, a color bar can be generated that includes one or more rows based at least in part upon content of the tree structure. | 08-06-2009 |
20100289801 | INTERACTIVE CONNECTOR ROUTING BETWEEN OBSTACLES - An interactive connector routing system and method for creating a connector between two shapes in a digital canvas or workspace that is based on a shortest path. The system and method avoid the use of a tangent visibility graph when possible to minimize computation time. When the graph is used, it is built one portion during pointing device events. Source and target ports are set and it is determined whether a valid simple path can be created between these ports. If no simple path exists, then the system and method build an extended tangent visibility graph during pointing devices events. Building the extended tangent visibility graph includes an iterative process that enlarges an active rectangle until it contains the necessary obstacles and shapes to generate the shortest valid path for the connector. The system and method also use finishing techniques to clean up and smooth the connector path. | 11-18-2010 |
20110134926 | EDGE ROUTING USING CONNECTION REGIONS - A computer system identifies a source node that is to be connected to a target node, where the target node is connected to the source node using an edge that links a connection region associated with the source node to a candidate connection region of the target node. The computer system identifies candidate connection region constraints that place restrictions on where the candidate connection regions can be positioned on the target node and determines, based on the identified candidate connection region constraints, the position of each candidate connection region relative to the target node. At least two of the candidate connection regions are disconnected so that an edge's connection to the target node can change between the disconnected connection regions. The computer system also visually represents the position of each of the candidate connection regions of the target node. | 06-09-2011 |