CN110544284A - method for automatically planning optimal layout flow chart - Google Patents
method for automatically planning optimal layout flow chart Download PDFInfo
- Publication number
- CN110544284A CN110544284A CN201910846790.8A CN201910846790A CN110544284A CN 110544284 A CN110544284 A CN 110544284A CN 201910846790 A CN201910846790 A CN 201910846790A CN 110544284 A CN110544284 A CN 110544284A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- height
- width
- axis
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- User Interface Of Digital Computer (AREA)
- Processing Or Creating Images (AREA)
Abstract
the invention discloses a method for automatically planning an optimal layout flow chart, which can be called at any stage of user configuration, after calling, workflow nodes on an interface can be automatically arranged according to the self-adaptive size of the node name content, the sequence of adding the workflow nodes by a user is from left to right and from top to bottom, parent-child relationship is embodied by automatic line changing, the logical relationship in front of each workflow node can be seen at a glance, and connecting lines among the workflow nodes are calculated by a method, so that the situation of crossing the workflow nodes is avoided.
Description
Technical Field
The invention relates to the technical field of flow chart layout, in particular to a method for automatically planning an optimal layout flow chart.
background
With the development of graphical technology, people tend to replace original lengthy plain text descriptions with relatively intuitive flow charts or model diagrams when expressing their own ideas or describing a piece of complex business logic. Therefore, the problem description itself can become vivid and interesting, and the thinking process of the author itself and the association relationship among all the sub-modules can be reflected. However, when the workflow is edited by using the existing workflow development tool, a lot of time is often consumed for the adjustment of the workflow node layout and the connecting lines, and due to the randomness of manually dragging the workflow nodes, the situations of workflow node overlapping, connecting line overlapping, crossing and even crossing the workflow nodes often occur, so that the extra work of the user is greatly increased by processing the abnormal situations, and the work efficiency of the user is seriously reduced.
In order to solve the above problems, the inventor has developed a method for automatically planning an optimal layout flowchart.
disclosure of Invention
the present invention is directed to a method for automatically planning an optimal layout flowchart to solve the above problems.
the invention realizes the purpose through the following technical scheme:
a method for automatically planning an optimal layout flowchart is characterized by comprising the following steps:
the method comprises the following steps: setting the maximum width or height of a workflow node, and setting the interval width and height of the node;
step two: acquiring all configured workflow nodes in the current workflow tool, wherein the configured workflow nodes comprise parent-child relationships among the nodes;
Step three: traversing all workflow nodes, acquiring each node name, then acquiring the pixel length and the pixel height which are completely needed to be displayed under the condition that the node names are not subjected to line feed, and finally obtaining the maximum value of the length and the height;
step four: acquiring the width and height of a node during automatic layout;
step five: constructing a virtual two-dimensional coordinate grid, wherein the grid is divided into an X axis and a Y axis and is arranged from top to bottom and from left to right, each scale of the X axis represents one column, the width of an odd column is the width of a node obtained in step four, the width of an even column is the width of a space between nodes set by a user in step one, each scale of the Y axis represents one row of the layout, the height of an odd row is the height of the node obtained in step four, and the height of an even row is the height of the space between the nodes set by the user in step one;
Step six: taking out the workflow nodes obtained in the second step one by one in a top-down recursive mode;
Step seven: after the sixth step is completed, all workflow nodes have the x and y coordinates of the workflow nodes in the virtual two-dimensional coordinate network, and the placement positions of the nodes in the canvas are obtained through calculation;
step eight: drawing all the workflow nodes into the canvas and displaying by using the pixel positions of the workflow nodes relative to the canvas obtained in the step seven and the pixel sizes of the workflow nodes obtained in the step four;
step nine: all workflow nodes are recursed using a top-down recursion approach and all nodes are connected two by two using polylines with arrows.
specifically, in step four:
(1) if the user sets the maximum width value, firstly judging whether the maximum width value is larger than the maximum length value obtained in the third step, if so, using the maximum length value obtained in the third step as the node width when the maximum width value is automatically laid out, and if so, using the maximum width set by the user as the node width, wherein the node height is the maximum length value obtained in the third step divided by the node width;
(2) if the user sets a height value, the node length is the maximum length obtained in step three ÷ (node height ÷ maximum height obtained in step three), and the remainder is rounded in the calculation formula.
specifically, in the sixth step:
(1) Judging whether the node has a father node or not, if no father node indicates that the front node is a top node, firstly adding two rows and two columns in the virtual two-dimensional coordinate network, and then placing the node into the first row and the first column which are newly added;
(2) judging whether the node has a father node, firstly finding out the coordinates (x, y) of the father node and calculating to obtain the coordinates (x +2, y) of the current node, secondly judging whether the coordinates (x +2) exist in the virtual two-dimensional coordinate system, and if not, establishing x-axis coordinates of two columns and two columns until the current node can be put in;
(3) judging that the node has two or more father nodes, firstly obtaining the father node (X1, y1) with the maximum X-axis value by traversing the father nodes, secondly adding two rows of y1+1 and y1+2 below y1 in a virtual two-dimensional coordinate system, calculating again to obtain the coordinates (X1+2, y1+2) of the current node, judging again whether the X1+2 coordinates exist in the virtual two-dimensional coordinate system, if not, establishing X-axis coordinates of two columns and two columns until the current node can be put in, finally traversing all the nodes already put in the virtual two-dimensional coordinate system, judging whether the y-axis coordinate of the node is greater than y1, if not, changing, if so, updating the y-axis coordinate of the node to be the original y-axis value + 2;
specifically, in the seventh step: the pixel position of the top of the node relative to the top of the canvas is (node y-axis coordinate ÷ 2) × (node height + spacing height between nodes), and the pixel position of the left side of the node relative to the canvas is (node x-axis coordinate ÷ 2) × (node width + spacing width between nodes).
specifically, in the ninth step:
(1) calculating the coordinates (x, y) of the starting position of the polyline relative to the canvas; x ═ pixel position on the left side of the node relative to the canvas + parent node width, y ═ pixel position at the top of the parent node relative to the top of the canvas + parent node height ÷ 2;
(2) calculating coordinates (x, y) of the end position of the polyline relative to the canvas; x is (pixel position on the left side of the sub-point relative to the canvas + sub-node width), y is pixel position on the top of the sub-node relative to the canvas + sub-node height ÷ 2;
(3) If the parent node and the child node are not in the same row, coordinates (x1, y1) and (x2, y2) of two turning points of the broken line relative to the canvas need to be calculated, wherein (x1, y1) represents the turning point of the same row as the parent node, and (x2, y2) represents the turning point of the same row as the child node;
(4) To obtain two turning points of (X1, y1) and (X2, y2), first, the X-axis median point coordinate between the parent node and the child node is obtained, where the median point X-axis coordinate is ═ (child node X-axis coordinate — parent node X-axis coordinate) ÷ 2, where y1 is y of the parent node, and y2 is y of the child node;
(5) Each time +2 is started from the x-axis coordinate of the father node, the x-axis coordinate of the next horizontal node is obtained until the x-axis coordinate of the middle point is obtained, and each time the x-axis coordinate is obtained, the y-axis coordinate of the next vertical node is also required to be obtained from the y-axis coordinate of the father node for each time +2 until the y-axis coordinate of the child node is obtained, so that a vertical coordinate range is obtained;
(6) judging whether other points exist in the vertical coordinate range, if so, the current x-1 is the x-axis coordinate of the turning point, if not, the step (5) is continuously executed until the last vertical coordinate range is obtained, and the x-axis coordinate of the turning point is the x-1 of the last vertical coordinate range;
(7) and (4) after obtaining the complete coordinate points of the connecting line through the steps (3), (4), (5) and (6), connecting the points to draw a broken line, and drawing a rightward arrow at the last point to represent the direction of the connecting line.
the invention has the beneficial effects that:
1. The size of the workflow nodes in the layout is self-adaptive according to the display content of all the nodes.
2. The workflow nodes are not overlapped and covered, the relative distances are uniform, and the layout is attractive.
3. and automatically generating a connecting line according to the parent-child relationship of the workflow nodes, wherein the connecting line and the nodes are not overlapped.
4. the nodes are subjected to simulated layout in a virtual two-dimensional coordinate grid mode, actual UI operation is avoided, and layout is efficient.
drawings
FIG. 1 is a prior art representation of a node flow manually dragged in by a user;
fig. 2 is a node flow presentation after the present invention is employed.
Detailed Description
the invention will be further described with reference to the accompanying drawings in which:
A method for automatically planning an optimal layout flowchart comprises the following steps:
The method comprises the following steps: setting the maximum width value or the maximum height value (alternative one) of the workflow nodes, and setting the interval width and the height of the nodes;
step two: acquiring all configured workflow nodes in the current workflow tool, wherein the configured workflow nodes comprise parent-child relationships among the nodes;
step three: traversing all workflow nodes, obtaining each node name, then obtaining the pixel length and the pixel height which are completely needed to be displayed under the condition that the node names are not subjected to line feed by using a built-in method Formattext of C #, and finally obtaining the maximum value of the length and the height;
step four: acquiring the width and height of a node during automatic layout;
(1) If the user sets the maximum width value, firstly judging whether the maximum width value is larger than the maximum length value obtained in the third step, if so, using the maximum length value obtained in the third step as the node width when the maximum width value is automatically laid out, and if so, using the maximum width set by the user as the node width, wherein the node height is the maximum length value obtained in the third step divided by the node width;
(2) if the user sets a height value, the node length is the maximum length obtained in step three ÷ (node height ÷ maximum height obtained in step three), and the remainder is rounded in the calculation formula.
Step five: constructing a virtual two-dimensional coordinate grid, wherein the grid is divided into an X axis and a Y axis and is arranged from top to bottom and from left to right, each scale of the X axis represents one column, the width of an odd column is the width of a node obtained in step four, the width of an even column is the width of a space between nodes set by a user in step one, each scale of the Y axis represents one row of the layout, the height of an odd row is the height of the node obtained in step four, and the height of an even row is the height of the space between the nodes set by the user in step one;
step six: taking out the workflow nodes obtained in the second step one by one in a top-down recursive mode;
(1) Judging whether the node has a father node or not, if no father node indicates that the front node is a top node, firstly adding two rows and two columns in the virtual two-dimensional coordinate network, and then placing the node into the first row and the first column which are newly added;
(2) Judging whether the node has a father node, firstly finding out the coordinates (x, y) of the father node and calculating to obtain the coordinates (x +2, y) of the current node, secondly judging whether the coordinates (x +2) exist in the virtual two-dimensional coordinate system, and if not, establishing x-axis coordinates of two columns and two columns until the current node can be put in;
(3) judging that the node has two or more father nodes, firstly obtaining the father node (X1, y1) with the maximum X-axis value by traversing the father nodes, secondly adding two rows of y1+1 and y1+2 below y1 in a virtual two-dimensional coordinate system, calculating again to obtain the coordinates (X1+2, y1+2) of the current node, judging again whether the X1+2 coordinates exist in the virtual two-dimensional coordinate system, if not, establishing X-axis coordinates of two columns and two columns until the current node can be put in, finally traversing all the nodes already put in the virtual two-dimensional coordinate system, judging whether the y-axis coordinate of the node is greater than y1, if not, changing, if so, updating the y-axis coordinate of the node to be the original y-axis value + 2;
step seven: after the sixth step is completed, all workflow nodes have the x and y coordinates of the workflow nodes in the virtual two-dimensional coordinate network, and the placement positions of the nodes in the canvas are obtained through calculation;
the pixel position at the top of the node relative to the canvas top is (node y-axis coordinate ÷ 2) ((here rounding) × (node height + height of the interval between nodes)), and the pixel position at the left side of the node relative to the canvas is (node x-axis coordinate ÷ 2) ((here rounding) × (node width + width of the interval between nodes)).
step eight: drawing all the workflow nodes into the canvas and displaying by using the pixel positions of the workflow nodes relative to the canvas obtained in the step seven and the pixel sizes of the workflow nodes obtained in the step four;
Step nine: all workflow nodes are recursed using a top-down recursion approach and all nodes are connected two by two using polylines with arrows.
(1) Calculating the coordinates (x, y) of the starting position of the polyline relative to the canvas; x ═ pixel position on the left side of the node relative to the canvas + parent node width, y ═ pixel position at the top of the parent node relative to the top of the canvas + parent node height ÷ 2;
(2) calculating coordinates (x, y) of the end position of the polyline relative to the canvas; x is (pixel position on the left side of the sub-point relative to the canvas + sub-node width), y is pixel position on the top of the sub-node relative to the canvas + sub-node height ÷ 2;
(3) if the parent node and the child node are not in the same row, coordinates (x1, y1) and (x2, y2) of two turning points of the broken line relative to the canvas need to be calculated, wherein (x1, y1) represents the turning point of the same row as the parent node, and (x2, y2) represents the turning point of the same row as the child node;
(4) to obtain two turning points of (X1, y1) and (X2, y2), first, the X-axis median point coordinate between the parent node and the child node is obtained, where the median point X-axis coordinate is ═ (child node X-axis coordinate — parent node X-axis coordinate) ÷ 2, where y1 is y of the parent node, and y2 is y of the child node;
(5) each time +2 is started from the x-axis coordinate of the father node, the x-axis coordinate of the next horizontal node is obtained until the x-axis coordinate of the middle point is obtained, and each time the x-axis coordinate is obtained, the y-axis coordinate of the next vertical node is also required to be obtained from the y-axis coordinate of the father node for each time +2 until the y-axis coordinate of the child node is obtained, so that a vertical coordinate range is obtained;
(6) Judging whether other points exist in the vertical coordinate range, if so, the current x-1 is the x-axis coordinate of the turning point, if not, the step (5) is continuously executed until the last vertical coordinate range is obtained, and the x-axis coordinate of the turning point is the x-1 of the last vertical coordinate range;
(7) and (4) after obtaining the complete coordinate points of the connecting line through the steps (3), (4), (5) and (6), connecting the points to draw a broken line, and drawing a rightward arrow at the last point to represent the direction of the connecting line.
the method has the advantages that the efficient function is specifically that all workflow nodes are subjected to simulated layout in a virtual two-dimensional coordinate network mode, no UI operation is performed in the layout process, and the efficiency is extremely high;
the beautiful and non-overlapping layout display function of the invention is that firstly, through the layout method, all nodes can be free of coverage, and parent and child nodes are as close as possible. The two automatic connection methods can achieve the shortest path of connection and no coverage exists between the connection and the node.
FIG. 1 illustrates a node flow presentation manually dragged in by a user;
fig. 2 shows a node flow display organized by the method of the present application.
the present invention is not limited to the above preferred embodiments, and any modifications, equivalent substitutions and improvements made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (5)
1. a method for automatically planning an optimal layout flowchart is characterized by comprising the following steps:
the method comprises the following steps: setting the maximum width or height of a workflow node, and setting the interval width and height of the node;
step two: acquiring all configured workflow nodes in the current workflow tool, wherein the configured workflow nodes comprise parent-child relationships among the nodes;
step three: traversing all workflow nodes, acquiring each node name, then acquiring the pixel length and the pixel height which are completely needed to be displayed under the condition that the node names are not subjected to line feed, and finally obtaining the maximum value of the length and the height;
Step four: acquiring the width and height of a node during automatic layout;
Step five: constructing a virtual two-dimensional coordinate grid, wherein the grid is divided into an X axis and a Y axis and is arranged from top to bottom and from left to right, each scale of the X axis represents one column, the width of an odd column is the width of a node obtained in step four, the width of an even column is the width of a space between nodes set by a user in step one, each scale of the Y axis represents one row of the layout, the height of an odd row is the height of the node obtained in step four, and the height of an even row is the height of the space between the nodes set by the user in step one;
step six: taking out the workflow nodes obtained in the second step one by one in a top-down recursive mode;
step seven: after the sixth step is completed, all workflow nodes have the x and y coordinates of the workflow nodes in the virtual two-dimensional coordinate network, and the placement positions of the nodes in the canvas are obtained through calculation;
step eight: drawing all the workflow nodes into the canvas and displaying by using the pixel positions of the workflow nodes relative to the canvas obtained in the step seven and the pixel sizes of the workflow nodes obtained in the step four;
Step nine: all workflow nodes are recursed using a top-down recursion approach and all nodes are connected two by two using polylines with arrows.
2. the method for automatically planning optimal layout flowchart according to claim 1, wherein in step four:
(1) if the user sets the maximum width value, firstly judging whether the maximum width value is larger than the maximum length value obtained in the third step, if so, using the maximum length value obtained in the third step as the node width when the maximum width value is automatically laid out, and if so, using the maximum width set by the user as the node width, wherein the node height is the maximum length value obtained in the third step divided by the node width;
(2) if the user sets a height value, the node length is the maximum length obtained in step three ÷ (node height ÷ maximum height obtained in step three), and the remainder is rounded in the calculation formula.
3. the method for automatically planning an optimal layout flowchart according to claim 1, wherein in step six:
(1) judging whether the node has a father node or not, if no father node indicates that the front node is a top node, firstly adding two rows and two columns in the virtual two-dimensional coordinate network, and then placing the node into the first row and the first column which are newly added;
(2) Judging whether the node has a father node, firstly finding out the coordinates (x, y) of the father node and calculating to obtain the coordinates (x +2, y) of the current node, secondly judging whether the coordinates (x +2) exist in the virtual two-dimensional coordinate system, and if not, establishing x-axis coordinates of two columns and two columns until the current node can be put in;
(3) Judging whether the node has two or more father nodes, firstly obtaining the father node (X1, y1) with the maximum X-axis value by traversing the father nodes, secondly adding two rows of y1+1 and y1+2 below y1 in a virtual two-dimensional coordinate system, calculating again to obtain the coordinates (X1+2, y1+2) which should be put into the current node, judging again whether the X1+2 coordinates exist in the virtual two-dimensional coordinate system, if not, establishing the X-axis coordinates of the two rows and the two columns until the current node can be put into the virtual two-dimensional coordinate system, finally traversing all the nodes which are already put into the virtual two-dimensional coordinate system, judging whether the y-axis coordinate of the node is larger than y1, if not, changing, and if so, updating the y-axis coordinate of the node to be the original y-axis value + 2.
4. The method for automatically planning an optimal layout flowchart according to claim 1, wherein in step seven: the pixel position of the top of the node relative to the top of the canvas is (node y-axis coordinate ÷ 2) × (node height + spacing height between nodes), and the pixel position of the left side of the node relative to the canvas is (node x-axis coordinate ÷ 2) × (node width + spacing width between nodes).
5. The method for automatically planning an optimal layout flowchart according to claim 1, wherein in the ninth step:
(1) Calculating the coordinates (x, y) of the starting position of the polyline relative to the canvas; x ═ pixel position on the left side of the node relative to the canvas + parent node width, y ═ pixel position at the top of the parent node relative to the top of the canvas + parent node height ÷ 2;
(2) calculating coordinates (x, y) of the end position of the polyline relative to the canvas; x is (pixel position on the left side of the sub-point relative to the canvas + sub-node width), y is pixel position on the top of the sub-node relative to the canvas + sub-node height ÷ 2;
(3) If the parent node and the child node are not in the same row, coordinates (x1, y1) and (x2, y2) of two turning points of the broken line relative to the canvas need to be calculated, wherein (x1, y1) represents the turning point of the same row as the parent node, and (x2, y2) represents the turning point of the same row as the child node;
(4) to obtain two turning points of (X1, y1) and (X2, y2), first, the X-axis median point coordinate between the parent node and the child node is obtained, where the median point X-axis coordinate is ═ (child node X-axis coordinate — parent node X-axis coordinate) ÷ 2, where y1 is y of the parent node, and y2 is y of the child node;
(5) each time +2 is started from the x-axis coordinate of the father node, the x-axis coordinate of the next horizontal node is obtained until the x-axis coordinate of the middle point is obtained, and each time the x-axis coordinate is obtained, the y-axis coordinate of the next vertical node is also required to be obtained from the y-axis coordinate of the father node for each time +2 until the y-axis coordinate of the child node is obtained, so that a vertical coordinate range is obtained;
(6) judging whether other points exist in the vertical coordinate range, if so, the current x-1 is the x-axis coordinate of the turning point, if not, the step (5) is continuously executed until the last vertical coordinate range is obtained, and the x-axis coordinate of the turning point is the x-1 of the last vertical coordinate range;
(7) And (4) after obtaining the complete coordinate points of the connecting line through the steps (3), (4), (5) and (6), connecting the points to draw a broken line, and drawing a rightward arrow at the last point to represent the direction of the connecting line.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910846790.8A CN110544284B (en) | 2019-09-09 | 2019-09-09 | Method for automatically planning optimal layout flow chart |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910846790.8A CN110544284B (en) | 2019-09-09 | 2019-09-09 | Method for automatically planning optimal layout flow chart |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110544284A true CN110544284A (en) | 2019-12-06 |
| CN110544284B CN110544284B (en) | 2023-04-11 |
Family
ID=68712932
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910846790.8A Active CN110544284B (en) | 2019-09-09 | 2019-09-09 | Method for automatically planning optimal layout flow chart |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110544284B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113012260A (en) * | 2021-02-09 | 2021-06-22 | 福建天泉教育科技有限公司 | Method and terminal for erasing cross area under Canvas |
| CN114064956A (en) * | 2021-11-23 | 2022-02-18 | 重庆允成互联网科技有限公司 | Node positioning method and configuration method based on visual configuration of trigger |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030055851A1 (en) * | 2000-11-22 | 2003-03-20 | Williamson David E. | Automated paragraph layout |
| CN103473388A (en) * | 2013-07-25 | 2013-12-25 | 深圳市华傲数据技术有限公司 | System and device capable of realizing automatic layout of flow chart |
| CN105550021A (en) * | 2015-11-30 | 2016-05-04 | 用友网络科技股份有限公司 | Cross-browser dynamic presentation method and cross-browser dynamic presentation apparatus |
| CN107016145A (en) * | 2015-12-30 | 2017-08-04 | 台湾积体电路制造股份有限公司 | Integrated circuit |
| CN109886509A (en) * | 2019-03-29 | 2019-06-14 | 长春理工大学 | A kind of mobile poly concourse nodes paths planning method, system and electronic equipment |
| CN109962811A (en) * | 2019-01-07 | 2019-07-02 | 西南科技大学 | A kind of increment type stable state layout method for time-varying network data |
| CN110086665A (en) * | 2019-04-25 | 2019-08-02 | 北京计算机技术及应用研究所 | A kind of network topological diagram methods of exhibiting based on jTopo |
-
2019
- 2019-09-09 CN CN201910846790.8A patent/CN110544284B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030055851A1 (en) * | 2000-11-22 | 2003-03-20 | Williamson David E. | Automated paragraph layout |
| CN103473388A (en) * | 2013-07-25 | 2013-12-25 | 深圳市华傲数据技术有限公司 | System and device capable of realizing automatic layout of flow chart |
| CN105550021A (en) * | 2015-11-30 | 2016-05-04 | 用友网络科技股份有限公司 | Cross-browser dynamic presentation method and cross-browser dynamic presentation apparatus |
| CN107016145A (en) * | 2015-12-30 | 2017-08-04 | 台湾积体电路制造股份有限公司 | Integrated circuit |
| CN109962811A (en) * | 2019-01-07 | 2019-07-02 | 西南科技大学 | A kind of increment type stable state layout method for time-varying network data |
| CN109886509A (en) * | 2019-03-29 | 2019-06-14 | 长春理工大学 | A kind of mobile poly concourse nodes paths planning method, system and electronic equipment |
| CN110086665A (en) * | 2019-04-25 | 2019-08-02 | 北京计算机技术及应用研究所 | A kind of network topological diagram methods of exhibiting based on jTopo |
Non-Patent Citations (1)
| Title |
|---|
| 边旭 等: "流程图布局算法实现", 《数字技术与应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113012260A (en) * | 2021-02-09 | 2021-06-22 | 福建天泉教育科技有限公司 | Method and terminal for erasing cross area under Canvas |
| CN113012260B (en) * | 2021-02-09 | 2023-04-28 | 福建天泉教育科技有限公司 | Method and terminal for erasing crossing area under Canvas |
| CN114064956A (en) * | 2021-11-23 | 2022-02-18 | 重庆允成互联网科技有限公司 | Node positioning method and configuration method based on visual configuration of trigger |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110544284B (en) | 2023-04-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108121863B (en) | Method, device and equipment for creating pipeline label and computer readable storage medium | |
| CN110544284B (en) | Method for automatically planning optimal layout flow chart | |
| CN104751507B (en) | Graphical content rendering intent and device | |
| CN105512099B (en) | Gantt chart generation method and apparatus | |
| CN110675471B (en) | Node connection line generation method, device, equipment and storage medium | |
| CN101650798A (en) | Flow modeling method | |
| CN103020335A (en) | Method for automatically converting distribution network geographic wiring diagram into region orthogonal diagram | |
| US20130278638A1 (en) | Flowchart drawing apparatus, flowchart drawing method and program | |
| CN110958134A (en) | Method and device for realizing network topology | |
| CN110688713A (en) | Circuit connection system of three-dimensional design of electric equipment of power transformation engineering | |
| CN101908215B (en) | Spatial data fusing method | |
| CN105867930A (en) | Display method and device for function calling relation and terminal | |
| JP2006317450A5 (en) | ||
| CN106815410A (en) | Cable method for drafting and device | |
| CN116976057B (en) | Automatic arrangement method for device layout | |
| CN103310409A (en) | Quick triangle partitioning method of Tile-based rendering architecture central processing unit (CPU) | |
| CN111241779B (en) | Method for designing irregular parallel lines based on Cadence design software | |
| CN109739859B (en) | Relation map drawing method, system and related device | |
| CN111639412A (en) | Method for automatically generating single line diagram based on geographical edge layout | |
| CN104461577A (en) | Flow chart display method based on HTML5 graph drawing program | |
| CN102999944B (en) | The embossment model modelling approach of a kind of border subregion | |
| CN102074030B (en) | A kind of acquisition, the method for editing self-defined figure and subtitle graphic manufacturing system | |
| CN103838924B (en) | Display method and device of three-dimensional model information | |
| CN111476862B (en) | Dynamic broken line generation method for optical fiber primitive | |
| CN116681864B (en) | Space grid generation method, device, equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: No. 2119, Unit 1, Building 7, No. 1700, North Section of Tianfu Avenue, Hi-tech Zone, Chengdu, Sichuan, 610000 Applicant after: Chengdu Fengwei Technology Co.,Ltd. Address before: No. 2119, Unit 1, Building 7, No. 1700, North Section of Tianfu Avenue, Hi-tech Zone, Chengdu, Sichuan, 610000 Applicant before: CHENGDU SHENSI SCIENCE & TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |