MANIPULATION OF ARBITRARILY RELATED DATA
First Claim
1. An apparatus comprising:
- a computer software product that includes a medium readable by a processor, the medium having stored thereon a set of instructions operable to store, process, retrieve, display, modify, and interpret one or more maps;
a sequence of instructions operable to represent zero or more nodes, each as an identifier and optionally as content, as containing content, or as associated with content;
a sequence of instructions operable to represent zero or more edges, each as an identifier and optionally as content, as containing content, or as associated with content;
a sequence of instructions operable to add or to remove one or more new nodes to a map;
a sequence of instructions operable to modify the properties or content of one or more nodes; and
a sequence of instructions operable to add or to remove one or more new edges to a map.
0 Assignments
0 Petitions
Accused Products
Abstract
The present invention teaches methods for applying network graphing to visualization of all types of data and to human collaborative interaction. This method overcomes several limitations of prior art by allowing interactive manipulation and editing of large graphs in their entirety, by allowing rich content including video and text, by allowing real-time collaboration by a plurality of users, and by including Undo/Redo functionality. The entirety of the disclosure may be applied to hierarchically-structured graphs and data, non-hierarchically-structured graphs and data, free-form graphs and data, or any combination thereof. In addition, the present invention teaches methods for numerous user interface enhancements for editing, viewing and manipulation of graphical depictions of data.
-
Citations
49 Claims
-
1. An apparatus comprising:
- a computer software product that includes a medium readable by a processor, the medium having stored thereon a set of instructions operable to store, process, retrieve, display, modify, and interpret one or more maps;
a sequence of instructions operable to represent zero or more nodes, each as an identifier and optionally as content, as containing content, or as associated with content;
a sequence of instructions operable to represent zero or more edges, each as an identifier and optionally as content, as containing content, or as associated with content;
a sequence of instructions operable to add or to remove one or more new nodes to a map;
a sequence of instructions operable to modify the properties or content of one or more nodes; and
a sequence of instructions operable to add or to remove one or more new edges to a map. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
- a computer software product that includes a medium readable by a processor, the medium having stored thereon a set of instructions operable to store, process, retrieve, display, modify, and interpret one or more maps;
-
28. A method for storing information related to maps comprising the steps:
- of adding one or more nodes;
removing one or more nodes;
organizing one or more nodes;
modifying one or more nodes;
adding one or more edges;
removing one or more edges;
organizing one or more edges;
modifying one or more edges;
presenting one or more maps to an individual user or jointly to a plurality of physically separated users;
wherein said one or more maps are presented in their entirety or in any portion thereof independently of the number of nodes and edges or amount of content in said maps and independently of the execution speed and storage limitations of the device or devices through which said maps are displayed; and
upon receipt of one or more requests. - View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49)
- of adding one or more nodes;
Specification