Multi-Parent Tree Layout Using Phantom Node Alignment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional graphical tree generation algorithms struggle with positioning nodes to achieve aesthetic appeal and space efficiency, especially when dealing with multiple parent nodes and affiliated hierarchical records, leading to irregularities and failure to meet design requirements.
Innovation Solution
A method for generating graphical trees that allows nodes to have multiple parents, using a phantom parent node to align affiliated sets and determining positions without considering all parent records, adhering to rules like parallel lines and centered parents, and employing a node-positioning algorithm to ensure even spacing and proportional subtree placement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If conventional node-positioning algorithms are used to generate graphical trees, then the generation process is automated, but the positioning accuracy and aesthetic quality deteriorate when dealing with multiple parent nodes
Solution Approach 1:
The patent segments the node-positioning task into independent sub-tasks: first positioning child nodes based on their primary parent, then separately positioning additional parent nodes at the same level. This segmentation allows each sub-task to be optimized independently, maintaining automation while improving positioning accuracy for complex multi-parent structures.
Solution Approach 2:
The patent performs preliminary positioning of child nodes before positioning their parent nodes. By first establishing the child node positions and then determining parent node positions at the same level, the algorithm prevents positioning conflicts and ensures accurate representation of hierarchical relationships, thereby improving overall positioning precision.
2Device complexity
If conventional graphical tree algorithms are used, then the structure is simple, but the ability to represent multiple parent nodes and affiliated records deteriorates
Solution Approach 1:
The patent extends the graphical tree algorithm to handle multiple parent nodes and affiliated records while maintaining the basic tree structure. The enhanced algorithm can universally represent both traditional single-parent hierarchies and complex multi-parent relationships, making the system adaptable to various organizational structures without requiring completely different representation methods.
Solution Approach 2:
The patent introduces a phantom parent node as an intermediary element to represent the relationship between multiple parent nodes and child nodes. This phantom node acts as a mediator that enables the graphical tree to represent multi-parent relationships without fundamentally altering the tree structure, thus maintaining simplicity while enhancing versatility.
3Shape
If nodes are positioned to achieve aesthetic appeal, then the visual quality improves, but the space efficiency and layout consistency across different display sizes deteriorate
Solution Approach 1:
The patent employs parameter changes in the positioning algorithm, adjusting spacing parameters and layout parameters dynamically. By modifying these parameters based on the number of nodes, tree depth, and display requirements, the algorithm achieves aesthetically pleasing layouts while maintaining space efficiency and consistency across different display sizes.
Solution Approach 2:
The patent implements dynamic positioning adjustments that adapt to different display contexts. The algorithm dynamically calculates optimal positions for nodes based on available space, tree structure, and aesthetic criteria, allowing the same graphical tree to be rendered consistently across different display sizes while maintaining both aesthetic appeal and space efficiency.
Data Source
AI summary
Embodiments use a graphical tree to illustrate hierarchical records including a child record having parent field(s) identifying a first parent record and a second parent record of the child record. The graphical tree is generated by determining a first position for the child record and a second position for the first parent record. Subsequently, a third position for the second parent record is determined at a same level as the second position. Once the positions are determined, a first shape, a second shape and a third shape are rendered at the first position, the second position and the third position, respectively. A plurality of first child records and a plurality of second child records are also rendered. The graphical tree is then generated by visually connecting the first shape with the second shape and the third shape, thereby graphically illustrating the plurality of hierarchical records on a target output medium.


