Microsoft Technology Licensing, LLC

Stuart John Harding Kent

Blair Stuart McGlashan

Fabian Omar Winternitz

Gareth Alun Jones

Timothy Garry Dwyer

Lev Borisovich Nachmanson

Andrew Byrne

Sadi Khan

Kael R Rowan

Tyler Edward Gibson

Stephen J Cook

Jean-Marc Prieur

Alan Cameron Wills

Jens Kåre Jacobsen

J Duncan C Pocklington

Eyal Lantzman

A method includes transmitting an interface to a display device, where the interface represents a view of at least a portion of a graph. The graph is based on a model of a system and includes a plurality of nodes connected by a plurality of links, where at least one node of the graph includes another node. The method includes receiving a command to store a placemarker corresponding to the view and storing the placemarker. The placemarker is selectable to restore the view at the interface.

Navigating between views of a graph using placemarkers

A method for providing a query-based diagrammatic presentation of data includes generating a filter element that defines a set of groups and includes a set of declarative queries that define information to be included in the set of groups. The filter element is applied to a data source, which includes performing the set of declarative queries on the data source, thereby generating a set of query results for each of the groups. A diagram is generated that includes a set of shapes representing the set of groups, and a set of nodes nested within each of the shapes, wherein the nodes for each group are determined based on the query results for that group.

Query-based diagrammatic presentation of data

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.

Edge routing using connection regions

A designer tool that facilitates design of an object model. The tool takes as input a computer-readable representation of a graph of objects (e.g., classes), and creates automatically one or more diagrams that depict these classes as editable trees showing their relationships and properties. These graphs naturally have a tree-like structure which is exploited by the approach. The design tool system includes a layout component that receives as input one or more of the graphs, and converts the one or more graphs into the editable treelike structure. The system further comprises a presentation component that presents the editable treelike structure as a treelike structure diagram, and facilitates user interaction therewith. The tool can be used for opening, editing and saving existing object model files or to create new ones.

Object model tree diagram

Growing community of inventors

Canterbury, United Kingdom

Stuart John Harding Kent