CN103984724A - Visualization interaction method based on space optimization tree layout - Google Patents
Visualization interaction method based on space optimization tree layout Download PDFInfo
- Publication number
- CN103984724A CN103984724A CN201410205449.1A CN201410205449A CN103984724A CN 103984724 A CN103984724 A CN 103984724A CN 201410205449 A CN201410205449 A CN 201410205449A CN 103984724 A CN103984724 A CN 103984724A
- Authority
- CN
- China
- Prior art keywords
- node
- space optimization
- optimization tree
- amplified
- layout
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/2425—Iterative querying; Query formulation based on the results of a preceding query
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The invention relates to a visualization interaction method based on a space optimization tree layout and belongs to the technical field of computer graphics and computer visualization. The method comprises the operation steps that (1) a structural information set is visualized by using a space optimization tree layout algorithm, and a space optimization tree layout and an index are obtained; (2) a user determines a view location; (3) a node to be magnified is determined; (4) the to-be-magnified node is magnified. Compared with the prior art, the visualization interaction method based on the space optimization tree layout has the advantages that the side overlap problem in the interaction process is effectively solved during the magnification of the to-be-viewed area, and the computation amount is small.
Description
Technical field
The present invention relates to a kind of visual exchange method based on space optimization tree layout, belong to computer graphics, computer visualization technical field.
Background technology
Space optimization tree placement algorithm is a kind of method for visualizing to hierarchy information set, its advantage is can be in limited display space, to large-scale data, carry out visual, when making full use of viewable area, guarantee all nodes and link between limit not have overlapping phenomenon, thereby make the layout of whole hierarchical structure more clear attractive in appearance.When the relation between node and node is large numbers of, user cannot obtain context and the details of concrete data, as Fig. 1, is a space optimization tree layout that comprises 50000 nodes.This just needs suitable interaction technique to come assisted user to obtain more information.So to the research of the visual exchange method of space optimization tree layout highly significant.
In the extensive relational hierarchy view of showing at highly dense, conventional interaction technique is browsed conversion and flake torsional deformation.These interaction techniques increase the amplification degree of focus subhierarchy malformation by redefining original magnification function, thereby allow user to check the details of any area-of-interest in the visualization structure figure of highly dense.
Browse conversion and the geometric layout of these two kinds of interaction techniques of flake torsional deformation and relationship type hierarchical structure independent, deformation algorithm only with the coordinates correlation of each node, and have nothing to do with the placement algorithm of concrete employing.The specific implementation step of these algorithms is as follows:
Step 1, choose mobile node.For computing machine, to choosing the judgement of node, be but the process of a relative complex.General way is all nodes of traversal, and relatively whether position and the mouse click location of each node mate, thereby find out selected node.
Step 2, user will choose node motion to arrive new position.
Step 3, determine the coordinate system that viewable area is new, by concrete transfer function, the new coordinate of all the other nodes of recursive calculation.
Step 4, according to new node coordinate, draw layout.
These interaction techniques exist common shortcoming to be: 1. calculated amount is large; 2. in deformation process, produce the problem that limit covers, along with number of nodes scale constantly becomes large, the overlapping situation in limit is also more and more serious; 3. these interaction techniques are all only merely out of shape for node coordinate and are not considered the layout characteristics of whole hierarchical structure.Therefore need a kind of new visual exchange method, overcome the above problems.
Summary of the invention
The object of the invention is, in order to solve large-scale data in the visual problem that limit is overlapping and calculated amount is large existing in mutual, to propose a kind of visual exchange method of setting layout based on space optimization.
The object of the invention is to be achieved through the following technical solutions.
A visual exchange method based on space optimization tree layout, its concrete operation step is:
Step 1, usage space optimization tree placement algorithm carry out visual to hierarchy information set, obtain space optimization tree layout and concordance list.
Described space optimization tree layout is arranged in the two-dimensional coordinate system that comprises horizontal ordinate and ordinate.The retrieving information of each node in storage space optimization tree layout in described key.The retrieving information of described node comprises father node address, child node address and the attribute information of this node.The abscissa value that described attribute information comprises this node, ordinate value and area information.
At usage space optimization tree placement algorithm, hierarchy information set is carried out in visual process, each node obtains a polygon that comprises this node.Described area information is the coordinate figure on polygonal whole summits that each node is corresponding.
Step 2, the definite position of checking of user.
On the basis of step 1 operation, in space optimization tree layout interface, user clicks position to be viewed by input equipment.
Step 3, definite node to be amplified.
On the basis of step 2 operation, the position to be viewed of clicking according to user, determines node to be amplified.
The concrete operation method of described definite node to be amplified is:
Step 3.1: the position to be viewed of clicking according to user, obtains click location coordinate.
Step 3.2: retrieve the node that click location coordinate is corresponding in step 1 in the key obtaining, if the coordinate of certain node is in full accord in click location coordinate and key, by whole ancestor nodes of whole descendants's nodes of this node, this node and this node, as node to be amplified.If do not found in key and the on all four node of click location coordinate, according to the area information in key, determine the leaf node that comprises click location coordinate in the polygonal region that leaf node is corresponding, and by whole ancestor nodes of this leaf node and this leaf node, as node to be amplified.
Step 4, treat and amplify node and amplify.
On the basis of step 3 operation, treat amplification node and amplify.Concrete operation step is:
Step 4.1: using root node as end points, generate a ray, the reverse extending line of described ray is crossed the child node that belongs to node to be amplified in root node.
Step 4.2: select a bit on this ray by input equipment, using this point as new root node position.
Step 4.3: determining on the basis of new root node position, usage space optimization tree placement algorithm carries out visualized operation to hierarchy information set again, the space optimization tree layout obtaining realizes treats the amplification of amplifying node.
Have a mind to effect
The visual exchange method based on space optimization tree layout that the present invention proposes compared with the prior art, when amplifying region to be viewed, efficiently solve the limit overlap problem running in reciprocal process, and calculated amount is little.
Accompanying drawing explanation
Fig. 1 is the space optimization tree layout that comprises 50000 nodes in background technology of the present invention;
Fig. 2 is the schematic flow sheet of the visual exchange method based on space optimization tree layout in the specific embodiment of the invention;
Fig. 3 is the luv space optimization that comprises 3000 nodes tree layout in the specific embodiment of the invention.
Fig. 4 is region to be viewed and node schematic diagram to be amplified in the specific embodiment of the invention 1.
Fig. 5 is the space optimization tree layout after the space optimization distortion in the specific embodiment of the invention 1.
Fig. 6 is region to be viewed and node schematic diagram to be amplified in the specific embodiment of the invention 2.
Fig. 7 is the space optimization tree layout after the space optimization distortion in the specific embodiment of the invention 2.
Embodiment
For technical scheme of the present invention is better described, below by 2 embodiment, the present invention will be further described.
The hierarchy information set of using in two embodiment is all comprised of 3000 random hierarchical datas that generate.
Embodiment 1:
The visual exchange method based on space optimization tree layout using in the present embodiment, as shown in Figure 2, concrete operation step is its process flow diagram:
Step 1, set that 3000 of random generation hierarchical datas are formed sets placement algorithm by space optimization and hierarchy information set are carried out visual, obtain space optimization and set layout and concordance list.As shown in Figure 3, node P is root node to space optimization tree layout.
The retrieving information of each node in storage space optimization tree layout in described key.The retrieving information of described node comprises father node address, child node address and the attribute information of this node.The abscissa value that described attribute information comprises this node, ordinate value and area information.
Step 2, the definite position of checking of user.
On the basis of step 1 operation, in space optimization tree layout interface, user clicks position to be viewed by input equipment.Position to be viewed is the some Q in Fig. 4.
Step 3, definite node to be amplified.
On the basis of step 2 operation, according to a Q position, determine node to be amplified.
The concrete operation method of described definite node to be amplified is:
Step 3.1: according to a Q position, obtain click location coordinate.
Step 3.2: retrieve the node that click location coordinate is corresponding in step 1 in the key obtaining, in the position coordinates of some Q and key, node A coordinate is in full accord, therefore by node A, descendants's Node B of node A, C, D, E, F, and the ancestor node G of node A, H, P, as node to be amplified, as shown in Figure 4.
Step 4, treat and amplify node and amplify.
On the basis of step 3 operation, treat amplification node and amplify.Concrete operation step is:
Step 4.1: using root node P as end points, generate a ray, the reverse extending line of described ray is crossed node H.
Step 4.2: select 1 S by mouse on this ray, will put S as new root node position.
Step 4.3: determining on the basis of new root node S position, usage space optimization tree placement algorithm carries out visualized operation to hierarchy information set again, the space optimization tree layout obtaining, as shown in Figure 5, realizes and treats the amplification of amplifying node A, B, C, D, E, F, G, H, P.
Embodiment 2:
Step 1, set that 3000 of random generation hierarchical datas are formed sets placement algorithm by space optimization and hierarchy information set are carried out visual, obtain space optimization and set layout and concordance list.As shown in Figure 3, node P is root node to space optimization tree layout.
The retrieving information of each node in storage space optimization tree layout in described key.The retrieving information of described node comprises father node address, child node address and the attribute information of this node.The abscissa value that described attribute information comprises this node, ordinate value and area information.
Step 2, the definite position of checking of user.
On the basis of step 1 operation, in space optimization tree layout interface, user clicks position to be viewed by input equipment.Position to be viewed is the some R in Fig. 6.
Step 3, definite node to be amplified.
On the basis of step 2 operation, according to a R position, determine node to be amplified.
The concrete operation method of described definite node to be amplified is:
Step 3.1: that clicks according to user will check position R, obtains click location coordinate.
Step 3.2: retrieve the node that click location coordinate is corresponding in step 1 in the key obtaining.In key, do not find and the on all four node of click location coordinate, therefore according to the area information in key, determine the leaf node I that comprises click location coordinate in the polygonal region that leaf node is corresponding, and by whole ancestor node J, G, H, the P of this leaf node I and this leaf node, as node to be amplified, as shown in Figure 6.
Step 4, treat and amplify node and amplify.
On the basis of step 3 operation, treat amplification node and amplify.Concrete operation step is:
Step 4, treat and amplify node and amplify.
On the basis of step 3 operation, treat amplification node and amplify.Concrete operation step is:
Step 4.1: using root node P as end points, generate a ray, the reverse extending line of described ray is crossed node H.
Step 4.2: select 1 T by mouse on this ray, will put T as new root node position.
Step 4.3: determining on the basis of new root node T position, usage space optimization tree placement algorithm carries out visualized operation to hierarchy information set again, the space optimization tree layout obtaining, as shown in Figure 7, realizes and treats the amplification of amplifying node I, J, G, H, P.
Main contents of the present invention have been done detailed introduction by above-mentioned preferred embodiment, will be appreciated that above-mentioned description should not be considered to limitation of the present invention.Those skilled in the art, read after foregoing, for multiple modification of the present invention with to substitute will be all apparent.Therefore, protection scope of the present invention should be limited to the appended claims.
Claims (1)
1. based on space optimization, set a visual exchange method for layout, it is characterized in that: its concrete operation step is:
Step 1, usage space optimization tree placement algorithm carry out visual to hierarchy information set, obtain space optimization tree layout and concordance list;
Described space optimization tree layout is arranged in the two-dimensional coordinate system that comprises horizontal ordinate and ordinate; The retrieving information of each node in storage space optimization tree layout in described key; The retrieving information of described node comprises father node address, child node address and the attribute information of this node; The abscissa value that described attribute information comprises this node, ordinate value and area information;
At usage space optimization tree placement algorithm, hierarchy information set is carried out in visual process, each node obtains a polygon that comprises this node; Described area information is the coordinate figure on polygonal whole summits that each node is corresponding;
Step 2, the definite position of checking of user;
On the basis of step 1 operation, in space optimization tree layout interface, user clicks position to be viewed by input equipment;
Step 3, definite node to be amplified;
On the basis of step 2 operation, the position to be viewed of clicking according to user, determines node to be amplified;
The concrete operation method of described definite node to be amplified is:
Step 3.1: the position to be viewed of clicking according to user, obtains click location coordinate;
Step 3.2: retrieve the node that click location coordinate is corresponding in step 1 in the key obtaining, if the coordinate of certain node is in full accord in click location coordinate and key, by whole ancestor nodes of whole descendants's nodes of this node, this node and this node, as node to be amplified; If do not found in key and the on all four node of click location coordinate, according to the area information in key, determine the leaf node that comprises click location coordinate in the polygonal region that leaf node is corresponding, and by whole ancestor nodes of this leaf node and this leaf node, as node to be amplified;
Step 4, treat and amplify node and amplify;
On the basis of step 3 operation, treat amplification node and amplify; Concrete operation step is:
Step 4.1: using root node as end points, generate a ray, the reverse extending line of described ray is crossed the child node that belongs to node to be amplified in root node;
Step 4.2: select a bit on this ray by input equipment, using this point as new root node position;
Step 4.3: determining on the basis of new root node position, usage space optimization tree placement algorithm carries out visualized operation to hierarchy information set again, the space optimization tree layout obtaining realizes treats the amplification of amplifying node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410205449.1A CN103984724B (en) | 2014-05-15 | 2014-05-15 | Virtual interactive interface method based on space optimization tree layout |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410205449.1A CN103984724B (en) | 2014-05-15 | 2014-05-15 | Virtual interactive interface method based on space optimization tree layout |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103984724A true CN103984724A (en) | 2014-08-13 |
| CN103984724B CN103984724B (en) | 2017-06-13 |
Family
ID=51276697
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410205449.1A Expired - Fee Related CN103984724B (en) | 2014-05-15 | 2014-05-15 | Virtual interactive interface method based on space optimization tree layout |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103984724B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108846075A (en) * | 2018-06-08 | 2018-11-20 | 成都深思科技有限公司 | A kind of intelligent distribution rendering method based on organization structure tree |
| CN111625235A (en) * | 2020-04-17 | 2020-09-04 | 北京大学 | Method and system for constructing and deconstructing tree visualization form based on descriptive language |
| CN116070465A (en) * | 2023-03-07 | 2023-05-05 | 天地信息网络研究院(安徽)有限公司 | Space wave position design method based on overlap ratio optimization |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130127870A1 (en) * | 2011-11-23 | 2013-05-23 | International Business Machines Corporation | Focus-change invariance in a graphical display |
| CN103164520A (en) * | 2013-03-08 | 2013-06-19 | 山东大学 | Interactive visual method and device facing layering data |
-
2014
- 2014-05-15 CN CN201410205449.1A patent/CN103984724B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130127870A1 (en) * | 2011-11-23 | 2013-05-23 | International Business Machines Corporation | Focus-change invariance in a graphical display |
| CN103164520A (en) * | 2013-03-08 | 2013-06-19 | 山东大学 | Interactive visual method and device facing layering data |
Non-Patent Citations (4)
| Title |
|---|
| QUANG VINH NGUYEN ET AL: "Improvements of space-optimized tree for visualizing and manipulating very large hierarchies", 《PAN-SYDNEY AREA WORKSHOP ON VISUAL INFORMATION PROCESSING》 * |
| QUANG VINH NGUYEN ET AL: "Space-optimized tree: a connection+enclosure approach for the visualization of large hierarchies", 《INFORMATION VISUALIZATION》 * |
| 任磊等: "海量层次信息的Focus+Context交互式可视化技术", 《软件学报》 * |
| 毋晓志等: "美学改进的空间优化树绘制", 《计算机工程与应用》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108846075A (en) * | 2018-06-08 | 2018-11-20 | 成都深思科技有限公司 | A kind of intelligent distribution rendering method based on organization structure tree |
| CN108846075B (en) * | 2018-06-08 | 2021-09-21 | 成都深思科技有限公司 | Intelligent layout presentation method based on organization structure tree |
| CN111625235A (en) * | 2020-04-17 | 2020-09-04 | 北京大学 | Method and system for constructing and deconstructing tree visualization form based on descriptive language |
| CN116070465A (en) * | 2023-03-07 | 2023-05-05 | 天地信息网络研究院(安徽)有限公司 | Space wave position design method based on overlap ratio optimization |
| CN116070465B (en) * | 2023-03-07 | 2023-06-02 | 天地信息网络研究院(安徽)有限公司 | Space wave position design method based on overlap ratio optimization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103984724B (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107766309B (en) | Data table generation method and device, storage medium and electronic device | |
| CN103577605A (en) | Data warehouse based on data fusion and data mining and application method of data warehouse | |
| Huang et al. | Knowledge graph construction and application of power grid equipment | |
| Alsallakh et al. | Powerset: A comprehensive visualization of set intersections | |
| CN103914865A (en) | Groups of faces that form a geometrical pattern | |
| CN103514229A (en) | Method and device used for processing database data in distributed database system | |
| CN104462163A (en) | Three-dimensional model characterization method, search method and search system | |
| CN106777086A (en) | A kind of webpage buries dynamic management approach and device a little | |
| CN104615725A (en) | Web-based online self-defined reporting method | |
| CN103984724A (en) | Visualization interaction method based on space optimization tree layout | |
| CN106802958B (en) | Conversion method and system of the CAD data to GIS data | |
| Li et al. | Interactive visualization of high density streaming points with heat-map | |
| CN101741623B (en) | Method for network visualization | |
| Hinge et al. | Distributed graph layout with Spark | |
| CN104133891A (en) | Method for storing massive structural data based on relational database | |
| CN104317972B (en) | A kind of dynamic layer inducing method and system | |
| Lin et al. | RABID--A General Distributed R Processing Framework Targeting Large Data-Set Problems | |
| Zhu | Improved collective influence of finding most influential nodes based on disjoint-set reinsertion | |
| CN204557477U (en) | Based on the cluster result system of data warehouse and OLAP technology | |
| US10331837B1 (en) | Device graphics rendering for electronic designs | |
| Xia et al. | A fast and automatic hole-filling method based on feature line recovery | |
| CN102522045B (en) | Network video on-line geographic positioning system based on social information | |
| Liao et al. | Application study of information visualization in digital library | |
| Máté et al. | Persistence intervals of fractals | |
| Wang et al. | The application of data cubes in business data visualization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Fengxia Inventor after: Li Zhongjun Inventor after: Liu Qian Inventor after: Yu Yue Inventor after: Zhu Zewei Inventor after: Li Tao Inventor before: Li Fengxia Inventor before: Li Zhongjun Inventor before: Liu Qian Inventor before: Yu Yue Inventor before: Zhu Zewei Inventor before: Qiao Jiancheng |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170613 Termination date: 20180515 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |