CN110781541A

CN110781541A - Region merging method and system for home decoration design drawing

Info

Publication number: CN110781541A
Application number: CN201910949760.XA
Authority: CN
Inventors: 陈旋; 周海; 王洪建
Original assignee: Jiangsu Ai Jia Household Articles Co Ltd
Current assignee: Jiangsu Ai Jia Household Articles Co Ltd
Priority date: 2019-10-08
Filing date: 2019-10-08
Publication date: 2020-02-11
Anticipated expiration: 2039-10-08
Also published as: CN110781541B

Abstract

The invention discloses a region merging method and a region merging system for a home decoration design drawing, and belongs to the technical field of computer aided design. The invention can effectively merge the living room and the restaurant areas drawn by the designer in the home decoration design process, avoids the problems that the polygons are not closed, the polygons are not single merged areas or the lines of the polygons are disordered when the guests and the restaurants are merged due to precision errors, and can conveniently support the related services of the guests and the restaurants. Of course, the technology is not limited to the area of the customer restaurant and can be expanded to any two adjacent polygons.

Description

Region merging method and system for home decoration design drawing

Technical Field

The invention discloses a region merging method and a region merging system for a home decoration design drawing, and belongs to the technical field of computer aided design.

Background

In the home decoration design process, each space area is closely related to the service, and for an independent space area (namely, no intersection point exists between the independent space area and other areas), the space and the corresponding service are relatively easy to incline, but for a guest restaurant, the guest restaurant is usually connected together, and a designer usually manually draws a living room intersection line and a restaurant intersection line for consideration in a service layer; however, in the steps of the display process of home software, the automatic generation process of the soft ware, and the like, the restaurant and the living room are often considered as a whole, mainly because the two functional areas are relatively close, no obvious wall separation exists, and the decoration style needs to be similar. Therefore, in the home design software, it is necessary to combine these two functional areas and then perform the overall design, effect display, consumable calculation, and the like.

However, due to the reason of manual hand drawing, errors are often caused, and software cannot well recognize the hand drawing effect of a home decoration designer; in addition, in different house types, the relationships of shapes, positions and the like of the dining room and the living room are greatly different, which causes difficulty when the living room and the dining room are combined into a whole space area.

Disclosure of Invention

The purpose of the invention is: the existing home decoration software cannot effectively identify the graphic position relationship between a restaurant and a living room in a house type graph drawn by a designer, so that the spatial combination between the restaurant and the living room cannot be effectively realized.

The invention provides a region merging method of a restaurant and a living room in a house type graph based on hand drawing of a designer.

The technical scheme is as follows:

a region processing method of a home decoration design drawing comprises the following steps:

step a, polygonal area data of a restaurant and a living room in a user-type diagram obtained through hand drawing are obtained, wherein the area data comprise a room outline line segment and end points on the line segment;

step b, traversing each point on the polygon of the restaurant, and executing the following operations: calculating the distance from each point to each edge of the polygon in the living room, obtaining the shortest distance between each point and the line segment of the polygon in the living room, and classifying the point into a point set to be selected when the shortest distance is smaller than a set first threshold;

step c, traversing each point on the polygon of the living room, and executing the following operations: calculating the distance from each point to each edge of the restaurant polygon, and obtaining the shortest distance between each point and the line segment of the restaurant polygon, wherein the following conditions are met: (1) when the shortest distance is smaller than a set first threshold value, (2) the distance between each point and all the points in the to-be-selected point set obtained in the step b is larger than a second threshold value; the point is classified into a point set to be selected;

step d, calculating the number of points in the to-be-selected point set obtained in the step c, if the number of the points is 2, entering the step e, and if the number of the points is 3, entering the step f;

e, deleting two line segments which are mutually attached and parallel to the dining room and the living room, and sequentially connecting the remaining points of the polygons of the dining room and the living room according to a clockwise or anticlockwise sequence to merge the polygons of the dining room and the customers;

and f, deleting two line segments which are attached to each other and are parallel to the dining room and the living room, deleting points which are attached to each other in the point set to be selected, and sequentially connecting the remaining points of the polygons of the dining room and the living room according to the order of clockwise time or anticlockwise time so as to merge the polygons of the dining room and the customers.

In one embodiment, the first threshold is 5 cm; the second threshold is 3.5-4 cm.

In one embodiment, in the step e, in the determination of bonding and parallelism, bonding means that the distance between the substrates is less than 5cm, and the parallelism means that the angle between the straight lines is 0 to 2 °.

In one embodiment, step f, the close contact is that the distance between the point and the point is less than 5 cm.

A system for area processing of a home decoration plan, comprising:

the system comprises a region data region module, a region data region module and a region data processing module, wherein the region data region module is used for acquiring polygonal region data of a restaurant and a living room in a user-type diagram obtained through hand drawing, and the region data comprises a room outline line segment and end points on the line segment;

