CN110415360B

CN110415360B - Graphic processing method and system for ground area in home decoration design

Info

Publication number: CN110415360B
Application number: CN201910572871.3A
Authority: CN
Inventors: 陈旋; 周海; 王洪建
Original assignee: Jiangsu Aijia Household Products Co Ltd
Current assignee: Jiangsu Aijia Household Products Co Ltd
Priority date: 2019-06-28
Filing date: 2019-06-28
Publication date: 2022-07-08
Anticipated expiration: 2039-06-28
Also published as: CN110415360A

Abstract

The invention discloses a method suitable for rapid triangulation of an indoor ground area in a home decoration design process. The method can enable a user to quickly triangulate the ground area in the home decoration design process, avoid the use of a heavy and complicated subdivision process, and provide preparation for accelerating the construction process of the home decoration design visual chartlet.

Description

Graphic processing method and system for ground area in home decoration design

Technical Field

The invention relates to a graphic processing method and a graphic processing system for a ground area in home decoration design, and belongs to the technical field of computer aided design.

Background

Triangulation is a classical technology in graphics, but complex triangulation is not needed in the home decoration process, and mainly because the ground areas of home decoration design are regular polygons and no malformed areas exist, particularly complex triangulation (complex point insertion, newly-built triangles, triangle screening and other complex processes) is not needed when efficiency is taught.

Therefore, it is desirable to provide a simple method for triangulating the ground.

Disclosure of Invention

When the home decoration design process is visual, materials are generally required to be added to the ground, the objects of the attached materials are generally triangular meshes, the home decoration design ground area specific easy-to-use triangularization method is mainly provided, and the method is convenient and practical.

A graphic processing method for a ground area in home decoration design comprises the following steps:

s1, obtaining boundary points of the ground in the floor plan, numbering the boundary points in sequence according to the set sequence direction, and forming a boundary point set;

s2, traversing the boundary points in the boundary point set, and deleting the boundary points except the head end and the tail end of the boundary points which are positioned at adjacent positions and on the same straight line to obtain the boundary point set after deleting the points;

s3, sequentially connecting the boundary point sets after the points are deleted into line segments according to the serial number sequence of the boundary point sets;

s4, selecting any point in the boundary point set after the deletion point, and respectively calculating three vectors according to a set sequence direction: z1, vector of current point and next point; z2, vector of the next point to the current point and the next point; z3, a vector of a previous point of the current point and the current point;

s5, calculating an outer product V1 of vectors Z1 and Z2, and calculating an outer product V2 of vectors Z3 and Z1; calculating the inner product of V1 and V2; when the inner product is positive, judging that a region formed by the previous point of the current point, the next point of the current point and the next point of the current point is a convex region;

s6, calculating the moduli of the vectors Z2 and Z3 respectively, taking the smaller vector as a short side, and making a parallel line parallel to the vector Z1 from the end point of the short side until the short side intersects with the line segment to obtain an intersection point;

s7, traversing the points in the boundary point set after the deletion point in sequence, executing the steps S4-S6, and making intersection points of parallel lines for the convex area;

and S8, making any diagonal line on the quadrangle in the obtained house type graph, and obtaining the ground area of the house type graph after triangulation processing.

In one embodiment, the set sequential direction in step S1 refers to a clockwise or counterclockwise direction.

In one embodiment, the step of determining the boundary points at adjacent positions and on the same straight line in step S2 is: calculate Δ value = abs ((X)_B-X_A)*(Y_C-Y_B)-(X_C-X_B)*(Y_B-Y_A) Whether or not less than a set threshold; a, B, C respectively refers to the previous point of the current point, the current point and the next point of the current point; x and Y are the horizontal and vertical coordinate values.

In one embodiment, in step S6, if the moduli of Z2 and Z3 are equal, any one of the two is taken as the short edge.

In one embodiment, after the intersection point is obtained, the longer one of the vectors Z2, Z3 is extended toward the inside of the floor plan until intersecting the line segment in step S6.

A graphical processing system for a floor area in a home decoration design, comprising:

the boundary point set generating module is used for acquiring boundary points of the ground in the house type graph and numbering the boundary points in sequence according to a set sequence direction to form a boundary point set;

the generation module of the boundary point set after the point deletion is used for traversing the boundary points in the boundary point set, deleting the boundary points except the head end and the tail end of the boundary points which are positioned at the adjacent positions and on the same straight line, and obtaining the boundary point set after the point deletion;

the line segment generation module is used for sequentially connecting the boundary point sets after the deletion points into line segments according to the serial number sequence of the boundary point sets;

the short edge processing module is used for traversing the points in the boundary point set after the deletion of the points and executing the following steps: three vectors are respectively calculated according to a set sequence direction: z1, vector of current point and next point; z2, vector of the next point to the current point and the next point; z3, a vector of a previous point of the current point and the current point; calculating the outer product V1 of vectors Z1 and Z2, and calculating the outer product V2 of vectors Z3 and Z1; calculating the inner product of V1 and V2; when the inner product is positive, judging that a region formed by the previous point of the current point, the next point of the current point and the next point of the current point is a convex region; respectively calculating the modes of the vectors Z2 and Z3, taking the smaller vector as a short side, and making a parallel line parallel to the vector Z1 from the end point of the short side until the short side intersects with the line segment to obtain an intersection point;

and the three-solution cutting module is used for making any diagonal line for the quadrangle in the floor area of the house type map obtained by the short edge processing module.

In one embodiment, the set sequential direction in the bounding point set generation module refers to a clockwise or counterclockwise direction.

In one embodiment, the step of determining boundary points which are at adjacent positions and on the same straight line in the generation module of the boundary point set after the deletion point is as follows: calculate Δ value = abs ((X)_B-X_A)*(Y_C-Y_B)-(X_C-X_B)*(Y_B-Y_A) Whether or not less than a set threshold; a, B, C respectively refer to the previous point, the current point and the current point of the current pointA next point; x and Y are the horizontal and vertical coordinate values.

In one embodiment, in the short edge processing module, if the moduli of Z2 and Z3 are equal, one of the two is taken as the short edge.

In one embodiment, after the intersection point is obtained, the longer of the vectors Z2, Z3 is extended toward the inside of the floor plan until the intersection point intersects the line segment.

A computer readable medium is described with a program that can run a graphical processing method for a floor area in a home decoration design.

Advantageous effects

The method can enable a user to quickly triangulate the ground area in the home decoration design process, avoid the use of a heavy and complicated subdivision process, and provide preparation for accelerating the construction process of the home decoration design visual chartlet.

Drawings

FIG. 1 is a schematic diagram of boundary points in a floor plan;

FIG. 2 is a schematic diagram of the boundary points after the sequential connection;

FIG. 3 is a schematic diagram of an ordered set of boundary points;

FIG. 4 is a schematic illustration of a salient region determination process;

FIG. 5 is a schematic view of a salient region determination process;

FIG. 6 is a schematic view after being triangularly cut;

fig. 7 is a sectional illustration in another complex case. Fig. 8 is a flow chart of the present invention.

Detailed Description

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments will be briefly introduced below. It is obvious that the drawings in the following description are only examples or embodiments of the application, from which the application can also be applied to other similar scenarios without inventive effort for a person skilled in the art. It should be understood that these exemplary embodiments are given only for the purpose of enabling those skilled in the relevant art to better understand and to implement the present invention, and are not intended to limit the scope of the present invention in any way.

As used in this application and the appended claims, the terms "a," "an," "the," and/or "the" are not intended to be inclusive in the singular, but rather are intended to be inclusive in the plural unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" merely indicate that steps and elements are included which are explicitly identified, that the steps and elements do not form an exclusive list, and that a method or apparatus may include other steps or elements.

Although various references are made herein to certain systems, modules, or elements of a system according to embodiments of the present application, any number of different modules may be used and run on a client and/or server. The modules are merely illustrative and different aspects of the systems and methods may use different modules.

