Method for automatically arranging and matching graph onto figure, and computer-readable medium
Inventors
WON, Sung Ho • LEE, Sung Young
Assignees
Interested in licensing this patent?
MTEC can help explore whether this patent might be available for licensing for your application.
Publication Number
US-12062120-B2
Publication Date
2024-08-13
Expiration Date
Abstract
A method for automatically arranging and matching a graph onto a figure, and a computer-readable medium, according to one embodiment of the present invention, include the steps of: (a) receiving data to be used for graph generation; (b) generating a graph including first meta information; (c) generating an arrangement layout including second meta information and including at least one arrangement region in which the generated graph may be arranged; and (d) optimally arranging the generated graph in the at least one arrangement region by using the first meta information and the second meta information.
Core Innovation
The invention provides an automated system and method for arranging and matching a generated graph onto a figure. It automatically generates a graph including first meta information and generates an arrangement layout including second meta information with a plurality of arrangement regions, and then optimally arranges the graph in a selected arrangement region among the plurality of arrangement regions by using the first meta information and the second meta information.
The first meta information includes geometric information of the graph and attribute information of the graph. The second meta information includes geometric information of the plurality of arrangement regions and attribute information of the selected arrangement region. The invention includes processing the first meta information by replacing the first meta information with the second meta information to generate third meta information to optimize the graph for the selected arrangement region.
After generating the third meta information, the method re-renders the graph based on the third meta information. The attribute information includes information related to at least one of a font, a font size, a unit of size, a color of a shape, a size of a shape, a unit of size of a shape, and a type of a shape. The system additionally supports optional processing for combining graphs across multiple arrangement regions into a single figure, and includes user interfaces and component workflows for data collection, graph generation, arrangement layout generation, graph arrangement, and re-rendering.
Claims Coverage
The document includes two independent claims: a computer-implemented method and a non-transitory computer readable medium. Each independent claim centers on optimally arranging a generated graph into a selected arrangement region using first meta information and second meta information, with processing that replaces first meta information with second meta information to generate third meta information and re-rendering the graph.
Automatic graph arranging and matching onto a figure via meta information replacement and re-rendering
The method receives data used for graph generation; generates a graph including first meta information; generates an arrangement layout including second meta information and a plurality of arrangement regions in which the graph is arrangeable; and optimally arranges the graph in a selected arrangement region using the first meta information and the second meta information by processing the first meta information through replacement with the second meta information to generate third meta information to optimize the graph for the selected arrangement region, and re-rendering the graph based on the third meta information.
Non-transitory computer readable medium storing program implementing meta information replacement and re-rendering
A non-transitory computer readable medium stores a computer program which, when executed, implements receiving data used for graph generation; generating a graph including first meta information; generating an arrangement layout including second meta information and a plurality of arrangement regions in which the graph is arrangeable; and optimally arranging the graph in a selected arrangement region using the first meta information and the second meta information by replacing the first meta information with the second meta information to generate third meta information to optimize the graph for the selected arrangement region; and re-rendering the graph based on the third meta information.
Across both independent claims, the core inventive concept is using first meta information and second meta information to generate third meta information via replacement, and then re-rendering the graph to match an automatically selected arrangement region on a figure.
Stated Advantages
Not explicitly described in patent.
Documented Applications
Not explicitly described in patent.
Interested in licensing this patent?