the restaurant intersection point acquisition module is used for traversing each point on the restaurant polygon and executing the following operations: calculating the distance from each point to each edge of the polygon in the living room, obtaining the shortest distance between each point and the line segment of the polygon in the living room, and classifying the point into a point set to be selected when the shortest distance is smaller than a set first threshold;

the living room intersection point acquisition module traverses each point on the polygon of the living room and executes the following operations: calculating the distance from each point to each edge of the restaurant polygon, and obtaining the shortest distance between each point and the line segment of the restaurant polygon, wherein the following conditions are met: (1) when the shortest distance is smaller than a set first threshold value, (2) the distance between each point and all the points in the to-be-selected point set obtained in the step b is larger than a second threshold value; the point is classified into a point set to be selected;

the classification module is used for calculating the number of points in the point set to be selected, and if the number of the points is 2, the points are processed through the first merging module; if the number is 3, processing by a second merging module;

the first merging module is used for deleting two line segments which are mutually attached and parallel to the restaurant and the customer, and sequentially connecting the remaining points of the polygons of the restaurant and the living room according to the order of clockwise time or anticlockwise time so as to merge the polygons of the restaurant and the customer;

and the second merging module is used for deleting two line segments which are mutually attached and parallel to the restaurant and the client, deleting mutually attached points in the point set to be selected, and sequentially connecting the remaining points of the polygons of the restaurant and the living room according to the order of time or anticlockwise so as to merge the polygons of the restaurant and the client.

In one embodiment, in the first combining module, in the determination of the mutual adhesion and parallelism, the adhesion means that the mutual distance is less than 5cm, and the mutual parallelism means that the included angle of straight lines between the mutual adhesion and the parallelism is 0 to 2 °.

In one embodiment, the second merging module is attached to each other in such a way that the distance between the point and the point is less than 5 cm.

A computer-readable medium having a program for executing the area processing method for the home decoration design drawing described above.

Advantageous effects

The invention can effectively merge the living room and the restaurant areas drawn by the designer in the home decoration design process, avoids the problems that the polygons are not closed, the polygons are not single merged areas or the lines of the polygons are disordered when the guests and the restaurants are merged due to precision errors, and can conveniently support the related services of the guests and the restaurants. Of course, the technology is not limited to the area of the customer restaurant and can be expanded to any two adjacent polygons.

Drawings

FIG. 1 is a set of ordered points (counterclockwise or clockwise) of the boundary of a certain area in a house type

FIG. 2 is a restaurant section display view (solid line part)

FIG. 3 is a drawing showing a living room region (thick solid line portion)

FIG. 4 is a schematic view of a consolidated customer restaurant area

FIG. 5 shows the case where the number of points at which the two regions intersect is 2

FIG. 6 shows the case where the number of points at which the two regions intersect is 3

FIG. 7 is a schematic diagram of a two-region Case corresponding to Case1

FIG. 8 is a schematic diagram of a two-region Case corresponding to Case2

FIG. 9 is a schematic diagram of a two-region Case corresponding to Case3

FIG. 10Case4 corresponding two regions

FIG. 11Case of two regions corresponding to Case5

FIG. 12 schematic representation of the case of three intersections

FIG. 13Case of two regions corresponding to Case6

FIG. 14Case of two regions corresponding to Case7

FIG. 15 shows the Case of two regions corresponding to Case8

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 technical problem to be solved by the invention is as follows: in the house type diagram directly drawn by the designer, hand-drawing errors exist in the boundary between the adjacent dining rooms and the living room, so that when software needs to combine the two areas, the boundary conditions of the dining rooms and the living room under different house type conditions are not easy to identify, and the degeneracy processing of the dining rooms and the areas cannot be accurately performed.

In the method, firstly, ordered point sets of room shapes of a restaurant and a living room need to be obtained respectively, as shown in fig. 1, a boundary ordered point set of all regions of a whole house type needs to be obtained based on 2D house type data, as shown in fig. 1, a boundary point set of one region in the house type needs to be obtained; firstly, a floor plan is obtained based on 3D house type data (in the invention, at least two functional areas, namely a living room and a restaurant, need to be identified and are respectively treated as one area, or other adjacent functional areas can be selected to be correspondingly combined), for one area, all boundary points can be read out from the floor plan, a boundary ordered point set of all areas of the whole house type method is obtained, such as the boundary point set of one area in the house type shown in fig. 1, the points are numbered in sequence according to the rotation sequence (clockwise or counterclockwise) on the plane, and the counterclockwise is taken as an example in the figure. Through this step, an ordered set of point maps of the functional areas of the restaurant and the living room, respectively, are obtained.