Also, this application uses specific language to describe embodiments of the application. Reference throughout this specification to "one embodiment," "an embodiment," and/or "some embodiments" means that a particular feature, structure, or characteristic described in connection with at least one embodiment of the present application is included in at least one embodiment of the present application. Therefore, it is emphasized and should be appreciated that two or more references to "an embodiment" or "one embodiment" or "an alternative embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, some features, structures, or characteristics of one or more embodiments of the present application may be combined as appropriate.

The house type graph processing method aims to triangulate a ground area, only involves vector calculation, does not need to call a 3D engine, and has the advantage of simple calculation.

The method of the present invention is described in detail below with reference to the accompanying drawings.

A method for quickly triangularizing an indoor ground area in a home decoration design process comprises the following specific steps:

as shown in fig. 1, first, in 3D-based house type data, a plan view of the ground is obtained, all boundary points can be read out in the plan view, and a boundary ordered point set of all regions of the whole house type method is obtained, such as a boundary point set of one region in the house type shown in fig. 1, and the points are numbered sequentially according to a rotation order (clockwise or counterclockwise) on the plane, which is exemplified by counterclockwise in the figure.

As shown in fig. 2, these point sets are connected by vectors to form directed line segments, and the point sets are connected in sequence to form a closed area, which is a house-type floor area to be cut.

Next, the point sets and the line segments formed by them need to be preprocessed to remove collinear line segments, and the purpose of this step is to lay down the following step of identifying long and short sides. As shown in fig. 3, the line segments formed by the EF, FG and GH are actually on the same straight line, and therefore, they need to be classified into the same line segment.

The pretreatment method comprises the following steps:

step1, acquiring a region boundary point set, and unifying the sequence of the correction point set to be anticlockwise or clockwise; (hereinafter, counterclockwise is taken as an example) step2. traversing each point in the region, and constructing vectors of the point and the previous point and the next point;

we take point F as an example:

point F and previous point E form a vector

And F forms a vector with the following point G

;

And judging whether the front and back vectors attached to the point are collinear or not, namely calculating:

and with

The proximity of (a).

Setting up

;

If so, indicating that the three points of the points E, F and G are close to the same line, and then the point F can be eliminated;

step3, judging other point sets one by analogy, removing the points F and G in the figure 3, and constructing an updated polygon by the remaining sequential point sets;

through the above steps, as shown in fig. 4, two points F and G are removed, and E, F, G, H is simplified to an EH line segment.

Next, it is necessary to determine the convex portion in the image, taking the region constituted by four sides of JABC in fig. 4 as an example.

Judging three adjacent sides protruding from the polygon, wherein the specific judging method comprises the following flows:

the point set after the above-mentioned merging process is traversed sequentially, for example, taking point a in fig. 4 as an example, the next point (i.e., the counterclockwise direction) is B, the next point (i.e., the next point of the next point along the counterclockwise direction) is C, and the previous point (i.e., the clockwise direction) is J. Then the following three sets of vectors are calculated, respectively: AB. JA, BC. That is, a vector between the current point and its next point, a vector between the next point of the current point and the next-to-current-point, and a vector between the previous point of the current point and the current point are calculated.

Next, an outer product V1 of the vector JA and the vector AB is calculated, and an outer product V2 of the vector AB and the vector BC is calculated;

the inner product of V1 and V2 is calculated again, and the following judgment is made:

if the inner product is positive, the area formed by AB, JA and BC is considered to be convex outwards; and traversing other points in sequence to find all the convex areas in the image. For example, the CDEH, EHIJ regions in fig. 4. The projections are defined for subsequent segmentation of the floor plan.

The next step is to distinguish the length of two side edges of the protruding area, and the division of the length is the premise of the subsequent subdivision. As shown in fig. 4, in the JABC region, it is composed of three edge line segments, AB, JA, BC, AJ and BC are on both sides, and it can be seen that the length of AJ is shorter than that of BC, so that AJ is classified into a set of short edges MinEdge, and similarly, for the CDEH convex part, the short edge is CD, and for the EHIJ convex part, the short edge is IJ, the short edge is also classified into a set MinEdge; after the short side is determined, a parallel line parallel to the middle line segment of the three line segments is made from the end point of the short side until the long side is intersected to obtain an extension line, and in the figure 4, a parallel line parallel to the middle line segment AB is made through the end point J of the short side to be intersected with BC to obtain an extension line AddSeg 1; similarly, the CD segment is the short side of CDEH, and the DE parallel line from the C point intersects with EH to obtain an extension line AddSeg 2; again, similarly, extension line AddSeg3 is obtained.

