Legal claims defining the scope of protection, as filed with the USPTO.
1. A machine-implemented method comprising: a processor unit associating a data graph to a visualization graph through a map graph, wherein the data graph includes at least two or more data nodes and one or more data edges, wherein the map graph includes at least two or more map nodes and one or more map edges, wherein the visualization graph includes at least two or more visualization nodes and one or more visualization edges; the processor unit arranging one or more visualization node three-dimensional models from a visualization graph into one or more three-dimensional geometries, wherein visualization nodes are grouped by the associated data node relations to an adjacent and shared data node; the processor unit generating a visualization graph from a data graph through a map graph, wherein the data graph includes at least two or more data nodes and one or more data edges, wherein the map graph includes at least two or more map nodes and one or more map edges, wherein the visualization graph includes at least two or more visualization nodes and one or more visualization edges; and displaying the visualization graph on a display.
2. The machine implemented method of claim 1 , further comprising: the processor unit associating a map graph to a type graph, wherein each map node of the map graph includes at least a three-dimensional model, a three-dimensional arrangement geometry, and a type node; and the processor unit generating a map graph from a type graph, wherein the data graph is designed from the type graph, wherein the type graph includes at least two or more type nodes and one or more type edges, wherein the map graph includes at least two or more map nodes and one or more map edges, wherein each map node includes at least a three-dimensional model, a three-dimensional arrangement geometry, and a type node.
3. The machine implemented method of claim 1 , further comprising: the processor unit generating a visualization arrangement from at least one or more visualization nodes and a visual arrangement, wherein the visual arrangement is copied from a map node, wherein the visual arrangement includes at least a three-dimensional geometry, wherein the map node is associated to at least a visual arrangement and type node, wherein a type node is associated to a visualization node through a data node, wherein each type node associated to a visualization node through a data node is equivalent to the type node associated to the map node; and the processor unit generating a visualization node from at least a data node and a visual node, wherein the visual node is copied from a map node, wherein the visual node includes at least a three-dimensional model, wherein the map node is associated to at least a visual node and type node, wherein the data node is associated to at least a type node, wherein the type node associated to the data node and the type node associated to the map node are equivalent; and the processor unit generating a visualization edge from at least a data edge and a visual edge, wherein the visual edge is copied from a map edge, wherein the visual edge includes at least a three-dimensional model, wherein the map edge is associated to at least a visual edge and type edge, wherein the data edge is associated to at least a type edge, wherein the type edge associated to the data edge and the type edge associated to the map edge are equivalent.
4. A machine-implemented method comprising: a processor unit associating one or more data nodes to one or more visualization nodes through a map node, wherein each data node includes at least equivalent type nodes, wherein each visualization node includes at least a three-dimensional model, wherein the map node includes at least a type node equivalent to type nodes included in the data nodes; and the processor unit arranging one or more visualization node three-dimensional models in a three-dimensional geometry, wherein each visualization node is associated with a particular data node, wherein each data node is adjacent to a shared data node; wherein the visualization nodes are grouped by the associated data node relations to the shared data node.
5. The machine-implemented method of claim 4 , further comprising: the processor unit associating one or more map nodes to one or more type nodes, wherein each data node is designed from a type node being associated, wherein each map node includes at least a three-dimensional model, a three-dimensional arrangement geometry, and a type node.
6. A machine-implemented method comprising: a processor unit accessing one or more data edges, and one or more data nodes, each data node being associated with an adjacent shared data node, via data edge; the processor unit associating the one or more data edges to one or more visualization edges through a map edge, wherein each visualization edge includes at least a three-dimensional model, each visualization edge being associated with at least two visualization edges of a plurality of visualization nodes; wherein the plurality of visualization nodes include the one or more visualization nodes that are grouped by the associated data node relations to an adjacent and shared data node.
7. The machine-implemented method of claim 6 , further comprising: the processor unit associating one or more map edges to one or more type edges, wherein each data edge is designed from a type edge being associated, wherein each map edge includes at least a three-dimensional model.
Unknown
October 12, 2010
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.