In a typical layout, the restaurant and living room are shown in fig. 2 and 3, and their ideal combined effect is shown in fig. 4.

Through the above steps, region data of a restaurant and a living room in a user-type diagram manually drawn by a designer, namely a plurality of polygons, can be acquired, and the acquired data comprises a room region represented by a line segment, end points at two ends of the line segment and points possibly existing in the line segment;

suppose we name the restaurant polygon as PolygonA and the living room polygon as PolygonB (e.g., as shown in FIG. 5);

next, the perimeters of the polygana and the polyganb are calculated, respectively, with the shorter perimeter being the polygana (restaurant in this example) and the longer perimeter being the polyganb (living room in this example), and the polygana is attached to the polygana by the polyganb as much as possible, so that the point sets of the boundaries of the two polygons are unified, and the inconsistency of the boundary points of the two regions due to numerical errors is avoided.

The following steps are performed to find an approximate intersection between the restaurant and the customer:

calculating the distance from each point PointA on the Polygona (restaurant) to each line segment of the PolygonaB (living room), obtaining the distance from the PointA to each line segment, then selecting the shortest one from the distances, naming the shortest one as DisToSegA, and if the distance is smaller than or equal to a threshold value (for example, 5cm, the value can be defined, and is used for indicating that the PointA is very close to one line segment), when the PointA is the intersection point of an alternative restaurant and the living room, putting the PointA at the moment into a temporary intersection point set to be determined, and naming the intersection point set as TempInterSectPs; next, the same operation is performed by sequentially traversing other points on PointA, and points that meet the above distance determination rule are also included in the set TempInterSectPs. In FIG. 5, the polygon IJKL as a restaurant includes two points L and I in the set TempInterSectPs because the two points are very close to the HG line segment.

Next, successively traversing each point from the polygon ABCDEFGH in fig. 5, and calculating the distance between the polygon ABCDEFGH and the line segment on the polygon, the specific process is similar to the above steps, and the purpose of this step is to find the boundary point between the polygon in the living room and the restaurant, so as to prevent the missing of the boundary point. In FIG. 5, no point on the GH segment is close to the restaurant, and therefore, a corresponding set of points is not available; whereas in fig. 6, the point P is located on the PG side of the polygon b (restaurant), if it is determined only from the points on the polygon b (restaurant), only two points of L and I can be found, and the point P is omitted. Therefore, after performing the calculation once more by the point on the polygon, the P point can be identified. The calculation process also calculates the distance from each point PointB on the polygon to each line segment of the polygon, and obtains the minimum distance among the distances, and the distance is named as DisToSegB, if the distance is less than or equal to a threshold (for example, 5cm, the value can be customized to indicate that the PointB is very close to a line segment); next, it is further determined whether there is a case where the selected point in PointB is close enough to the point in the TempInterSectPs (this is mainly the case where some points are very close to each other in the process of hand drawing, and if these points are counted separately, it is often impossible to merge the graphics, and therefore, it is necessary to consider degenerating some points close to each other), for example, in fig. 5, if there is a point L 'that is close enough to point L, and I' that is close enough to point I, those L 'and I' will affect the subsequent generation of a merged segment, therefore, it is necessary to determine whether or not the selected point in PointB is close enough to the point in the set TempInterSectPs, for example, if there is less than a certain threshold (e.g., 3.5-4 cm), if less than the threshold, then the point is discarded; if the value is larger than the threshold value, the point is included in the alternative, other points in the polygon are continuously traversed to obtain the selected point, and the selected point is included in the set TempInterSectPs. After searching for the intersection point and subsequent degeneracy processing, it can be found that the point in TempInterSectPs is I, L in fig. 5, and L, Q, P in fig. 6.

So far, after the distance determination of the bidirectional end point is completed, the candidate points in the set TempInterSectPs are possible boundary points, and the intersection point set TempInterSectPs to be determined in the above process is further filtered, that is, repeated point sets are removed from the intersection point set TempInterSectPs, and the specific method is as follows: acquiring a first point from TempInterSectPs, putting the first point into a new actual intersection set, marking the set as InterSectPs, and removing the point from the TempInterSectPs; traversing the remaining points in the TempInterSectPs, judging whether the point is the same as each point in the InterSectPs, and if not, continuously putting the point into the InterSectPs set; if the points are the same, deleting the points from the TempInterSectPs; repeating the steps in sequence until all the points in the TempInterSectPs are processed, and obtaining the final 'intersection point set' InterSectPs which passes through the removed repetition points; in fig. 5, I, L, these 2 points, are included in the set of unset processed InterSectPs; in fig. 6, the 3 points L, I, P are included in the set of deduplication, InterSectPs.