At this time, as can be seen from the figure, all the closed regions in the figure are already quadrangles, and then any diagonal line is made to the quadrangles, i.e. the construction of the triangular section is realized, as shown in fig. 6.

In some other cases, if both sides of the extended region are of the same length, then one of the sides can be arbitrarily determined to be the short side, and any parallel line with the short side making a middle line segment to the long side can be cut, as shown in FIG. 5.

If for a more complex house type, as shown in fig. 7, the existing convex areas are MABC, CEFJ, GHIJ, JKLM, and the above method is still used, and a parallel line is drawn from the end point of the short side to the long side (indicated by the two-dot chain line in fig. 7), it can be seen that the area surrounded by the 4 two-dot chain lines is an irregular area, and cannot be divided by the quadrangle diagonal line, therefore, for a complex house type, the irregular area needs to be divided by further extending the long side on the premise of determining the short side; in fig. 7, BC is the long side for the MABC region, and therefore, the long side BC needs to be extended until a point (dotted line in fig. 7) intersecting the straight line is encountered, i.e., a parallel line at point G; similarly, for the GHIJ region, the long edge IJ is used as an extension line until the GHIJ region meets the intersection (the dotted line in fig. 7) with the straight line, and then the middle irregular region is divided into quadrangles, and the quadrangles are further diagonal to realize the triangle cutting processing. In this step, firstly, parallel lines are taken as a basis based on the short sides, and in fig. 7, if BC is firstly extended and then GH short sides are taken as HI parallel lines, the parallel lines intersect with the extended lines, so that more quadrangles are caused, the data volume in image processing is increased, and the operation efficiency is reduced.

Based on the above method, the invention also provides a graphic processing system of a ground area in home decoration design, which comprises:

the boundary point set generating module is used for acquiring boundary points of the ground in the floor plan and numbering the boundary points in sequence according to a set sequence direction to form a boundary point set;

the line segment generation module is used for sequentially connecting the boundary point sets after the points are deleted into line segments according to the serial number sequence of the boundary point sets;

the short edge processing module is used for traversing the points in the boundary point set after the deletion of the points and executing the following steps: three vectors are respectively calculated according to a set sequence direction: z1, vector of current point and next point; z2, vector of the next point to the current point and the next point; z3, a vector of a previous point of the current point and the current point; calculating the outer product V1 of the vectors Z1 and Z2, and calculating the outer product V2 of the vectors Z3 and Z1; calculating the inner product of V1 and V2; when the inner product is positive, judging that a region formed by the previous point of the current point, the next point of the current point and the next point of the current point is a convex region; respectively calculating the modes of the vectors Z2 and Z3, taking the smaller vector as a short side, and making a parallel line parallel to the vector Z1 from the end point of the short side until the short side intersects with the line segment to obtain an intersection point;

In one embodiment, the step of determining boundary points which are located at adjacent positions and on the same straight line in the generation module of the boundary point set after the deletion of the point is as follows: calculate Δ value = abs ((X)_B-X_A)*(Y_C-Y_B)-(X_C-X_B)*(Y_B-Y_A) Whether or not less than a set threshold; a, B, C respectively refers to the previous point of the current point, the current point and the next point of the current point; x and Y are the horizontal and vertical coordinate values.

Moreover, those skilled in the art will appreciate that aspects of the present application may be illustrated and described in terms of several patentable species or situations, including any new and useful combination of processes, machines, manufacture, or materials, or any new and useful improvement thereon. Accordingly, various aspects of the present application may be embodied entirely in hardware, entirely in software (including firmware, resident software, micro-code, etc.) or in a combination of hardware and software. The above hardware or software may be referred to as "data block," module, "" engine, "" unit, "" component, "or" system. Furthermore, aspects of the present application may be represented as a computer product, including computer readable program code, embodied in one or more computer readable media.

