Hierarchical Family Graph Layout for Missing-Node Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional graphical tree generation algorithms fail to correctly position nodes, especially as the number of nodes increases, leading to irregularities and inability to handle complex hierarchical relationships such as multiple parents or affiliated records, affecting the aesthetic and spatial efficiency of the graphical representation.
Innovation Solution
A method and system for generating graphical trees that allow nodes to have multiple parents, use a phantom parent node for aligned representation of affiliated records, and visually distinguish missing records using a cue, while adhering to rules like parallel lines and centered positioning, ensuring even spacing and proportional subtree placement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If conventional node-positioning algorithms are used to generate graphical trees, then the algorithms can handle basic hierarchical structures, but they fail to correctly position nodes and produce irregularities as the number of nodes increases
Solution Approach 1:
The patent segments the node-positioning problem into distinct phases: determining hierarchical levels, calculating horizontal positions within levels, and vertical positioning. This segmentation allows the algorithm to handle complex node arrangements systematically, maintaining positioning accuracy even as the number of nodes increases.
Solution Approach 2:
The patent introduces a two-dimensional positioning system with explicit x-coordinates (horizontal) and y-coordinates (vertical) for each node. By defining positioning rules in both dimensions independently, the algorithm can accommodate multiple parents and complex hierarchical relationships while maintaining visual regularity and correctness.
2Reliability
If graphical trees are designed to represent complex hierarchical relationships such as multiple parents, then the representation accuracy improves, but the device complexity increases
Solution Approach 1:
The patent performs preliminary actions by pre-determining the hierarchical level of each node and pre-calculating horizontal positions before final rendering. This preliminary structuring simplifies the subsequent positioning steps and makes handling complex relationships like multiple parents more manageable, balancing representation accuracy with algorithmic complexity.
Solution Approach 2:
The patent introduces intermediary data structures and calculation steps that mediate between the raw hierarchical data and the final visual representation. These intermediaries organize complex relationships systematically, allowing accurate representation of multiple parents without proportionally increasing overall system complexity.
3Difficulty of detecting and measuring
If visual cues are added to identify missing records, then the ease of detecting errors improves, but the device complexity increases
Solution Approach 1:
The patent employs color changes as visual cues to indicate missing records or incomplete hierarchical relationships. By using distinct colors or shading for nodes with missing data, the system makes error detection intuitive and immediate without requiring complex additional interfaces or controls, thus improving detectability with minimal complexity increase.
Data Source
AI summary
Embodiments use a visual cue to identify a record with missing information among a plurality of hierarchical records. Each record includes a parent field and an associated records field. An entry in the parent field identifies a parent record of a given record. An entry in the associated records field identifies records that are associated with the record based on a criterion or one or more predetermined criteria. For a selected record, a first group of records are identified based on the parent field of the selected record. The entries in the associated records field of the selected record are then compared to the first group of records. A missing record missing an entry in the associated records field is identified among the first group of records. When the first record and the first group of hierarchical records are graphically represented on a target output medium, the missing record is represented using a visual cue.