Then, a point replacement process is required, which aims to merge point sets with positions close to the InterSectPs set in the point sets of the two polygons to be merged, so as to solve the error of points on line segments in the hand-drawn house type diagram. The purpose of this step is to replace the point near the boundary point in the restaurant or living room again after obtaining the above-mentioned InterSectPs point set, and the specific steps are as follows:

traversing each point TempPoint of the InterSectPs, calculating each point in the Polygona (restaurant) and marking as Point A, calculating the distance from the TempPoint to the Point A and marking as DisA, selecting a smaller distance threshold, wherein the threshold is used for judging the proximity degree between the two points, and the suggestion setting is lambda = 0.001; if the distance value between two points in the flow DisA < = lambda, the point on the Polygona (dining room) at the moment is judged to be the same point with the corresponding point in the InterSectPs, and the corresponding point in the Polygona (dining room) is replaced by the corresponding point in the InterSectPs; thus, on the basis of obtaining the InterSectPs intersection point set, simplifying processing is carried out on the points similar to the intersection points in the two polygons.

After the boundary points on the restaurant and the living room are combined, the combination of the restaurant and the living room is needed; in this case, the calculation process needs to be performed according to the above calculation results.

In the first general case, the number of point sets in InterSectPs is 2;

in this case, two values need to be obtained.

The first value is the number of points in a point set in a statistical PolygonA (restaurant) and the same points in an InterSectPs, and is marked as Acount; for example, in the case of fig. 5, if the point set of InterSectPs is I, L and the point set of PolygonA (restaurant) is IJKL, then it can be found that the account at this time is 2, in the case of fig. 6, the point set of InterSectPs is L, I, P and the point set of PolygonA (restaurant) is LIJK, then the same point is L, I, then the account at this time is 2;

the second value is the number of the points in the same point set in the polygonB (living room) and the InterSectPs, and is recorded as Bcount; for example, in fig. 5, the point set of InterSectPs is I and L, the point set of PolygonB (living room) is ABCDEFGH, and the point set is not the same as the point set of InterSectPs, and therefore Bcount is 0. In the case of fig. 6, the point set ABCDEFGHPQH of the polygon, i.e., polygon, is 1, since the point P is the point set belonging to InterSectPs.

Further recording indexes of points in the PolygonB, which are the same as the points in the InterSectPs, recording the indexes of the last point in the point set PSets in the PolygonB as TargetPindex, and recording the indexes of the points corresponding to the points in the InterSectPs as FinalIndex;

the following cases are distinguished:

case 1: if the account =2 and Bcount =0 in the above step (indicating that the a/B point is a count of the account and no significant point set exists in Bcount), constructing an intersecting line Segment using the points of InterSectPs obtained in the above step as Segment,

the two-area case corresponding to this case is shown in fig. 7, in which the designer manually draws the area ABCD as a restaurant and the area EFGHIJKL as a living room. At this time, the set of intersecting segments, Segment, is Segment AB.

All the line segments in PolygonA (i.e., line segments AB, BC, CD, DA) are put into a line segment set and recorded as Asegs;

putting all the line segments (i.e., EF, FG, GH, HI, IJ, JK, KL, LE) in PolygonB into a line segment set, and recording as Bsegs;

and (3) eliminating line segments intersecting with the PolygonA in the PolygonB, wherein the specific method is as follows: calculating the distance SegToSegDis between each line Segment in the PolygonnB (i.e. each line Segment in the Bsegs) and the Segment, if SegToSegDis is less than or equal to 5cm, further determining whether the line Segment is parallel to the Segment, if parallel, recording the Index of the edge to be screened out at the time as RemoveBSegIndex (corresponding to the Index of the edge IJ in FIG. 7 to the edge of the polygon EFGHIJKL), determining the line Segment in the B which needs to be newly added by using the positional relationship between the two end points corresponding to the edge to be deleted and the two end points of the Segment (as shown in FIG. 7, namely the determination point I and the positional relationship between the point J and the points A and B), adding the line Segment AJ and the line Segment IB into the Bsegs, determining the line Segment in the B as AddSeg1, adding the line Segment AJ and the line Segment IB into the Bsegs, if the two end points of the Segment in the segnA and the end points are equal, marking the Segment in the Segment to be deleted as the polygon ABgoAB, and deleting the Segment in the polygon ABgoAB, reconstructing a directed sequence line segment AreordPoints corresponding to the Polygona (namely a line segment AJ newly added after a line segment IJ is removed from the Polygona B and a point sequence AJKLEFGHIB after the line segment IB is removed) and a directed sequence line segment BreordPoints corresponding to the Polygona B (namely a point sequence BCDA after a line segment AB is removed from the Polygona) by using the updated end point value of the line segment; then the point sequence after the two regions are merged is as follows: BCDAJKLEFGHI, although the point sequence after merging is not unique here, a closed polygon is finally generated in which the merged region is formed by connecting the points in the point sequence end to end).

