Jonathan Paul Fournie

US Patent:

7703027, Apr 20, 2010

Filed:

Jan 12, 2006

Appl. No.:

11/330724

Inventors:

Ray Hsu - Austin TX, US
Mohammed Kamran Shah - Austin TX, US
Duncan Hudson - Austin TX, US
Yixin Guo - Austin TX, US
Jonathan P. Fournie - Austin TX, US

Assignee:

National Instruments Corporation - Austin TX

International Classification:

G06F 3/048

US Classification:

715763, 715771, 345630, 717 11

Abstract:

System and method for merging differences between graphical programs. Information is received regarding matches and differences, e. g. , in hardware, software, configuration, and/or connectivity, between first and second graphical programs, each comprising respective pluralities of interconnected nodes. The information is analyzed to merge differences between the first and second graphical programs, e. g. , for each difference: removing all non-common nodes and connections thereto in the second sub-graph from the second graphical program, adding all common nodes and connections thereto in the first sub-graph to the second graphical program, determining all edges in the first sub-graph that connect common nodes to non-common nodes; and for each determined edge, adding to the second graphical program an edge that connects a corresponding common node in the second sub-graph with a corresponding non-common node added from the first sub-graph. A merged graphical program is displayed on a display, e. g. , graphically indicating the merged matches and/or differences.

US Patent:

8151244, Apr 3, 2012

Filed:

Jul 27, 2007

Appl. No.:

11/829364

Inventors:

Ray Hsu - Austin TX, US
Mohammed Kamran Shah - Austin TX, US
Yixin Guo - Austin TX, US
Jonathan P. Fournie - Austin TX, US

Assignee:

National Instruments Corporation - Austin TX

International Classification:

G06F 9/44

US Classification:

717113, 715763

Abstract:

System and method for merging graphical programs. Information is received regarding first, second, and third graphical programs, where the third graphical program is an ancestor graphical program of the first and second. The information is analyzed to determine differences among the graphical programs. The first and second graphical programs are merged based on the determined differences, generating a merged graphical program, which is displayed. The analyzing may include determining first differences between the first and third graphical programs, and determining second differences between the second and third graphical programs, where the merging includes: for each of at least a subset of the differences: if the difference does not conflict with any other differences, incorporating the difference into the merged graphical program; and if the difference conflicts with another difference, prompting the user to resolve the conflict, receiving user input resolving the conflict, and modifying the merged graphical program accordingly.

US Patent:

8291329, Oct 16, 2012

Filed:

Mar 26, 2010

Appl. No.:

12/732947

Inventors:

Ray Hsu - Austin TX, US
Mohammed Kamran Shah - Austin TX, US
Duncan Hudson - Austin TX, US
Yixin Guo - Austin TX, US
Jonathan P. Fournie - Austin TX, US

Assignee:

National Instruments Corporation - Austin TX

International Classification:

G06F 3/048

US Classification:

715763, 715771, 345630

Abstract:

System and method for merging differences between graphical programs. Information is received regarding matches and differences, e. g. , in hardware, software, configuration, and/or connectivity, between first and second graphical programs, each comprising respective pluralities of interconnected nodes. The information is analyzed to merge differences between the first and second graphical programs, e. g. , for each difference: removing all non-common nodes and connections thereto in the second sub-graph from the second graphical program, adding all common nodes and connections thereto in the first sub-graph to the second graphical program, determining all edges in the first sub-graph that connect common nodes to non-common nodes; and for each determined edge, adding to the second graphical program an edge that connects a corresponding common node in the second sub-graph with a corresponding non-common node added from the first sub-graph. A merged graphical program is displayed on a display, e. g. , graphically indicating the merged matches and/or differences.

US Patent:

20050039176, Feb 17, 2005

Filed:

Feb 3, 2004

Appl. No.:

10/770709

Inventors:

Jonathan Fournie - Austin TX, US

International Classification:

G06F009/45
G06F009/44

US Classification:

717156000, 717155000, 717157000, 717101000

Abstract:

System and method for creating a scene graph. A data flow diagram is created in response to input, including displaying a first plurality of nodes on a display which are executable to create at least a portion of the scene graph, and connecting the nodes to create the data flow diagram, where the nodes are connected to specify data flow among the plurality of nodes. The data flow diagram is executed to create the scene graph. The scene graph specifies a plurality of objects and relationships between the objects, e.g., via an object hierarchy, and is usable in rendering a graphical image of the plurality of objects, e.g., a 3D scene. The scene graph is stored in a memory medium. At least one render node may be included in the data flow diagram which receives the scene graph as an input and renders the image based on the scene graph.