Graphical Program Node Exclusion from Auto-Rearrangement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional text-based programming languages limit user efficiency in creating computer programs, especially for those without advanced programming skills, and graphical programming environments, while powerful, often require manual arrangement of nodes, which can be time-consuming and aesthetically unpleasing.
Innovation Solution
A system and method for automatically rearranging objects in a graphical program block diagram, allowing users to select portions for reorganization while keeping others intact, using algorithms to compute new node positions and re-route wires for an aesthetically pleasing and organized layout.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If manual arrangement of nodes is used in graphical programming environments, then users can maintain precise control over node positions, but the process becomes time-consuming and reduces productivity
Solution Approach 1:
The system performs preliminary automatic arrangement of nodes before the user begins manual positioning. This preliminary action establishes a baseline organized layout, allowing users to subsequently make only minor adjustments rather than arranging nodes from scratch, thus improving productivity while maintaining control.
Solution Approach 2:
The system applies automatic arrangement only to selected portions of the graphical program rather than the entire diagram. Users can choose to automatically arrange specific subgraphs or regions while manually positioning other nodes, enabling partial automation that balances productivity gains with operational control.
2Productivity
If automatic re-arrangement of the entire graphical program is performed, then productivity is improved and visual organization is enhanced, but user-defined layouts and aesthetically pleasing arrangements may be lost
Solution Approach 1:
The graphical program is divided into multiple subgraphs or regions, allowing selective automatic arrangement of specific segments while preserving others. Users can identify and protect certain subgraphs from automatic re-arrangement, maintaining user-defined layouts in critical areas while benefiting from automation in less critical portions.
Solution Approach 2:
Different regions of the graphical program are treated differently with respect to automatic arrangement. Some regions are designated for automatic optimization while others maintain their original user-defined characteristics, allowing local quality variations that preserve important layouts while improving overall productivity.
3Manufacturing precision
If algorithms automatically compute new node positions and re-route wires, then visual organization and clarity are improved, but the complexity of the arrangement system increases
Solution Approach 1:
The arrangement system implements universal algorithms that can handle multiple types of graphical program structures and layout requirements through a single unified mechanism. This multi-functional approach achieves high visual organization quality without proportionally increasing system complexity, as the same core algorithms adapt to different scenarios.
Data Source
AI summary
Various embodiments of a system and method for automatically re-arranging a graphical program are described. The method may operate to receive user input excluding a portion of the graphical program from re-arrangement, and to then automatically re-arrange the graphical program without re-arranging the excluded portion of the graphical program. In various embodiments, the objects in the non-excluded part of the may be re-positioned so as to better organize the graphical program or enable a user to more easily view or understand the graphical program.