Case2, if Acount =1 and Bcount =1 in the above step, (as shown in fig. 8, the figure is divided into two cases, in Case1, the point set corresponding to Acount is B, the point set corresponding to Bcount is H, in Case2, the point set corresponding to Acount is a, and the point set corresponding to Bcount is G)

Constructing an intersecting line Segment by using the points of RealInterSectPs obtained in the step as Segment; the two-area case corresponding to this case is shown in fig. 8, in which the designer manually draws an area ABCD as a restaurant and an area EFGH as a living room. If the intersected line Segment is the line Segment HB, i.e. Segment HB, as shown in case1 in FIG. 8, and if the intersected line Segment is the line Segment AG, i.e. Segment AG, as shown in case2 in FIG. 13.

We describe as shown in case1 in fig. 8:

putting all line segments (namely line segments EF, FG, GH and HE) in the PolygonB into a line segment set, and recording the line segments as Bsegs;

and (3) eliminating line segments intersecting with the PolygonA in the PolygonB, wherein the specific method is as follows:

calculating the distance SegToSegDis between each line Segment (i.e. each line Segment in Bsegs) in the PolygonB and Segment, if SegToSegDis is less than or equal to 5cm, further determining whether the line Segment is parallel to Segment, if so, recording the Index of the edge to be screened at this time as RemoveBSegIndex (i.e. the Index of the edge GH shown in case1 in fig. 8 in the polygon EFGH);

calculating the distance SegToSegDis between each line Segment in the PolygonA (i.e. each line Segment in the Asegs) and the Segment, if the SegToSegDis is less than or equal to 5cm, further determining whether the line Segment is parallel to the Segment, if so, recording the Index of the edge to be screened at the moment as removeasegdex (i.e. the Index of the edge AB shown in the case1 in fig. 8 in the polygon ABCD);

if the length of Segment is less than or equal to the length of the edge needing to be deleted in the PolygonA, the length of Segment is less than or equal to the length of the edge needing to be deleted in the PolygonB, and the length of the edge needing to be deleted in the PolygonA is not equal to the length of the edge needing to be deleted in the PolygonB:

and further judging: reconstructing a newly added edge (namely a newly added edge HA) in the Polygona by using the coordinate relationship between the end points of the edge to be deleted in the Polygona and the end points of the Segment (namely the position relationship between the judgment point A and the judgment point B as well as the two end points of the Segment HB), recording the newly added edge as AddSeg1, and removing the edge to be deleted in the Polygona; in the same way, newly added edges (namely newly added edges GB) in the polygon are recorded as AddSeg2, and edges to be deleted in the polygon are removed;

synchronously updating a new directed sequence line segment of the PolygonA and the PolygonB (namely, the PolygonA rejects the line segment AB, the new point sequence is HADCB after the line segment HA is added, the PolygonB rejects the line segment GH, the new point sequence is HEFGB after the line segment GB is added, and then the two regions are merged to obtain a merged region point sequence which is BCDAHEFG, wherein the merged point sequence is not unique at the position, but a closed polygon formed by connecting the points in the merged region end to end is finally generated);

the method for merging regions is similar to the above steps, as in the case of (2) in fig. 8.

Case3, if Acount =2 and Bcount =1 in the above step, (as shown in FIG. 9, the point set corresponding to Acount is A/B and the point set corresponding to Bcount is H in Case 1; and the point set corresponding to Acount is A/B and the point set corresponding to Bcount is G in Case 2) constructing an intersecting line Segment and recording the intersecting line Segment as Segment;

constructing an intersecting line Segment by using the points of RealInterSectPs obtained in the step as Segment;

the two-area case corresponding to this case is shown in fig. 14, in which the designer manually draws an area ABCD as a restaurant and an area EFGH as a living room. The intersecting Segment, at this time is Segment AB.

We describe as shown in case1 in fig. 14:

5.1.12. and (3) eliminating line segments intersecting with the PolygonA in the PolygonB, wherein the specific method is as follows:

calculating the distance SegToSegDis between each line Segment (i.e. each line Segment in Bsegs) in the PolygonB and the Segment, if the SegToSegDis is less than or equal to 5cm, further determining whether the line Segment is parallel to the Segment, comparing the length of the line Segment determined in the PolygonB with the Segment, if the length of the PolygonB is greater than or equal to the length of the Segment and the two are parallel, recording the Index of the edge to be screened at this time as RemoveBSegIndex (i.e. the Index of GH of the 1 side in fig. 14 in the polygon EFGH);

