CN110457030B - Mobile adaptive rearrangement method and device for component arrangement - Google Patents
Mobile adaptive rearrangement method and device for component arrangement Download PDFInfo
- Publication number
- CN110457030B CN110457030B CN201910947490.9A CN201910947490A CN110457030B CN 110457030 B CN110457030 B CN 110457030B CN 201910947490 A CN201910947490 A CN 201910947490A CN 110457030 B CN110457030 B CN 110457030B
- Authority
- CN
- China
- Prior art keywords
- component
- components
- website
- list
- strong correlation
- 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.)
- Active
Links
Images
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/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
- G06F16/986—Document structures and storage, e.g. HTML extensions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/34—Graphical or visual programming
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- User Interface Of Digital Computer (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a mobile adaptive rearrangement method and a device for component arrangement, which comprises a PC website needing to be arranged and also comprises the following steps: s1, acquiring a component list of the PC website; s2, regrouping the components according to the cross relationship among the PC website components to obtain a component set and a component set list; s3, sorting the component set in the component set list by using a component sorting algorithm according to the position relation of the component set in the PC website; and S4, rearranging according to the sequence of the component sets determined in the step S3. The method and the device solve the problem that the component type of the website generator is relatively single, and when the component with rich types is faced, the complex page layout cannot be dealt with according to the single rearrangement rule of the website generator.
Description
Technical Field
The invention relates to the technical field of automatic rearrangement of visual editors, in particular to an automatic rearrangement technology of a multi-component visual editor based on free layout to adapt to arrangement of mobile equipment.
Background
The method for realizing the adaptive arrangement of the mobile website comprises the following steps: firstly, finishing the arrangement of a PC website, wherein the PC website is in a plate type, and the plate is relatively fixed. And secondly, triggering the adaptive rearrangement of the mobile website after finishing the arrangement. And thirdly, treating all the plates from top to bottom. And fourthly, discharging all elements in the same plate in another row, and neglecting factors such as whether the elements are overlapped. And fifthly, traversing all the plates and arranging according to the same rule.
In order to achieve a good effect, we need to identify the component relationship in the original layout and restore the component relationship as much as possible in the rearrangement process. The use scenes of most website generators are relatively limited, and the general structures of menu bars, page plates and the like of the webpages are fixed and cannot be changed. And some systems support users to use any canvas size and perform component arrangement at any position in the canvas, so that the scenes are richer.
The types of components of the website generator are relatively single, and when the types of the components are rich, complex page arrangement cannot be dealt with according to a single rearrangement rule of the website generator.
Disclosure of Invention
The invention aims to: the mobile adaptive rearrangement method for the component arrangement solves the problem that the component type of a website generator is relatively single, and when the component with rich types is faced, the complex page arrangement cannot be dealt with according to the single rearrangement rule of the website generator.
The technical scheme adopted by the invention is as follows:
a mobile adaptive rearrangement method for component arrangement comprises a PC website needing arrangement and further comprises the following steps:
s1, acquiring a component list of the PC website;
s2, regrouping the components according to the relation between the PC website components to obtain a component set and a component set list;
s3, sorting the component set in the component set list by using a component sorting algorithm according to the position relation of the component set in the PC website;
and S4, rearranging according to the sequence of the component sets determined in the step S3.
Further, the method for regrouping the components according to the relationship between the PC website components in step S2 includes the following steps:
s201, traversing all the components according to the component list, carrying out cross relation calculation on any two components, and dividing the relation between any two components into a strong correlation relation and a non-strong correlation relation;
s202, traversing all the components in the component list, finding out the component with the most strong correlation with other components, forming the component and other components with the strong correlation with the component into a component set, recording the component set in the component set list, and moving the components in the component set out of the component list;
s203, looping step S202 until the number of the components in the component list is 0, and obtaining a final component set and a component set list.
Further, the method for calculating the cross relationship between any two components in step S201 includes the following steps:
s20101, determining the coordinates of the same vertex of the two assemblies and the length and the width of each assembly;
s20102, calculating whether the two assemblies are crossed or not and calculating the area of a crossed area according to the coordinates of the same vertex of the two assemblies and the length and the width of each assembly.
Further, the method for dividing the relationship between any two components into the strong correlation relationship and the non-strong correlation relationship in step S201 includes the following steps:
s20103, judging whether the two components are intersected or not, if not, determining that the two components are in a non-strong correlation relationship, and if so, entering the step S20104;
s20104, dividing the area of the cross region by the areas of the two assemblies respectively to obtain two cross rates;
s20105, comparing the two crossing rates with a preset ratio respectively, if at least one crossing rate is not smaller than a preset value, the two assemblies are in a strong correlation relationship, and if the two crossing rates are smaller than the preset value, the two assemblies are in a non-strong correlation relationship.
The multi-component cross rate identification algorithm is used for identifying one of component relationships through the condition of component cross coverage. There are many relationships between components. Such as: if a picture and a caption are added at the bottom of the picture and the two components form a visual element, the picture component and the caption component can also be considered to be in a strong correlation relationship.
The method is characterized in that various other types of component relationships are recognized, the existing page data can be used by a machine learning technology to mark the data with covering relationships, title relationships and the like, the data are used as data to be trained, and a pattern recognition algorithm is trained to recognize more types of component relationships.
Further, the method for traversing all components in the component list in step S202 to find the component having the most strong correlation with other components includes the following steps:
s20201, representing the relation between any two components obtained in S201 by using an undirected graph, wherein each vertex in the undirected graph represents one component, and if any two components are in a strong correlation relation, an edge is added between the two corresponding vertices;
s20202, traversing the undirected graph, and finding out a vertex with the most edges, wherein the component corresponding to the vertex is the component with the most strong correlation relationship with other components.
Further, the set of components is the smallest graphic that can cover all components in the set of components.
Further, in step S3, according to the position relationship of the component set in the PC website, the method for sorting the component set in the component set list by using the component sorting algorithm includes: and sequencing according to the distance between the component set and the visual origin browsed by the user on the PC website interface, wherein the closer the component set is to the origin, the earlier the sequencing is, and the originally arranged visual sequence is restored as much as possible.
Further, the method for sorting according to the distance between the component set and the visual origin browsed by the user on the PC website interface comprises the following steps:
s301, splitting a canvas area of a PC website interface into a plurality of equal-height horizontal bar areas, wherein the width of each area is the width of the canvas;
s302, traversing all the component sets, judging which horizontal bar area the upper frame of the component set is located in the step S301, and performing grouping and sequencing on the components according to the horizontal bar area where the component set is located, wherein the sequence of the component sets close to the upper horizontal bar area is higher than that of the component sets close to the lower horizontal bar area;
and S303, traversing all the component sets in the transverse bar region by taking the vertex on the central axis of the transverse bar region as an origin for the component sets in any transverse bar region, judging the distances from the component sets to the origin, and sequencing according to the sequence of the distances, wherein the sequencing is closer to the front when the distances are smaller.
Further, the method for determining the distance from the component set to the origin in step S303 includes: judging the relation between the assembly set and the middle axis of the horizontal bar area, and if the assembly set is completely positioned on the right side of the middle axis of the horizontal bar area, calculating the distance from the upper left corner of the assembly to the origin; if the set of components spans the medial axis or is located completely to the left of the medial axis, then the distance from the top right corner of the component to the origin is calculated.
A mobile adaptive rearrangement apparatus for component arrangement, comprising:
a memory for storing executable instructions;
and the processor is used for executing the executable instructions stored in the memory and realizing the mobile adaptive rearrangement method for arranging the components.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. according to the mobile adaptive rearrangement method for arranging the components, the complex component set and the component browsing sequence of the original component arrangement are restored, so that the automatically generated mobile adaptive arrangement effect is more in line with the expectation of a user;
2. the invention relates to a mobile adaptive rearrangement method for component arrangement, which solves the problem that the component type of a website generator is relatively single, and complex page arrangement cannot be dealt with according to a single rearrangement rule of the website generator when components with rich types are faced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts, wherein:
FIG. 1 is a schematic diagram of the layout results of the present invention;
FIG. 2 is a schematic of the cross-rate calculation of the present invention;
FIG. 3 is an undirected graph of the component relationships of the present invention;
FIG. 4 is a component collection diagram of the present invention;
FIG. 5 is a diagram of component collection ordering in accordance with the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to fig. 1 to 5, the described embodiments should not be construed as limiting the present invention, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used herein is for the purpose of describing embodiments of the invention only and is not intended to be limiting of the invention.
Before further detailed description of the embodiments of the present invention, terms and expressions mentioned in the embodiments of the present invention are explained, and the terms and expressions mentioned in the embodiments of the present invention are applied to the following explanations.
A UE designer: the component arranging system comprises a component library, a canvas area, a component list and the like. Components may be selected from a component library, dragged into the canvas area, and laid out in the canvas.
Canvas area: a region for orchestration of a set of components in a UE designer.
Component arrangement: and the geometric property editing such as dragging and zooming of the component in the canvas area is performed.
Mobile adaptation: the user completes the component layout for the PC desktop device and the system generates the component layout for the mobile device.
Rearrangement: the component or collection of components is re-programmed on the canvas.
Example 1
A mobile adaptive rearrangement method for component arrangement comprises a PC website needing arrangement and further comprises the following steps:
s1, acquiring a component list of the PC website;
s2, regrouping the components according to the relation between the PC website components to obtain a component set and a component set list;
s3, sorting the component set in the component set list by using a component sorting algorithm according to the position relation of the component set in the PC website;
and S4, rearranging according to the sequence of the component sets determined in the step S3.
Example 2
The present embodiment is different from embodiment 1 in that the method for regrouping components according to the relationship between PC website components in step S2 includes the following steps:
s201, traversing all the components according to the component list, carrying out cross relation calculation on any two components, and dividing the relation between any two components into a strong correlation relation and a non-strong correlation relation;
s202, traversing all the components in the component list, finding out the component with the most strong correlation with other components, forming the component and other components with the strong correlation with the component into a component set, recording the component set in the component set list, and moving the components in the component set out of the component list;
s203, looping step S202 until the number of the components in the component list is 0, and obtaining a final component set and a component set list.
Example 3
In this embodiment, on the basis of embodiment 2, the method for calculating the cross relationship between any two components in step S201 includes the following steps:
s20101, determining the coordinates of the same vertex of the two assemblies and the length and the width of each assembly;
s20102, calculating whether the two assemblies are crossed or not and calculating the area of a crossed area according to the coordinates of the same vertex of the two assemblies and the length and the width of each assembly.
Further, the method for dividing the relationship between any two components into the strong correlation relationship and the non-strong correlation relationship in step S201 includes the following steps:
s20103, judging whether the two components are intersected or not, if not, determining that the two components are in a non-strong correlation relationship, and if so, entering the step S20104;
s20104, dividing the area of the cross region by the areas of the two assemblies respectively to obtain two cross rates;
s20105, comparing the two crossing rates with a preset ratio respectively, if at least one crossing rate is not smaller than a preset value, the two assemblies are in a strong correlation relationship, and if the two crossing rates are both smaller than the preset value, and if the two crossing rates are 75%, the two assemblies are in a non-strong correlation relationship.
Further, the method for traversing all components in the component list in step S202 to find the component having the most strong correlation with other components includes the following steps:
s20201, representing the relation between any two components obtained in S201 by using an undirected graph, wherein each vertex in the undirected graph represents one component, and if any two components are in a strong correlation relation, an edge is added between the two corresponding vertices;
s20202, traversing the undirected graph, and finding out a vertex with the most edges, wherein the component corresponding to the vertex is the component with the most strong correlation relationship with other components.
Example 4
This embodiment is a specific implementation of embodiment 3, and as shown in fig. 2, a method for calculating a cross relationship may calculate whether there is a cross between two components and an area S of a cross region through the upper left-corner coordinates (x1, y1), (x2, y2) of the two components and the respective lengths (w1, h1), (w2, h2) of the components.
The area of the intersection region S = (x 1+ w1-x 2) × (y 2-y1+ h 1).
As shown in FIG. 3, each vertex in the undirected graph represents a component, and any two components, if strongly related, add an edge between the two vertices. There is at most one edge between two vertices, and each vertex has at most an edge with all other vertices remaining.
And traversing the undirected graph, finding out the vertex with the most edges in the current traversal round, such as a graph, namely a component B, and all vertex sets with edges to the vertex, such as a graph, namely a component C, E, H, grouping the vertex components into a component set, namely (B, C, E, H), and recording the component set into a new list.
And after the current round of traversal is finished, deleting the component set selected in the current round in the undirected graph to form a sub-undirected graph, performing the most polygonal vertex calculation again, removing the vertex set, and performing circular traversal until no vertex exists in the sub-undirected graph. The new component set formed after traversal is as follows: (B, C, E, H), (D, F), (A), (G). Each item of the new component set may be multiple components or a single component, and if the component is multiple components, the multiple components are organized as one component, and the relative position relationship and size ratio of the components are preserved.
Example 5
In this embodiment, based on embodiment 1, the component set is the minimum graph that can cover all the components in the component set. As shown in fig. 4, a component set is composed of a plurality of components, and the geometric information of the component set can be calculated by traversing all sub-components: the method comprises the steps of firstly taking the minimum value of the upper left corner x coordinates of all components as the value of the upper left corner x coordinates of a component set, then taking the minimum value of the upper left corner y coordinates of all components as the value of the upper left corner y coordinates of the component set, then taking the maximum value of the lower right corner x coordinates of all components, subtracting the value of the upper left corner x coordinates calculated in the first step to obtain the width w of the component set, finally taking the maximum value of the lower right corner y coordinates of all components, subtracting the value of the upper left corner y coordinates calculated in the second step to obtain the height h of the component set. And arranging each component in the component set into the component set according to the position relation and the proportional size.
Example 6
In this embodiment, on the basis of embodiment 1, in the step S3, according to the position relationship of the component set in the PC website, the method for sorting the component set in the component set list by using the component sorting algorithm includes: and sequencing according to the distance between the component set and the visual origin browsed by the user on the PC website interface, wherein the components closer to the origin are ranked more forwards.
Further, the method for sorting according to the distance between the component set and the visual origin browsed by the user on the PC website interface comprises the following steps:
s301, splitting a canvas area of a PC website interface into a plurality of equal-height horizontal bar areas, wherein the width of each area is the width of the canvas;
s302, traversing all the component sets, judging which horizontal bar area the upper frame of the component set is located in the step S301, and performing grouping and sequencing on the components according to the horizontal bar area where the component set is located, wherein the sequence of the component sets close to the upper horizontal bar area is higher than that of the component sets close to the lower horizontal bar area;
and S303, traversing all the component sets in the transverse bar region by taking the vertex on the central axis of the transverse bar region as an origin for the component sets in any transverse bar region, judging the distances from the component sets to the origin, and sequencing according to the sequence of the distances, wherein the sequencing is closer to the front when the distances are smaller.
Further, the method for determining the distance from the component set to the origin in step S303 includes: judging the relation between the assembly set and the middle axis of the horizontal bar area, and if the assembly set is completely positioned on the right side of the middle axis of the horizontal bar area, calculating the distance from the upper left corner of the assembly to the origin; if the set of components spans the medial axis or is located completely to the left of the medial axis, then the distance from the top right corner of the component to the origin is calculated.
Example 7
As shown in FIG. 5, a specific component collection ordering scheme splits a canvas area into multiple horizontal bar areas, each area having a width equal to the width of the canvas and a height equal to a fixed value, such as 100 px.
The upper frame of all component sets must fall within a horizontal bar region. And sequencing the assembly sets of all the upper frames in the same horizontal bar area in sequence. All components in the upper rail region are higher in order than all components in the lower rail region. The order of the A, B component sets is higher than the C, D component sets in the figure.
For a certain horizontal bar area, taking the vertex on the central axis of the horizontal bar area as an origin (w/2, 0), traversing all component assemblies in the horizontal bar area, if the component assemblies are completely positioned on the right side of the central axis of the area, calculating the distance from the upper left corner of the component assemblies to the origin, and if the component assemblies are completely positioned on the left side of the central axis, calculating the distance from the upper right corner of the component assemblies to the origin. And calculating the distances from all the component sets to the origin, and sorting according to the generation sequence of the distances to arrange the arrangement sequence of the component sets. The order of arrangement of the component assembly sets can be calculated as follows: B. a, C, D are provided. The origin essentially represents a visual origin browsed by a user, the component sets which are closer to the origin are ranked, the earlier the user can see the component sets, and the originally arranged visual sequence can be restored as much as possible.
Example 8
In this embodiment, a rule for identifying a relationship between components is further provided, where first, it is determined whether two adjacent components are pictures (or tables) and characters, if so, it is determined whether a keyword, such as a "picture" character, exists in a text of the character component, and if a keyword is identified in the character component, it is determined that the two adjacent components are in a strong correlation relationship.
Example 9
In this embodiment, a component relationship identification method is further provided, which is used to identify various other types of component relationships, and a machine learning technique is adopted, and existing page data is used to mark data such as a coverage relationship, a title relationship, and the like, and the mark data is used as data to train, so as to train a pattern recognition algorithm to identify more types of component relationships.
Example 10
In this embodiment, a mobile adaptive rearrangement apparatus for component arrangement is provided, which includes:
a memory for storing executable instructions;
a processor for executing the executable instructions stored in the memory to implement the mobile adaptive rearrangement method of the component arrangement of embodiments 1-9.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative, and for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, the functional modules in the embodiments of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (7)
1. A mobile adaptive rearrangement method for component arrangement comprises a PC website needing arrangement, and is characterized in that: further comprising the steps of:
s1, acquiring a component list of the PC website;
s2, regrouping the components according to the relation between the PC website components to obtain a component set and a component set list;
s3, sorting the component set in the component set list by using a component sorting algorithm according to the position relation of the component set in the PC website;
s4, rearranging according to the assembly set sequence determined in the step S3;
in step S3, according to the position relationship of the component set in the PC website, the method for sorting the component set in the component set list by using the component sorting algorithm includes: sequencing according to the distance between the component set and a visual origin browsed by a user on a PC (personal computer) website interface, wherein the component closer to the origin is ranked the earlier;
the method for sequencing according to the distance between the component set and the visual origin browsed by the user on the PC website interface comprises the following steps:
s301, splitting a canvas area of a PC website interface into a plurality of equal-height horizontal bar areas, wherein the width of each area is the width of the canvas;
s302, traversing all the component sets, judging which horizontal bar area the upper frame of the component set is located in the step S301, and performing grouping and sequencing on the components according to the horizontal bar area where the component set is located, wherein the sequence of the component sets close to the upper horizontal bar area is higher than that of the component sets close to the lower horizontal bar area;
s303, traversing all component assemblies in any transverse strip region by taking a vertex on a central axis of the transverse strip region as an origin point for the component assemblies in any transverse strip region, judging the distances from the component assemblies to the origin point, and sequencing according to the sequence of the distances, wherein the sequencing is closer to the front when the distances are smaller;
the method for determining the distance from the component set to the origin in step S303 is as follows: judging the relation between the assembly set and the middle axis of the horizontal bar area, and if the assembly set is completely positioned on the right side of the middle axis of the horizontal bar area, calculating the distance from the upper left corner of the assembly to the origin; if the set of components spans the medial axis or is located completely to the left of the medial axis, then the distance from the top right corner of the component to the origin is calculated.
2. The method of moving adaptive rearrangement of component arrangement according to claim 1, wherein: the method for regrouping the components according to the relationship among the PC website components in step S2 includes the following steps:
s201, traversing all the components according to the component list, carrying out cross relation calculation on any two components, and dividing the relation between any two components into a strong correlation relation and a non-strong correlation relation;
s202, traversing all the components in the component list, finding out the component with the most strong correlation with other components, forming the component and other components with the strong correlation with the component into a component set, recording the component set in the component set list, and moving the components in the component set out of the component list;
s203, looping step S202 until the number of the components in the component list is 0, and obtaining a final component set and a component set list.
3. The method of moving adaptive rearrangement of component arrangement according to claim 2, wherein: the method for calculating the cross relationship between any two components in step S201 includes the following steps:
s20101, determining the coordinates of the same vertex of the two assemblies and the length and the width of each assembly;
s20102, calculating whether the two assemblies are crossed or not and calculating the area of a crossed area according to the coordinates of the same vertex of the two assemblies and the length and the width of each assembly.
4. The method of claim 3, wherein: the method for dividing the relationship between any two components into the strong correlation relationship and the non-strong correlation relationship in step S201 includes the following steps:
s20103, judging whether the two components are intersected or not, if not, determining that the two components are in a non-strong correlation relationship, and if so, entering the step S20104;
s20104, dividing the area of the cross region by the areas of the two assemblies respectively to obtain two cross rates;
s20105, comparing the two crossing rates with a preset ratio respectively, if at least one crossing rate is not smaller than a preset value, the two assemblies are in a strong correlation relationship, and if the two crossing rates are smaller than the preset value, the two assemblies are in a non-strong correlation relationship.
5. The method of moving adaptive rearrangement of component arrangement according to claim 2, wherein: the method for traversing all the components in the component list in step S202 to find the component having the most strong correlation with other components includes the following steps:
s20201, representing the relation between any two components obtained in S201 by using an undirected graph, wherein each vertex in the undirected graph represents one component, and if any two components are in a strong correlation relation, an edge is added between the two corresponding vertices;
s20202, traversing the undirected graph, and finding out a vertex with the most edges, wherein the component corresponding to the vertex is the component with the most strong correlation with other components.
6. The method of moving adaptive rearrangement of component arrangement according to claim 1, wherein: the set of components is the smallest graphic that can cover all the components in the set of components.
7. A mobile adaptive rearrangement apparatus for component arrangement, comprising:
a memory for storing executable instructions;
a processor for executing the executable instructions stored in the memory to implement the mobile adaptive shuffling method of component arrangement of claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910947490.9A CN110457030B (en) | 2019-10-08 | 2019-10-08 | Mobile adaptive rearrangement method and device for component arrangement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910947490.9A CN110457030B (en) | 2019-10-08 | 2019-10-08 | Mobile adaptive rearrangement method and device for component arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110457030A CN110457030A (en) | 2019-11-15 |
| CN110457030B true CN110457030B (en) | 2020-02-07 |
Family
ID=68492688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910947490.9A Active CN110457030B (en) | 2019-10-08 | 2019-10-08 | Mobile adaptive rearrangement method and device for component arrangement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110457030B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110780794B (en) * | 2020-01-02 | 2020-04-24 | 成都四方伟业软件股份有限公司 | Visual data list display method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102156716B (en) * | 2010-12-02 | 2013-01-02 | 广州市动景计算机科技有限公司 | Method and device for re-typesetting web page |
| IL314805A (en) * | 2013-09-12 | 2024-10-01 | Wix Com Ltd | System and method for automated conversion of interactive sites and applications to support mobile and other display environments |
| CN103914555B (en) * | 2014-04-14 | 2017-10-27 | 百度在线网络技术（北京）有限公司 | The method and apparatus that webpage is laid out again |
-
2019
- 2019-10-08 CN CN201910947490.9A patent/CN110457030B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110457030A (en) | 2019-11-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102193786B (en) | Device and method for constructing self-adaptive graphic user interface (GUI) | |
| Musialski et al. | Interactive coherence‐based façade modeling | |
| KR20200037887A (en) | Method and apparatus for generating synthetic picture | |
| US20150169502A1 (en) | Touch-based reorganization of page element | |
| JP6612487B1 (en) | Learning device, classification device, learning method, classification method, learning program, and classification program | |
| CN103098001B (en) | A kind of disposal route of user interface and electronic equipment | |
| CN111263187B (en) | Video clipping method and device, computer equipment and computer-readable storage medium | |
| CN107395594A (en) | A kind of automatic identifying method for pulling identifying code | |
| CN111857704A (en) | Code generation method and device for layout relationship | |
| CN110457030B (en) | Mobile adaptive rearrangement method and device for component arrangement | |
| CN103473282A (en) | Device and method for generating hot content page | |
| CN105912668A (en) | Method and equipment for label management | |
| CN109859291A (en) | Intelligent LOGO design method, system and storage medium | |
| CN104808891A (en) | Page information processing method and device | |
| CN111538455B (en) | Page switching method and device | |
| CN102446362B (en) | Two-dimensional object packing | |
| CN112507268A (en) | Method, device and equipment for configuring hot zone of webpage picture and readable storage medium | |
| CN110321405B (en) | Model matching method, model matching device, computer-readable storage medium and computer equipment | |
| CN106998489A (en) | A kind of focus is crossed the border searching method and device | |
| CN111539390A (en) | Small target image identification method, equipment and system based on Yolov3 | |
| CN116521782A (en) | Data asset map acquisition method, device, equipment, medium and product | |
| CN111158647A (en) | Creative material self-adaptive generation method and device based on structural theory | |
| CN113792237A (en) | Card type layout optimization method and device, storage medium and processor | |
| CN107248187B (en) | Method for quickly cutting and recombining three-dimensional model textures | |
| CN111524157B (en) | Touch screen object analysis method and system based on camera array and storage 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |