Patents by Inventor Timothy Garry Dwyer

Timothy Garry Dwyer has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8363054
    Abstract: Embodiments are directed to determining an appropriate neighborhood region for updating a node layout of an interactive diagramming system. A computer system receives an input indicating at least one change to various selected nodes displayed in the interactive diagramming system, where the changes to the selected nodes affect the positions of the other nodes on the node layout. The computer system traverses adjacent node edges to determine s minimal node neighborhood to which the node changes are to be applied. The computer system accesses diagram parameters that identify diagram and node characteristics and determines the minimal neighborhood region based on both the determined number of adjacent nodes and the accessed parameters. The computer system also updates the position of the selected node and the updated positions of those nodes and corresponding edges that are determined to be within the neighborhood region.
    Type: Grant
    Filed: June 16, 2010
    Date of Patent: January 29, 2013
    Assignee: Microsoft Corporation
    Inventors: Andrew Jude Byrne, Timothy Garry Dwyer, Durham Montgomery Goode, Yanlin Hou, Jens K. Jacobsen, Sadi Sufi Khan
  • Patent number: 8365129
    Abstract: 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.
    Type: Grant
    Filed: December 4, 2009
    Date of Patent: January 29, 2013
    Assignee: Microsoft Corporation
    Inventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, Lev Borisovich Nachmanson
  • Patent number: 8358308
    Abstract: Various types of data can be collected into a data set and related content and/or related concepts across the data in the data set and/or across search histories can be displayed as a visual representation. The related content/concepts can be presented as a function of incremental revealing of relationships. After reviewing the visual representation, a user can customize the data set and relationships by specifically excluding a related data segment. The visual representation can be applied across multiple searches or other obtained data. Through interaction with the visual representation, a user can drill down into common linkages of the data to more narrowly focus on a subset of the data and/or to refocus a search result and/or to provide annotations.
    Type: Grant
    Filed: June 27, 2008
    Date of Patent: January 22, 2013
    Assignee: Microsoft Corporation
    Inventors: George G. Robertson, Danyel A. Fisher, Bongshin Lee, Roland L. Fernandez, Lev Boris Nachmanson, Timothy Garry Dwyer, Mikkel Ronne Jakobsen, Olga Kulyk, Matthew Jay Kotler, Kipper V. Jewsbury, Brian L. Welcker, Gur Kimchi, Morten Holm-Peterson, Stella Yick Chan, Jason J. Weber, B. Scott Ruble, Murali R. Krishnan, Benjamin L. Chronister, Christian Olaf Abeln
  • Publication number: 20110310117
    Abstract: Embodiments are directed to determining an appropriate neighborhood region for updating a node layout of an interactive diagramming system. A computer system receives an input indicating at least one change to various selected nodes displayed in the interactive diagramming system, where the changes to the selected nodes affect the positions of the other nodes on the node layout. The computer system traverses adjacent node edges to determine s minimal node neighborhood to which the node changes are to be applied. The computer system accesses diagram parameters that identify diagram and node characteristics and determines the minimal neighborhood region based on both the determined number of adjacent nodes and the accessed parameters. The computer system also updates the position of the selected node and the updated positions of those nodes and corresponding edges that are determined to be within the neighborhood region.
    Type: Application
    Filed: June 16, 2010
    Publication date: December 22, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Andrew Jude Byrne, Timothy Garry Dwyer, Durham Montgomery Goode, Yanlin Hou, Jens K. Jacobsen, Sadi Sufi Khan
  • Publication number: 20110154234
    Abstract: In an embodiment, a computer system instantiates an interactive layout system that is configured to display a layout with various diagram portions, where each diagram portion includes layout parts and corresponding constraints identifying how the layout parts of the diagram portion are to be displayed. The computer system receives input from a user indicating that at least one of the diagram portions is to be moved. The computer system determines the manner in which each diagram portion is to be moved based on the received user input. The moving includes rotating and/or scaling the diagram portions of the layout according to the received user input, such that the layout parts remain fixed in position relative to one another, but are scaled and/or rotated to fit the surrounding layout according to the corresponding constraints. The computer system dynamically moves the layout parts of the diagram portions according to the determination.
    Type: Application
    Filed: December 18, 2009
    Publication date: June 23, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, George G. Robertson
  • Publication number: 20110134926
    Abstract: 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.
    Type: Application
    Filed: December 4, 2009
    Publication date: June 9, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, Lev Borisovich Nachmanson
  • Publication number: 20090322756
    Abstract: Various types of data can be collected into a data set and related content and/or related concepts across the data in the data set and/or across search histories can be displayed as a visual representation. The related content/concepts can be presented as a function of incremental revealing of relationships. After reviewing the visual representation, a user can customize the data set and relationships by specifically excluding a related data segment. The visual representation can be applied across multiple searches or other obtained data. Through interaction with the visual representation, a user can drill down into common linkages of the data to more narrowly focus on a subset of the data and/or to refocus a search result and/or to provide annotations.
    Type: Application
    Filed: June 27, 2008
    Publication date: December 31, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: George G. Robertson, Danyel A. Fisher, Bongshin Lee, Roland L. Fernandez, Lev Boris Nachmanson, Timothy Garry Dwyer, Mikkel Ronne Jakobsen, Olga Kulyk, Matthew Jay Kotler, Kipper V. Jewsbury, Brian L. Welcker, Gur Kimchi, Morten Holm-Peterson, Stella Yick Chan, Jason J. Weber, B. Scott Ruble, Murali R. Krishnan, Benjamin L. Chronister, Christian Olaf Abeln