calculating the distance SegToSegDis between each line Segment in the PolygonA (i.e. each line Segment in the Asegs) and the Segment, if the SegToSegDis is less than or equal to 5cm, further determining whether the line Segment is parallel to the Segment, if the line Segment is parallel to the Segment, recording the Index of the edge to be screened at the moment as removeasegdex (i.e. the Index of the side AB in the polygon ABCD in case1 in fig. 14);

adding a line segment in the PolygonB (namely adding a line segment GB in the PolygonB) similarly to the method;

similarly, updating a new directed sequence line segment of the Polygona and the PolygonaB (namely, the new dot sequence of the Polygona after the PolygonA rejects the line segment AB is BCDA; the new dot sequence of the PolygonaB rejects the line segment GH, the new dot sequence of the Polygonab after the PolygonB adds the line segment GB is AEFGB, the dot sequence of the combined region of the two regions is BCDAEFG, the combined dot sequence is not unique, but a closed polygon formed by connecting the dots in the dot sequence end to end is finally generated);

similarly, the method for merging regions in case2 of FIG. 9 is similar to the above steps.

As shown in fig. 10, case4. if Acount =2 in the above step, Bcount =2 (point set corresponding to Acount is AB, point set corresponding to Bcount is HG), an intersecting line Segment is constructed and recorded as Segment;

constructing an intersecting line Segment by using the points of the InterSectPs obtained in the step as Segment;

the two-area case corresponding to this case is shown in fig. 15, in which the designer manually draws an area ABCD as a restaurant and an area EFGH as a living room. The Segment that intersects with the Segment AB at this time is Segment AB.

calculating the distance SegToSegDis between each line Segment in the PolygonB (namely each line Segment in the Bsegs) and the Segment, if the SegToSegDis is less than or equal to 5cm, further judging whether the line Segment is parallel to the Segment, comparing the length of the line Segment judged in the PolygonB with the Segment, if the length of the PolygonB is greater than or equal to the length of the Segment and the two are parallel, recording the Index of the edge to be screened at the moment as RemoveBSegIndex (namely the Index of the edge GH in the polygon EFGH in the graph 10), calculating the distance SegToSegDis between each line Segment in the PolygonA (namely each line Segment in the Asegs) and the Segment, if the SegToSegDis is less than or equal to 5cm, further judging whether the line Segment is parallel to the Segment, if the line Segment is parallel to the Segment to be screened at the moment, recording the record of the edge to be screened as RegoeSegSegSegSegSegSegSegSegSegSegSegSegSegSeeSeeB (namely the Segment in the graph 10, and the ABgBCEF region of the polygon ABgAB after being merged with the polygon ABGOAB; although the merged point order is not unique here, a closed polygon is finally generated in which the merged region is formed by connecting the points in the point order end to end.

Case5 shown in FIG. 11. if Acount =1 in the above step, Bcount =2 (in Case1 of FIG. 11, the point set corresponding to Acount is B, and the point set corresponding to Bcount is I/J; in Case1 of FIG. 11, the point set corresponding to Acount is A, and the point set corresponding to Bcount is I/J; in Case1 of FIG. 11, the intersecting line Segment is constructed and recorded as Segment;

the two-area case corresponding to this case is shown in fig. 11, in which the designer manually draws the area ABCD as a restaurant and the area EFGHIJ as a living room. If the intersected Segment is Segment BJ as shown in case (1) of FIG. 11, then Segment IA is Segment Segment as shown in case (2) of FIG. 11.

We describe this as shown in case (1) in FIG. 11:

placing all the line segments (i.e., segments EF, FG, GH, HI, IJ, JE) in PolygonB into a line segment set, and recording as Bsegs;

calculating the distance SegToSegDis between each line Segment (i.e. each line Segment in Bsegs) and Segment in the PolygonB, if SegToSegDis is less than or equal to 5cm, further judging whether the line Segment is parallel to Segment, comparing the length of the line Segment judged in the PolygonB with Segment, if the length of a certain line Segment in the PolygonB is greater than or equal to the length of Segment and the two are parallel, recording the Index of the edge to be screened at the moment, and recording the Index as RemoveBSegIndex (i.e. the Index of the line Segment IJ in the polygon EFGHIJ);

calculating the distance SegToSegDis between each line Segment in the PolygonA (namely each line Segment in the Asegs) and the Segment, if the SegToSegDis is less than or equal to 5cm, further judging whether the line Segment is parallel to the Segment, if so, recording the Index of the edge to be screened at the moment, and recording the Index as the RemoveASegIndex (namely the Index of the line Segment AB in the polygon ABCD);

similar to the method, adding a PolygonA and a line segment in PolygonB, and adding a line segment JA in the PolygonA at the moment;

similarly, updating new directed sequence line segments of the PolygonA and the PolygonB (namely, the point sequence of the combined region of the two regions is BCDAJEFGH, although the point sequence of the combined region is not unique here, a closed polygon formed by connecting the points in the point sequence end to end is finally generated);

similarly, the region (2) in fig. 11 is also processed similarly according to the above steps.

For this type of case, there may be other implementations, such as: when the point of the InterSectPs is 2, deleting two line segments which are mutually attached and parallel to the restaurant and the customer, and sequentially connecting the remaining points of the polygons of the restaurant and the living room according to the order of clockwise time or anticlockwise time so as to merge the polygons of the restaurant and the customer; taking fig. 7 as an example, the line segment AB of the restaurant and the line segment IJ of the living room are approximately parallel to each other and have a very close distance, so that the two line segments are deleted, and then the remaining points are used as a complete set, and a complete merged polygon is obtained after sorting according to the clockwise or counterclockwise direction of the space; similarly, in the case of fig. 8, the AB line segment of the restaurant and the HG line segment of the living room are parallel and close to each other, and after the two line segments are deleted, the remaining points may be sequentially reconnected to form a complete merged polygon.

In the second general case, the number of point sets in InterSectPs is 3;

as shown in fig. 13, the set of points in InterSectPs is A, B, H; next, the point sets in the pair of InterSectPs need to be marked sequentially. The method of tag ordering is as follows:

as shown in fig. 12, vectors are constructed between two vectors, for example: the three points are respectively P0, P1 and P2, and are recorded as follows: ，，

；

；

and uniformly normalizing the vectors to obtain:

，

，，

calculating a vector

And vector

Inner product of Res1, which is the value;

computing vectors And vector

Inner product of (2)This value is Res2;

computing vectors

And vector

Inner product of Res3, which is the value;

if the absolute value of Res1 in the above step is less than or equal to 0.01, sequentially putting P0, P1 and P2 into a new virtual wall line segment sequence point set, wherein the set is named OrderedPs;

if the absolute value of Res2 in the above step is less than or equal to 0.01, sequentially putting P1, P0 and P2 into OrderedPs; if the absolute value of Res3 in the above step is less than or equal to 0.01, then P0, P2 and P1 are put into OrderedPs in sequence.

Calculating Acount and Bcount when the number of the point sets in the InterSectPs is 2; similarly, the following three cases can be classified:

case6, if Acount =2 and Bcount =2 in the above step (in Case1, the Acount point set is A, B; the Bcount point set is I, H; in Case2, the Acount point set is A, B and the Bcount point set is I, H), constructing an intersecting line Segment which is recorded as Segment1 and Segment2;

constructing an intersecting line Segment by using the three points of the RealInterSectPs obtained in the step, and recording the intersecting line Segment as Segment1 and Segment2;

the two-area case corresponding to this case is shown in fig. 13, in which the designer manually draws the area ABCD as a restaurant and the area EFGHIJ as a living room. If the case (1) in fig. 13 shows that the intersecting Segment, Segment1, is Segment AB and Segment2 is Segment BH, if the case (2) in fig. 13 shows that the intersecting Segment, Segment1, is Segment AB and Segment2 is Segment AI.

We describe this as shown in case (1) in FIG. 13:

similarly to the above method for deleting edges, record the set of indexes of the edges to be deleted in the polygon a (i.e. the indexes of the edges AB and BC in the polygon ABCD shown in (1) in fig. 13) and the set of indexes of the edges to be deleted in the polygon b (i.e. the indexes of the edges HI and IJ in the polygon EFGHIJ shown in (1) in fig. 13), update the line segments (the polygon new line segment HC and the polygon new line segment AJ) in the polygon a and the polygon b, and connect the line segments in order to form an oriented line segment, that is, the dot sequence after merging the two regions is: HCDAJEFG;

the same method for region merging as shown in (2) of fig. 13 is similar to the above steps.

Case7, as shown in FIG. 14, if Acount =3 and Bcount =1 in the above step (in Case1, the Acount point set is A, B, C and the Bcount point set is I; in Case2, the Acount point set is D, A, B and the Bcount point set is H), constructing an intersecting line Segment, which is recorded as Segment1 and Segment2;

the two-area case corresponding to this case is shown in fig. 14, in which the designer manually draws the area ABCD as a restaurant and the area EFGHIJ as a living room. If (1) in fig. 14 shows that Segment1 is Segment AB and Segment2 is Segment BC, and if (2) in fig. 14 shows that Segment1 is Segment AB and Segment2 is Segment AD.

We describe the following description with (1) in FIG. 14:

similar to the method for deleting edges in Case6, record the set of indexes of edges to be deleted in polygon (i.e. the indexes of edges AB and BC in polygon ABCD) and the set of indexes of edges to be deleted in polygon b (i.e. the indexes of HI and IJ in polygon EFGHIJ), update the line segments in polygon and polygon b (i.e. after removing the corresponding edges, adding edges HC and AJ in polygon b), and connect sequentially to form a directed line segment (i.e. the point sequence of the merged region of two regions is: cdajejehc, although the dot sequence of the merged region is not unique here, a closed polygon formed by connecting the points of the merged region end to end is finally generated);

the same method for region merging as shown in (2) of fig. 14 is similar to the above steps.

As shown in FIG. 15, Case8, if Acount =2 and Bcount =3 in the above step (in Case1, the Acount point set is A, B and the Bcount point set is I, I, J; in Case2, the Acount point set is A, B and the Bcount point set is G, H, I), constructing an intersecting line Segment, which is recorded as Segment1 and Segment2;

the two-area case corresponding to this case is shown in fig. 15, in which the designer manually draws the area ABCD as a restaurant and the area EFGHIJ as a living room. If (1) in fig. 15 shows that Segment1 is Segment AB and Segment2 is Segment BH, and if (2) in fig. 15 shows that Segment1 is Segment AB and Segment2 is Segment AI.

We describe the following description with (1) in FIG. 15:

similar to the method for deleting edges in Case7, record the set of indexes of the edges to be deleted in polygon (i.e. the indexes of the edges AB and BC in the polygon ABCD) and the set of indexes of the edges to be deleted in polygon b (i.e. the indexes of the edges HI and IJ in the polygon EFGHIJ), and update the line segments in polygon and polygon b (i.e. after removing the intersecting line segments, adding a line segment HC in polygon a, and combining the two regions to obtain the dot order of CDAEFGH.

For this type of case, there may be other implementations, such as: two line segments which are mutually attached and parallel to the restaurant and the client are deleted, points which are mutually attached in the point set to be selected are deleted, and then the remaining points of the polygons of the restaurant and the living room are sequentially connected according to the order of clockwise time or anticlockwise so that the polygons of the restaurant and the client are merged. Taking the case (1) of fig. 14 as an example, parallel line segments between the restaurant and the customer and adjacent line segments share AB, BC, IJ, and IH, and these four line segments are deleted, and since the point set of InterSectPs is a/B/I/C, the distances of I and B among these four points are very close, and it is necessary to delete the point sets in the polygons of the restaurant and the living room, the remaining point sets of the restaurant and the customer are composed of aegahcd, and the line segments are sequentially connected by the remaining points in a clockwise or counterclockwise direction, so that a complete combined polygon can be obtained. Similarly, for the case (1) in fig. 15, after removing the adjacent and parallel straight lines AB/BH/JI/HI between the restaurant and the living room, the BI points in the point set ABHIJ of InterSectPs are adjacent, these two points are removed, and the remaining points AJEFGHCD are connected in sequence to form a line segment, which becomes a complete merged polygon.

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, the order in which elements and sequences of the processes described herein are processed, the use of alphanumeric characters, or the use of other designations, is not intended to limit the order of the processes and methods described herein, unless explicitly claimed. 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 region processing method of a home decoration design drawing is characterized by comprising the following steps:

e, deleting two line segments which are mutually attached and parallel to the restaurant and the client, and sequentially connecting the remaining points of the polygons of the restaurant and the living room according to the order of clockwise time or anticlockwise time so as to merge the polygons of the restaurant and the client;

and f, deleting two line segments which are mutually attached and parallel to the restaurant and the customer, deleting mutually attached points in the point set to be selected, and sequentially connecting the remaining points of the polygons of the restaurant and the living room according to the order of clockwise time or anticlockwise time so as to merge the polygons of the restaurant and the customer.

2. The method for area processing of a home decoration plan of claim 1, wherein the first threshold value is 5cm in one embodiment; the second threshold is 3.5-4 cm.

3. The method for processing an area of a home decoration design drawing according to claim 1, wherein in the step e, the determination of the mutual contact and parallelism means that the mutual distance is less than 5cm, and the mutual parallelism means that the included angle of the straight lines is 0 to 2 °.

4. The method for area processing of a home decoration design drawing of claim 1, wherein in one embodiment, the step f, the mutual contact is performed such that the distance between the point and the point is less than 5 cm.

5. A system for area processing of a home decoration plan, comprising:

6. The area handling system for a home decoration plan of claim 5, wherein in one embodiment, the first threshold is 5 cm; the second threshold is 3.5-4 cm.

7. The system for area handling of a home decoration plan of claim 5, wherein in one embodiment, in the first combining module, the determination of being parallel and close to each other means that the close distance is less than 5cm and the parallel means that the included angle of the straight lines is 0-2 °.

8. The area handling system of a home decoration plan of claim 5, wherein in one embodiment, the second merge module is attached to each other with a distance between a point and a point of less than 5 cm.

9. A computer-readable medium storing a program for executing the area processing method of the home decoration design drawing according to claim 1.