Multiple-Parent Graphical Tree Layout for Space-Efficient Hierarchies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional graphical tree generation algorithms struggle with positioning nodes to achieve aesthetic appeal and space efficiency, particularly when dealing with multiple parent nodes and affiliated hierarchical records, leading to irregularities and failure to meet design requirements.
Innovation Solution
A method for determining node positions in a graphical tree by identifying a child record's first and second parent records without considering the second parent, then positioning them at the same level, and rendering shapes to visually connect these nodes, adhering to rules such as parallel lines and centered parents, ensuring even spacing and proportional subtree distribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If conventional node-positioning algorithms are used to generate graphical trees, then space efficiency is improved, but aesthetic appeal deteriorates due to irregular positioning of interior nodes
Solution Approach 1:
The patent segments the node-positioning problem into multiple independent constraints: aesthetic appeal constraints (centering parents over children, equal spacing between siblings) and space efficiency constraints (minimizing total area). By handling these constraints separately through iterative optimization rather than a single monolithic algorithm, the system achieves both aesthetic appeal and space efficiency simultaneously.
Solution Approach 2:
The patent changes the parameters of the node-positioning algorithm to handle multiple constraints simultaneously. It uses iterative optimization that adjusts positional parameters of nodes to satisfy both aesthetic constraints (visual arrangement) and space constraints (area minimization), resolving the contradiction between appearance and efficiency.
2Productivity
If conventional tree-generating algorithms are used, then generation speed is improved, but reliability deteriorates due to failure to address multiple parent nodes and affiliated hierarchical records
Solution Approach 1:
The patent makes the node-positioning algorithm universal by enabling it to handle multiple parent nodes and affiliated hierarchical records simultaneously. The algorithm no longer assumes a single-parent tree structure but can accommodate complex hierarchical relationships where nodes have multiple parents, thereby improving reliability without sacrificing generation speed.
Solution Approach 2:
The patent incorporates feedback mechanisms that validate the generated graphical tree against the required design requirements. The system checks whether multiple parent nodes and affiliated records are correctly represented and iteratively adjusts the positioning to ensure accuracy, thereby improving reliability while maintaining efficient generation speed.
3Loss of information
If multiple parent nodes are represented in conventional graphical trees, then completeness of hierarchical information is improved, but device complexity increases due to difficulty in positioning and rendering
Solution Approach 1:
The patent segments the rendering task into manageable components: identifying multiple parent nodes, determining their positions relative to child nodes, and rendering connections. By breaking down the complex task of representing multiple parents into separate operational steps, the system reduces the perceived complexity while maintaining information completeness.
Solution Approach 2:
The patent introduces intermediary structures and algorithms that facilitate the representation of multiple parent nodes. These intermediaries simplify the positioning and rendering processes by providing standardized methods for handling complex hierarchical relationships, thereby reducing device complexity while preserving complete hierarchical information.
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 without considering the second 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. 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.


