Positioning of non-constrained amount of data in semblance of a tree
View Patent ↗Methods, devices and systems are described for implementing a method for positioning a non-constrained amount of data in semblance of a tree. The method includes receiving genealogical data including nodes and generating a directed graph of the nodes of the genealogical data. The directed graph is to maintain parent-child relationships among the nodes and to maintain generations. The genealogical data includes a root node. The method includes moving the nodes along the horizontal axis such that each node is in an equal spacing with respect to each node's parent node, determining a number of generations in the genealogical chart, and generating a number of quadratic curves equal to the number of generations. The apex of the quadratic curves is the position of the tree's trunk. The method includes dropping the nodes in the Y-axis along the curve of the quadratic curves. Each generation is in line with the quadratic curve.
1. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree, the method comprising:
receiving, at a computing system, genealogical data including a plurality of nodes and generating a directed graph of the plurality of nodes of the genealogical data, wherein the directed graph is configured to maintain parent-child relationships among the plurality of nodes and to maintain at least one generation, wherein the genealogical data includes a root node;
displaying, on a display screen in communication with the computing system, the plurality of nodes in a left justification configuration, wherein the plurality of nodes are positioned with respect to the relationships of the directed graph;
moving the plurality of nodes along the horizontal axis such that each node is in an equal spacing with respect to each node's parent node;
determining a number of generations in the genealogical chart;
generating a number of quadratic curves equal to the number of generations, wherein the apex of the quadratic curves is the position of the tree's trunk;
dropping the plurality of nodes in the Y-axis along the curve of the quadratic curves, wherein each generation is configured to be in line with the respective quadratic curve; and
dropping down the root node at the apex of the quadratic curves to form the trunk of the tree.
2. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 1 , further comprising centering each of the plurality of nodes of one generation with each of the plurality of nodes of a subsequent generation.
3. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 1 , wherein the quadratic curve comprises a second degree or higher curve.
4. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 1 , wherein the quadratic curve comprises one or more of the following: a Bazier curve, an inverted parabola, and a sine curve.
5. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 4 , wherein the vertex of the inverted parabola comprises the trunk position.
6. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 1 , further comprising providing a user interface configured to provide a user with controls to manipulate the genealogical tree.
7. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 6 , further comprising providing user interface components for selecting an image of a tree to display as a background of the genealogical chart.
8. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 6 , further comprising providing user interface components for changing font and data of the display of the genealogical tree.
9. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 1 , wherein the number of generations determines the amplitude of the quadratic curve.
10. A method of implementing a method for positioning a non-constrained amount of data in semblance of a tree as in claim 9 , wherein a selected horizontal spacing of each of the nodes determines the period of the quadratic curve.
11. A non-transitory computer readable storage medium having a computer-readable program embodied therein for directing operation of a computer system, including a processor and a storage device, wherein the computer-readable program includes instructions for operation the computers system to:
receive genealogical data including a plurality of nodes and generating a directed graph of the plurality of nodes of the genealogical data, wherein the directed graph is configured to maintain parent-child relationships among the plurality of nodes and to maintain at least one generation, wherein the genealogical data includes a root node;
display the plurality of nodes in a left justification configuration, wherein the plurality of nodes are positioned with respect to the relationships of the directed graph;
move the plurality of nodes along the horizontal axis such that each node is in an equal spacing with respect to each node's parent node;
determine a number of generations in the genealogical chart;
generate a number of quadratic curves equal to the number of generations, wherein the apex of the quadratic curves is the position of the tree's trunk;
drop the plurality of nodes in the Y-axis along the curve of the quadratic curves, wherein each generation is configured to be in line with the respective quadratic curve; and
drop down the root node at the apex of the quadratic curves to form the trunk of the tree.
12. A non-transitory computer readable storage medium as in claim 11 , wherein the computer-readable program further includes instructions for operation the computers system to center each of the plurality of nodes of one generation with each of the plurality of nodes of a subsequent generation.
13. A non-transitory computer readable storage medium as in claim 11 , wherein the quadratic curve comprises a second degree or higher curve.
14. A non-transitory computer readable storage medium as in claim 11 , wherein the quadratic curve comprises one or more of the following: a Bazier curve, an inverted parabola, and a sine curve.
15. A non-transitory computer readable storage medium as in claim 14 , wherein the vertex of the inverted parabola comprises the trunk position.
16. A non-transitory computer readable storage medium as in claim 11 , wherein the computer-readable program further includes instructions for operation the computers system to provide a user interface configured to provide a user with controls to manipulate the genealogical tree.
17. A non-transitory computer readable storage medium as in claim 16 , wherein the computer-readable program further includes instructions for operation the computers system to provide user interface components for selecting an image of a tree to display as a background of the genealogical chart.
18. A non-transitory computer readable storage medium as in claim 16 , wherein the computer-readable program further includes instructions for operation the computers system to provide user interface components for changing font and data of the display of the genealogical tree.
19. A non-transitory computer readable storage medium as in claim 11 , wherein the number of generations determines the amplitude of the quadratic curve.
20. A non-transitory computer readable storage medium as in claim 19 , wherein a selected horizontal spacing of each of the nodes determines the period of the quadratic curve.