A computer readable signal medium may comprise a propagated data signal with computer program code embodied therein, for example, on a baseband or as part of a carrier wave. The propagated signal may take any of a variety of forms, including electromagnetic, optical, and the like, or any suitable combination. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code on a computer readable signal medium may be propagated over any suitable medium, including radio, electrical cable, fiber optic cable, radio frequency signals, or the like, or any combination of the preceding.

Computer program code required for the operation of various portions of the present application may be written in any one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C + +, C #, VB.NET, Python, and the like, a conventional programming language such as C, Visual Basic, Fortran 2003, Perl, COBOL 2002, PHP, ABAP, a dynamic programming language such as Python, Ruby, and Groovy, or other programming languages, and the like. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any network format, such as a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet), or in a cloud computing environment, or as a service, such as a software as a service (SaaS).

Additionally, unless explicitly recited in the claims, the order of processing elements and sequences, use of numbers and letters, or use of other designations in this application is not intended to limit the order of the processes and methods in this application. While various presently contemplated embodiments of the invention have been discussed in the foregoing disclosure by way of example, it is to be understood that such detail is solely for that purpose and that the appended claims are not limited to the disclosed embodiments, but, on the contrary, are intended to cover all modifications and equivalent arrangements that are within the spirit and scope of the embodiments herein. For example, although the system components described above may be implemented by hardware devices, they may also be implemented by software-only solutions, such as installing the described system on an existing server or mobile device.

Claims

1. A graphic processing method for a ground area in home decoration design is characterized by comprising the following steps:

s1, acquiring boundary points of the ground in the house-type figure, and numbering the boundary points in sequence according to the set sequence direction to form a boundary point set;

s2, traversing the boundary points in the boundary point set, deleting the boundary points except the head and tail ends of the boundary points which are at adjacent positions and are on the same straight line, and obtaining the boundary point set after deleting the points;

s4, selecting any point in the boundary point set after the deletion point, and respectively calculating three vectors according to the set sequence direction: z1, vector of current point and next point; z2, vector of the next point to the current point and the next point; z3, a vector of a previous point of the current point and the current point;

2. The method for processing graphics of a floor area in a home decoration design of claim 1, wherein the sequence direction set in step S1 is clockwise or counterclockwise.

3. The method for processing the figure of the ground area in the home decoration design as claimed in claim 1, wherein the step of determining the boundary points at the adjacent positions and on the same straight line in step S2 is: calculate Δ value = abs ((X)_B-X_A)*(Y_C-Y_B)-(X_C-X_B)*(Y_B-Y_A) Whether less than a set threshold; a, B, C respectively refers to the previous point of the current point, the current point and the next point of the current point; x and Y are the horizontal and vertical coordinate values.

4. The method as claimed in claim 1, wherein in step S6, if the moduli of Z2 and Z3 are equal, one of the moduli is selected as a short edge.

5. The method of claim 1, wherein in step S6, after the intersection point is obtained, the longer of the vectors Z2 and Z3 is extended toward the inside of the house-type figure until the intersection point intersects with the line segment.

6. A graphical processing system for a floor area in a home decoration design, comprising:

7. The graphical processing system of a floor area in a home decoration design of claim 6, wherein the set sequential direction in the border point set generation module is clockwise or counterclockwise.

8. The system of claim 6, wherein the step of determining the neighboring boundary points on the same straight line in the module for generating the boundary point set after the deletion of the point comprises: calculate Δ value = abs ((X)_B-X_A)*(Y_C-Y_B)-(X_C-X_B)*(Y_B-Y_A) Whether or not less than a set threshold; a, B, C respectively refers to the previous point of the current point, the current point and the next point of the current point; x and Y are the horizontal and vertical coordinate values.

9. The system of claim 6, wherein the short edge processing module is configured to select one of the modules as a short edge if the modules of Z2 and Z3 are equal; in the short edge processing module, after the intersection point is obtained, the longer one of the vectors Z2 and Z3 is taken as an extension line toward the inside of the house-type figure until the intersection point intersects with the line segment.

10. A computer-readable medium recording a program that can execute the method for graphic processing of a ground area in a home decoration design according to claim 1.