Microsoft Technology Licensing, LLC

Alexander E Holroyd

Lev Boris Nachmanson

Bongshin Lee

Xiaoji Chen

Nathalie Henry Riche

Sergey Pupyrev

Sergey Bereg

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.

Routing edges with ordered bundles

Large graph visualization embodiments are presented which generally render and display the more important elements for a current view. To this end, a measure of importance referred to as a zoom level is assigned to the vertices and rails of a graph. Each rail is a curve segment in the graph that represents an edge or a set of edges passing through it. The rendering and displaying of a graph (or a part thereof) is done quickly, even as a user moves about the graph, and the visualization of the large graph is not so dense and so full of detail that the user becomes disoriented. In general, this is accomplished by specifying a current viewport, or a current zoom level, or both. Furthermore, the visualization is stable in that the layout of vertices and rails will be the same for the same zoom level and viewport.

Visualizing large graphs

Growing community of inventors

Bothell, WA, United States of America

Alexander E Holroyd