Landscaping method based on landscaping feature migration

Abstract

The invention discloses a landscaping method based on landscaping feature migration. A designer only needs to input a landscaping shape diagram of a landscaping area, and the system automatically constructs feature data of the landscaping area, and automatically matches a template shape diagram with the maximum feature similarity from a solution library, and then calculates the indentation or outdentation relationship between landscaping vertices in the landscaping shape diagram and template vertices associated with them in the template shape diagram, and calculates the fusion coordinates of each template landscape point in each sub-region in the intersection area of ​​the template shape diagram and the landscaping shape diagram after migration to the landscaping area, thereby realizing automatic adjustment of the position of the template landscape point migrated to the landscaping area by the system; by performing low-dimensional processing on the fusion coordinates, the amount of data when the system processes a large number of landscaping requirements at the same time is reduced, and the landscaping speed is improved; and the high-dimensional processing uses the landscaping vertices of the sub-region as a reconstruction reference, and makes a secondary adjustment to the landscaping position of the template landscape point.

Description

Technical Field

[0001] The invention relates to the technical field of garden design, and in particular to a landscaping method based on landscaping feature migration. Background Art

[0002] Garden landscaping includes many methods such as borrowing scenery, facing scenery, stacking mountains and water, and building landscape. The shape and size of the landscaping area are important factors affecting the layout of the landscaping. For example, when user A and user B both want to have rockery, pools, corridors, pavilions, shrubs, trees, doorways and other landscapes in the landscaping area, that is, different users have the same requirements for landscaping, but the shape or size of the landscaping area of ​​user A is different from that of user B, considering the landscaping effect, it is usually necessary to design the landscaping solutions of user A and user B differently. Therefore, even if the users have the same landscaping requirements, but the shapes or sizes of the landscaping areas are different, the existing technology usually adopts artificial customized landscaping methods, and it is impossible to automatically apply the landscaping solution of user A to the landscaping area of ​​user B through the system.

[0003] For scenes with the same landscaping requirements but different shapes or sizes of landscaping areas, customized artificial landscaping methods have the following two main defects:

[0004] 1. In this scenario, there may be differences in the types of landscapes in different landscaping areas, but due to the same landscaping requirements, the overall differences are usually not large, and the location layouts of landscapes of different types are also similar. Customized manual landscaping design for these landscaping areas each time results in high repetitiveness, time-consuming and labor-intensive work, and lack of automation.

[0005] 2. Customized landscaping schemes lack real samples. This is because, in the process of artificial landscaping design, it is impossible to find in advance a real landscaping scheme that can be used as a reference for landscaping design. Especially when different designers are responsible for different landscaping design projects, it is even more difficult to know which landscaping schemes with real scenes can be used as a reference for the current landscaping design. Users cannot directly see the real landscaping products that are highly similar to the designed landscaping schemes before construction. Summary of the invention

[0006] The invention aims to realize automatic landscaping with realistic samples in a landscaping area and provides a landscaping method based on landscaping feature migration.

[0007] To achieve this object, the present invention adopts the following technical solutions:

[0008] A landscaping method based on landscaping feature migration is provided, the steps comprising:

[0009] L1, based on the vertex array features, matches the template shape graph with the greatest similarity to the landscaping area shape from the sample library;

[0010] L2, identifying the complementary area of ​​the template shape image and the landscaping shape image with the maximum similarity, marking the landscaping vertices in the landscaping shape image as inward vertices or outward vertices and synchronously marking the complementary area as inward vertices or outward vertices, and then calculating the inward contraction relationship or outward expansion relationship between each landscaping vertex and the template vertex associated with it in the template shape image;

[0011] L3, dividing the intersection area of ​​the template shape map and the landscaping shape map after maximum similarity matching into a plurality of sub-areas, and obtaining the three-dimensional coordinates of each template landscape point in each sub-area on the template shape map, merging the inward contraction relationship or the outward expansion relationship bound to the sub-area to which it belongs into fused coordinates, performing low-dimensional processing, and then migrating them to the landscaping shape map;

[0012] L4, according to the instruction, high-dimensional processing is performed on each of the template landscape points migrated to the landscaping shape diagram to obtain a three-dimensional space model of the landscaping area carrying the inward contraction area and / or the outward expansion area mark, and the real space coordinates of each of the template landscape points in the landscaping area are marked in the model.

[0013] Preferably, step L1 specifically comprises the steps of:

[0014] L11, arbitrarily select at least one vertex in the landscaping shape graph enclosing the landscaping area as a reference vertex for similarity matching, and construct a feature array of each reference vertex, expressed as: , is a first basis angle formed by the basis vertex and a straight line connecting two adjacent basis vertices; A second basis angle formed by a first adjacent basis vertex adjacent to the basis vertex and a straight line connecting two adjacent basis vertices; A third basis angle formed by a second adjacent basis vertex adjacent to the basis vertex and a straight line connecting the two adjacent basis vertices;

[0015] L12, selecting from the sample library each of the template shape graphs having array feature similarity with each of the base vertices in the landscaping shape graph;

[0016] L13, for each of the template shape graphs screened in step L12, after aligning any vertex combination with array feature similarity, rotate the template shape graph with the alignment point as the fulcrum to find the critical point where the overlapping area of ​​the template shape graph and the landscape shape graph changes from increasing to decreasing, and use the maximum area intersection and union ratio of the template shape graph and the landscape shape graph calculated at each critical point as the similarity between the template shape graph and the landscape shape graph.

[0017] Preferably, in step L12, the array feature similarity The calculation method is:

[0018]

[0019] The feature array of the template vertices in the template shape graph is recorded as: , is the first template angle formed by the template vertex and the straight line connecting two adjacent template vertices; A second template angle formed by a first adjacent template vertex adjacent to the template vertex and a straight line connecting two adjacent template vertices; A third template angle formed by a second adjacent template vertex adjacent to the template vertex and a straight line connecting the two adjacent template vertices;

[0020] is the weight, .

[0021] Preferably, in step L11, the relationship between the number of the selected basis vertices and the number of edges enclosed by the landscaping shape diagram is: the number of edges of the landscaping shape diagram is equal to twice the number of the selected basis vertices plus "1".

[0022] Preferably, in step L2, the method for constructing the association relationship between each of the landscaping vertices in the landscaping shape graph and the template vertex in the template shape graph having the maximum similarity comprises the steps of:

[0023] L211, sequentially acquiring each of the landscaping vertices in the enclosing path whose basis vertex is used as the rotation fulcrum for shape similarity matching in step L1 and is the starting vertex for enclosing the landscaping shape graph, and arranging them in the acquisition order to form a landscaping vertex list;

[0024] At the same time, each of the template vertices in the enclosing path with the template vertex also serving as the rotation fulcrum as the starting vertex for enclosing the template shape graph is obtained in the same order, and arranged in the order of acquisition to form a template vertex list;

[0025] L212, obtaining the feature array of the first landscape vertex in the landscape vertex list, and then matching the template vertex with the maximum array feature similarity to the feature array from the template vertex list in the order in which the template vertices are obtained, and constructing the serial number pair of the successfully matched landscape vertex and the template vertex as the association relationship between the two, and filtering out the landscape vertex and the template vertex whose association relationship construction is completed from the list;

[0026] L213, repeating step L212 until the attempt to build the association relationship of all the landscaping vertices in the landscaping vertex list is completed, and then determining whether the landscaping vertex list is "empty",

[0027] If so, it is determined that the association relationship is successfully constructed for the landscaping vertex list;

[0028] If not, it will prompt that the automatic landscaping of the landscaping area has failed.

[0029] Preferably, in step L2, according to the identified complementary area, a method for marking each of the landscaping vertices in the landscaping shape diagram as an inward-contracting vertex or an outward-expanding vertex is:

[0030] Determine whether the template vertices enclosing the complement area fall into the landscaping shape diagram; if so, mark the landscaping vertices having the association relationship with the template vertices as the inward-retracting vertices and mark the complement area as the inward-retracting area; otherwise, mark them as the outward-expanding vertices and mark the complement area as the outward-expanding area.

[0031] Preferably, in step L2, the shrinking relationship or the expanding relationship calculated for the landscaping vertex having the association relationship includes: a straight-line migration distance and a migration direction required to migrate the landscaping vertex to the template vertex.

[0032] Preferably, step L3 specifically comprises the steps of:

[0033] A1, identifying the center point of the template shape graph and the center point of each edge, and directly connecting each center point with the center point to divide the intersection area into a plurality of sub-areas;

[0034] A2, obtaining the inward contraction relationship or the outward expansion relationship bound to the landscaping vertex having the associated relationship with the template vertex in the sub-region, merging the three-dimensional coordinates of each template landscape point in the sub-region into the fused coordinates, performing low-dimensional processing, and then migrating them into the landscaping shape map;

[0035] The method of merging into the fusion coordinates is:

[0036] From the inward contraction relationship or the outward expansion relationship bound to the landscape vertex having the association relationship, the linear migration distance required to migrate the landscape vertex to the template vertex is parsed and migration direction, wherein the migration direction constructs an xy axis coordinate system with the template vertex as the origin, representing the migration distance The angle between the straight line and the horizontal line express;

[0037] For each template landscape point in the sub-area associated with the indentation relationship, Angular expansion migration distance The three-dimensional coordinates of the latter are the fusion coordinates;

[0038] For each template landscape point in the sub-area associated with the outward expansion relationship, Angular inward migration distance The three-dimensional coordinates at which the fusion coordinates are located are the fusion coordinates.

[0039] Preferably, the method for performing low-dimensional processing on the fused coordinates is:

[0040] The elevation values ​​(z-axis coordinate values) representing the template landscape points in the fused coordinates are subjected to low-dimensional processing, wherein the coordinate values ​​of the coordinate axes representing the elevation values ​​in the fused coordinates of the template landscape points to be migrated to the landscaping shape map are the same;

[0041] Alternatively, the coordinate values ​​of two different types of coordinate axes in the fused coordinates are subjected to low-dimensional processing, and the processing method is: the number of coordinate values ​​having axis correspondence and the same coordinate value in the fused coordinates of each template landscape point to be migrated to the landscaping shape diagram is two.

[0042] Preferably, step L4 specifically comprises the steps of:

[0043] B1, according to the instruction, for each of the fused coordinates that have been low-dimensionalized and migrated to the sub-region, find a reference coordinate point for high-dimensionalization processing, the reference coordinate point being: the landscaping vertex that has been migrated to the sub-region;

[0044] B2, calculating the real coordinates of each of the fused coordinates in the sub-region in the real space of landscaping according to the mapping relationship between the reference coordinate point found and the real reference coordinate point of the reference coordinate point in the real space of landscaping;

[0045] B3, performing high-dimensional processing on each of the template landscape points migrated to the landscaping shape map to obtain a three-dimensional space model of the landscaping area carrying a shrinking area and / or an expanding area mark, and marking the real coordinates of each of the template landscape points in the real space in the model.

[0046] The present invention has the following beneficial effects:

[0047] 1. Designers only need to input the landscaping shape diagram of the landscaping area, and the system will automatically construct the feature data (vertex array features) of the landscaping area, and automatically match the template shape diagram with the maximum feature similarity from the solution library, and then calculate the indentation or outdentation relationship between the landscaping vertices in the landscaping shape diagram and the template vertices in the template shape diagram that have an associated relationship with it, and calculate the fusion coordinates of each template landscape point in each sub-area in the intersection area of ​​the template shape diagram and the landscaping shape diagram after migration to the landscaping area, so as to realize the automatic adjustment of the position of the template landscape point migrated to the landscaping area by the system; by low-dimensional processing of the fusion coordinates, the amount of data when the system processes a large number of landscaping requirements at the same time is reduced, and the landscaping speed is improved; high-dimensional processing uses the landscaping vertices of the sub-area as the reconstruction reference, and makes a secondary adjustment to the landscaping position of the template landscape point.

[0048] 2. A set of landscaping area shape similarity matching methods is provided. It does not require a complex image similarity matching algorithm. It only needs to specify the basis vertex as the similarity matching in the landscaping shape map, and construct the feature array of the basis vertex. Then, by matching the array feature similarity between the basis vertex and the template vertex in the template shape map, it can more accurately and quickly preliminarily screen out several template shape maps with similarity to the landscaping shape map. Then, the alignment point after the basis vertex and the template vertex with array feature similarity are aligned is used as the fulcrum, and the image is rotated to find the critical point where the overlapping area changes from increasing to decreasing, and the maximum overlapping area is used as the similarity value between the landscaping shape map and the template shape map, so as to realize the accurate search of the template shape map with the maximum shape similarity to the landscaping shape map in each of the initially screened template shape maps.

[0049] The most important thing is that this similarity matching method is conducive to the subsequent accurate construction of the relationship between the landscaping vertices and the template vertices, which is conducive to improving the subsequent migration accuracy of the template landscape points in the template shape diagram, thereby realizing the automated landscaping of the landscaping area and improving the landscaping effect.

[0050] 3. In constructing the association between the landscaping vertices and the template vertices, through step L212, the template vertices in the template shape diagram that have no association with the landscaping vertex list are filtered out, and the landscaping vertices associated with the remaining template vertices are used as the reference coordinate points for high-dimensional processing in steps B1-B3, which is conducive to improving the speed and accuracy of subsequent machine automatic landscaping. In addition, through steps L211-L213, it is realized to verify whether the template shape diagram matched in step L1 is suitable as the basis for landscaping the landscaping area, thereby reducing the error rate of machine automatic landscaping.

[0051] 4. In step L2, by judging whether the template vertex enclosing the complementary area falls into the landscaping shape diagram, it is possible to quickly identify whether the landscaping vertex associated with the template vertex is an expanding vertex or a shrinking vertex, which is conducive to realizing the rapid calculation of the shrinking relationship or expanding relationship between the landscaping vertex associated with the template vertex, so that in step L3, the position migration of the template landscape point in the template shape diagram based on the shrinking relationship or the expanding relationship is more accurate.

[0052] 5. Through steps A1-A2, the migration positions of the template landscape points in the template shape map having the greatest similarity to the landscape shape map are accurately found in a fine-grained manner, so that the migrated template landscape points have a better spatial position layout in the landscape area.

[0053] 6. In step L3, each fusion coordinate is processed in low-dimensionality, so that in the process of automating the landscaping of a large number of landscaping areas at the same time, the amount of landscaping data processing is greatly reduced. In addition, after completing the migration of each template landscape point through step L3, the system can obtain the three-dimensional space model of the landscaping area by high-dimensional processing of the landscaping shape diagram that has completed the migration according to the instructions of the designer and actual needs, instead of constructing the three-dimensional space model of the landscaping area for all the landscaping shape diagrams that have completed the migration through low-dimensional processing, and at the same time, it reduces the possibility of model construction errors or failures that are easy to occur due to excessive consumption of computing resources for constructing three-dimensional space models of a large number of landscaping shape diagrams at the same time.

[0054] 7. In steps B1-B3, the high-dimensional processing uses the landscaping vertices of the sub-region as a reconstruction reference, thereby making a secondary fine-tuning of the layout of the template landscape points to the landscaping area, making the layout of the template landscape points in the landscaping area more reasonable.

[0055] 8. In step L11, the landscaping accuracy is adjusted by setting the number of vertices. When the amount of sample library data is sufficient, the more vertices are set for the landscaping shape graph, the greater the difficulty of matching the template shape graph, and the higher the landscaping accuracy. In addition, since the matching method provided in step L13 for matching the landscaping shape graph with the template shape graph of the maximum shape similarity requires finding alignment points, identifying critical points, and calculating the area intersection and comparison algorithm support, the algorithm is complex and time-consuming. In step L11, the difficulty of the initial screening of the template shape graph in step L12 can also be adjusted by setting the number of vertices, so as to control the number of screening objects of the template shape graph with the most similarity from the initial screening results in step L13, thereby improving the execution speed of step L13. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0057] Figure 1 It is a diagram of implementation steps of a landscaping method based on landscaping feature migration provided by an embodiment of the present invention;

[0058] Figure 2 It is an example diagram for constructing an inward contraction relationship or an outward expansion relationship between the landscaping shape diagram and the template shape diagram; DETAILED DESCRIPTION

[0059] The technical solution of the present invention is further described below with reference to the accompanying drawings and through specific implementation methods.

[0060] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on this patent; in order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of the actual product; for those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.

[0061] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "inner", "outer", etc. appear, the orientation or position relationship indicated is based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as a limitation on this patent. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.

[0062] In the description of the present invention, unless otherwise clearly specified and limited, if the term "connection" or the like appears to indicate the connection relationship between components, the term should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two components or the interaction relationship between two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0063] At present, the landscaping methods for different customers are basically customized. That is, regardless of whether the landscaping requirements of different customers are the same, and whether the shapes and sizes of the landscaping areas are the same, designers are arranged to conduct on-site inspections of the landscaping areas and then conduct special designs. This poses the following two problems to designers and customers:

[0064] 1. For designers, when different customers have the same landscaping needs and the shapes, sizes and other features of the landscaping areas are similar, current customers are usually able to accept historical landscaping solutions that have similar features to their own landscaping areas and have physical samples. However, when the number of designers is large, it is difficult for designers to know whether there are historical landscaping solutions in the solution library that have similar features to the landscaping areas of the current customers. Even if there are applicable solutions, it is not easy to find the historical landscaping solutions from the solution library when the amount of data in the solution library is huge. The most critical thing is that even if a historical landscaping solution suitable for the current customer is found manually, the landscape design for the current customer still needs to be done manually by the designer, and the historical landscaping solution found is only used as a reference sample for the current design, and the system cannot automatically issue a corresponding landscaping solution based on the characteristics of the current customer's landscaping area. This is because, even if the landscaping areas of the current customer and the historical customer have similar shapes, there are usually inevitable differences. For example, although the shapes of the landscaping areas are similar, if the landscaping areas are of different sizes, how can the system achieve automatic landscaping with reference to the matched similar historical landscaping plans for areas of different sizes, or how can the system achieve automatic landscaping for areas of dissimilar shapes?

[0065] 2. For customers, during the landscaping scheme design stage, they expect the landscaping scheme to have a physical sample, and this physical sample is a physical sample with similar characteristics to their own landscaping area, so that before the formal construction, the customer can visit the sample site so that the landscaping scheme can be adjusted in time.

[0066] In order to solve the above two problems, designers in this field expect that as long as some characteristic data about the customer's landscaping area is input, the system can quickly and automatically match historical landscaping plans associated with historical landscaping areas with characteristic similarities from the plan library (sample library), and in view of the differences between the current customer's landscaping area and the historical landscaping area due to factors such as different landscaping area sizes, the system can automatically adjust the landscaping plan when migrating the landscaping points in the historical landscaping plan to the current customer's landscaping area, so that the migrated landscaping points have a better landscaping layout in the current customer's landscaping area. But what kind of parameters should be input to enable the system to quickly match historical landscaping plans with physical samples, and how can the system automatically adjust the landscaping plans for different areas? In addition, when the system needs to handle a large number of landscaping needs at the same time, how can it ensure the landscaping speed and improve the design experience?

[0067] The following specifically describes how the landscaping method based on landscaping feature migration provided in this embodiment solves the above-mentioned problems.

[0068] The landscaping method based on landscaping feature migration provided by the embodiment of the present invention is as follows: Figure 1 As shown, the steps include:

[0069] L1, based on the vertex array features, a template shape image with the greatest similarity to the landscaping area shape is matched from the sample library. The specific method includes the following steps:

[0070] L11, arbitrarily select at least one vertex in the landscaping shape graph that encloses the landscaping area as the basis vertex for similarity matching, and construct a feature array for each basis vertex, expressed as: , is the first basis angle formed by the basis vertex and the straight lines connecting two adjacent basis vertices; is a second basis angle formed by a first adjacent basis vertex adjacent to the basis vertex and a straight line connecting two adjacent basis vertices; A third basis angle formed by a second adjacent basis vertex adjacent to the basis vertex and a straight line connecting the two adjacent basis vertices;

[0071] For example, suppose Figure 2 As shown in is a basis vertex in the landscaping shape diagram. , For If two adjacent basis vertices are adjacent, then the first basis angle Vertex , The connecting line between the vertices , The angle formed by the straight lines between (defined as the first basis angle). Then the vertex , The direct line between the vertices , The angle formed by the straight lines between them. Then the vertex , The direct line between the vertices , The angle formed by the straight lines between them.

[0072] L12, selecting from the sample library each template shape graph having numerical feature similarity with each basis vertex in the landscaping shape graph;

[0073] For example, assuming that the number of base vertices selected in step L11 is one, then a vertex array feature list associated with each template shape graph in the sample library is obtained, and the template vertices in the list are arranged in sequence according to the enclosing order of the template shape graph and are respectively bound to their respective template vertex feature arrays. Then, the feature array of the base vertex is matched with the feature array of each template vertex in the list for array feature similarity, and if the match is successful, the template shape graph is screened out from the sample library.

[0074] Assuming that the number of basis vertices selected in step L11 is multiple, when each basis vertex matches a template vertex with the maximum array feature similarity in the list, and the template vertices matched by each basis vertex are different template vertices, the template shape graph is screened out from the sample library. Therefore, in the landscaping method based on landscaping feature migration provided in this embodiment, the accuracy of landscaping can be adjusted by setting the number of basis vertices. When the number of basis vertices set is more, the difficulty of matching the template shape graph is greater, and the landscaping accuracy is higher.

[0075] In this embodiment, the similarity between the array features of the vertex and the template vertex is used Express, The calculation method is:

[0076]

[0077] The feature array of the template vertices in the template shape graph is recorded as: , The first template angle formed by the template vertex and the straight line connecting two adjacent template vertices; A second template angle formed by a first adjacent template vertex adjacent to the template vertex and a straight line connecting two adjacent template vertices; The third template angle is formed by the second adjacent template vertex adjacent to the template vertex and the straight line connecting the two adjacent template vertices. The method for determining the template angle is the same as the angle based on the above example, and will not be repeated. is the weight, .

[0078] After screening out each template shape graph having array feature similarity with each vertex in the landscaping shape graph through step L12, the method of matching the template shape graph having the greatest similarity with the landscaping area shape from the sample library in step L1 proceeds to step:

[0079] L13, for each template shape diagram screened in step L12, align any vertex combination with array feature similarity, and then rotate the template shape diagram with the alignment point as the fulcrum to find the critical point where the overlapping area of ​​the template shape diagram and the landscaping shape diagram changes from increasing to decreasing, and use the maximum area intersection and union ratio of the template shape diagram and the landscaping shape diagram calculated at each critical point as the similarity between the template shape diagram and the landscaping shape diagram.

[0080] It should be noted that, in this embodiment, the system realizes the rapid and automatic adjustment of the position of the template landscape point to the landscaping area through the following two technical points:

[0081] First, the shrinkage relationship or expansion relationship between the landscaping vertex in the landscaping shape map and the template vertex in the template shape map that has an associated relationship with the landscaping vertex is calculated, and then based on the shrinkage relationship or expansion relationship, the fusion coordinates of each template landscape point in each sub-area of ​​the intersection area of ​​the template shape map and the landscaping shape map after migration to the landscaping area are calculated.

[0082] Therefore, the key to achieving the system's automatic adjustment of the position of the template landscape point migration to the landscaping area is to accurately construct the indentation or outdentation relationship between the landscaping vertex and the template vertex, and the accuracy of the indentation or outdentation relationship construction depends on the accuracy of the alignment of the landscaping vertex and the template vertex. Figure 2 In the example, assuming that the landscape vertex With template vertex If the landscaping shape diagram and the template shape diagram are aligned, the intersection area of ​​the landscaping shape diagram and the template shape diagram will be greatly reduced, and the difference area between the landscaping shape diagram and the template shape diagram will be increased, thereby increasing the difficulty of accurately constructing the contraction relationship or the expansion relationship, which is not conducive to the subsequent improvement of the migration accuracy and migration speed of the template landscape points. Therefore, in the similarity matching of the template shape diagram and the landscaping shape diagram in step L13, this embodiment does not adopt the currently mature image similarity matching algorithm, for example, directly learning the shape features of the image through a neural network, and then directly identifying the template shape diagram with shape feature similarity to the landscaping shape diagram in the sample library through the completed learning model. Because the template shape diagram with the maximum shape similarity with the landscaping shape diagram obtained by matching in this way cannot simultaneously obtain the alignment relationship between each template vertex in the matched template shape diagram and the landscaping vertex in the landscaping shape diagram.

[0083] However, in step L13, the template shape diagram is rotated with the alignment point as the fulcrum, and the template shape diagram with the maximum shape similarity with the landscaping shape diagram is further searched among the template shape diagrams preliminarily screened in step L12. Since the alignment of the template shape diagram and the landscaping shape diagram requires algorithm support, the identification of the critical point where the overlapping area of ​​the template shape diagram and the landscaping shape diagram changes from increasing to decreasing also requires algorithm support, and the calculation of the area intersection and union ratio of the template shape diagram and the landscaping shape diagram at each critical point also requires algorithm support. Therefore, the maximum similarity matching process algorithm of step L13 is complex and time-consuming. In order to solve this problem, the difficulty of the initial screening of the template shape diagram in step L12 can also be adjusted by setting the number of vertices in step L11, so as to control the number of screening objects of the template shape diagram with the most similarity from the initial screening results in step L13.

[0084] In order to ensure the accuracy of the initial screening of the template shape graph in step L12 and take into account the matching speed of the template shape graph with the maximum similarity in step L13, in this embodiment, preferably, the relationship between the number of the selected basis vertices in step L11 and the number of the edges that enclose the landscaping shape graph is: the number of the edges of the landscaping shape graph is equal to twice the number of the selected basis vertices plus "1". For example, the landscaping shape graph is Figure 2 The pentagon shown, that is, the number of sides of the landscaping shape diagram is "5", and the number of vertices selected is "2".

[0085] Through step L1, after matching the template shape image with the greatest similarity to the landscaping area shape from the sample library, as shown in Figure 1 As shown, the landscaping method based on landscaping feature migration provided in this embodiment enters the steps:

[0086] L2, identify the complementary region of the template shape map and the landscape shape map with the maximum similarity ( Figure 2), and mark the landscaping vertices in the landscaping shape diagram as indented vertices or outdented vertices (the purpose is to distinguish the types of complementary areas where the landscaping vertices fall into as indented areas or outdented areas, so as to prompt designers to use different methods to perform subsequent artificial landscaping designs for different types of complementary areas), and then calculate the indentation relationship or outdentation relationship between each landscaping vertex and the template vertex associated with it in the template shape diagram;

[0087] In step L2, according to the identified complementary area, the method for marking each landscaping vertex in the landscaping shape diagram as an inward-contracting vertex or an outward-expanding vertex is as follows:

[0088] Determine whether the template vertex enclosing the complementary set area falls into the landscaping shape diagram. If so, mark the landscaping vertex associated with the template vertex as an inward vertex, otherwise mark it as an outward vertex. For example, Figure 2 In the template vertex Participate in enclosing the complementary area 100, then judge the template vertex Does it fall into the landscape shape diagram 10? If so, it will be aligned with the template vertex Landscape vertices with associated relationships (aligned relationships) Mark as an indent vertex, otherwise mark as an outdent vertex. Figure 2 In the template vertex If it does not fall into the landscaping shape diagram, it is marked as an outward expansion vertex, and the complementary area 100 is marked as an outward expansion area at the same time.

[0089] In step L2, the landscaping vertices and the template vertices have an associated relationship, which means that the landscaping vertices and the template vertices have an alignment relationship. Since the number of edges of the template shape graph that has the greatest similarity to the landscaping shape graph may be different from the number of edges of the landscaping shape graph, when the template shape graph is rotated with a fulcrum to a state with the greatest overlapping area with the landscaping shape graph, the alignment relationship between the landscaping vertices in the landscaping shape graph and the template vertices in the template shape graph may not be a "one-to-one alignment" relationship. For example Figure 2 In the template vertex , Have different array characteristics, but are identical to the aquascape vertices in the aquascape shape diagram The relative distance is close, so we need to , Identify The template vertices with an alignment relationship (association relationship) are selected, and another one is filtered out. By constructing an association relationship between the template vertex and the landscaping vertex, the landscaping vertex associated with the remaining template vertex is used as the reference coordinate point for high-dimensional processing in steps B1-B3, which is beneficial to improving the subsequent machine automatic landscaping speed and accuracy.

[0090] In this embodiment, the method for constructing the association relationship between each landscaping vertex in the landscaping shape graph and the template vertex in the template shape graph with the maximum similarity comprises the following steps:

[0091] L211, sequentially obtain each landscaping vertex in the enclosed path with the basis vertex serving as the rotation fulcrum for shape similarity matching in step L1 as the starting vertex of the enclosed landscaping shape graph, and arrange them in the order of acquisition to form a landscaping vertex list;

[0092] For example, Figure 2 In the landscape shape Figure 10, the base vertex is the rotation fulcrum and the starting vertex of the enclosed landscaping shape diagram 10. Then, for example, in the order of enclosing in a counterclockwise manner, a list of landscaping vertices arranged in a counterclockwise order is obtained from the enclosed path, that is, Figure 2 The list of landscape vertices obtained in is expressed as: .

[0093] At the same time, each template vertex in the enclosing path with the template vertex that also serves as the rotation fulcrum as the starting vertex of the enclosed template shape graph is obtained in the same order (for example, in the counterclockwise order), and arranged according to the acquisition order to form a template vertex list;

[0094] For example, Figure 2 In the template shape diagram 20, the template vertices It is also the rotation fulcrum and the starting vertex of the template shape diagram 20. Then, in the same counterclockwise order of enclosure, a list of template vertices arranged in counterclockwise order is obtained from the enclosure path, that is, Figure 2 The template vertex list obtained in is expressed as: .

[0095] Then proceed to step:

[0096] L212, obtain the feature array of the first landscaping vertex in the landscaping vertex list, and then match the template vertex with the maximum array feature similarity with the feature array from the template vertex list in the order in which the template vertices are obtained, and construct the serial number pair of the successfully matched landscaping vertex and the template vertex as the association relationship between the two, and filter out the landscaping vertices and template vertices that have completed the association relationship construction from the list;

[0097] For example, from the Landscape Vertex List Get the first landscape vertex in The feature array of , assuming that the template vertex in the template vertex list Vertex of Landscape Design has the largest array feature similarity, then This pair of numbers is used as a template vertex Vertex of Landscape Design The relationship between the two, and then filter out from the two lists , .

[0098] L213, repeat step L212 until the attempt to build the association relationship of all the landscaping vertices in the landscaping vertex list is completed, and then determine whether the landscaping vertex list is "empty",

[0099] If so, it is determined that the construction of the association relationship for the landscaping vertex list is successful;

[0100] If not, it will prompt that the automatic landscaping of the landscaping area has failed.

[0101] It should be noted here that after the association relationship of each landscaping vertex in the landscaping vertex list is successfully constructed, it will be filtered out from the list. If the association relationship is not successfully constructed, it will be retained in the list. After completing the attempted construction of the association relationship of all the landscaping vertices in the list, if the landscaping vertex list is non-empty, it means that the template shape diagram matched in step L1 with the landscaping shape diagram has the greatest similarity, and the shape similarity of the two is not enough to directly migrate the landscaping scheme associated with the template shape diagram to the landscaping area. The system should abandon the subsequent process of automatically landscaping the landscaping area with the landscaping scheme associated with the template shape diagram. Therefore, through steps L211-L213, it is realized to verify whether the template shape diagram matched in step L1 is suitable as the basis for landscaping the landscaping area, thereby reducing the error rate of automatic landscaping by the machine.

[0102] In step L2, the shrinkage relationship or expansion relationship calculated for each landscaping vertex and the template vertex associated therewith includes: the straight-line migration distance and migration direction required to migrate the landscaping vertex to the template vertex. For example, Figure 2 , set the landscape vertex Migrate to Template Vertex The contraction relationship includes Figure 2 The distance shown in and Indicates the migration direction.

[0103] Through step L2, after completing the marking of the inward-contracting vertices and outward-expanding vertices in the landscaping shape diagram, the marking of the inward-contracting area and outward-expanding area of ​​the complement area, and the calculation of the inward-contracting relationship and outward-expanding relationship between the landscaping vertex and the template vertex, as shown in FIG. Figure 1 As shown, the landscaping method based on landscaping feature migration provided in this embodiment enters the steps:

[0104] L3, divide the intersection area of ​​the template shape map and the landscape shape map after maximum similarity matching into several sub-areas, and obtain the three-dimensional coordinates of each template landscape point in each sub-area on the template shape map, merge the inward contraction relationship or outward expansion relationship bound to the sub-area to which it belongs into a fused coordinate, perform low-dimensional processing, and then migrate it to the landscape shape map;

[0105] Step L3 specifically includes the following steps:

[0106] A1, identify the center point of the template shape graph and the center point of each edge, and directly connect each center point with the center point to divide the intersection area into several sub-areas; the method for identifying the center point of the template shape graph and the center point of each edge adopts the existing algorithm and is not explained in detail;

[0107] A2, obtaining the inward contraction relationship or outward expansion relationship bound to the landscape vertex associated with the template vertex in the sub-region, and then fusing it with the three-dimensional coordinates of each template landscape point in the sub-region into a fused coordinate and performing low-dimensional processing before migrating it into the landscape shape map;

[0108] For example, for Figure 2 The template vertices in the sub-region 300 in , get the Landscape vertices with associated relationships The bound inward contraction relationship is then fused with the three-dimensional coordinates of each template landscape point in the sub-region 300 to form a fused coordinate and is transferred to the landscaping shape diagram 10 after low-dimensional processing.

[0109] The method of fusion into fusion coordinates is:

[0110] From the inward or outward relationship of the associated landscape vertices, the linear migration distance and migration direction required to migrate the landscape vertex to the associated template vertex are analyzed. The migration direction constructs an xy axis coordinate system with the template vertex as the origin to represent the migration distance. The straight line and the horizontal line are Figure 2 The angle in express;

[0111] For each template landscape point in the sub-area associated with the indentation relationship, Angular expansion migration distance The three-dimensional coordinates after are the fusion coordinates. For example, Figure 2 The sub-area 300 in the associated indentation relationship (landscape vertex and the template vertex on the sub-region 300 ), then for each template landscape point in the sub-area 300 ,by Construct the xy axis coordinate system as the origin, and then use Angle is the migration direction, Migration distance Later expanded to Place.

[0112] For each template landscape point in the sub-area of ​​the associated outward expansion relationship, Angular inward migration distance The three-dimensional coordinates after are the fusion coordinates. For example, Figure 2 The sub-area 400 in the associated expansion relationship (landscape vertex and the template vertex on the sub-region 400 ), then for each template landscape point in the sub-area 400 ,by Construct the xy axis coordinate system as the origin, and then use Angle is the migration direction, Migration distance After shrinking to Place.

[0113] Through steps A1-A2, the migration positions of each template landscape point in the template shape map having the greatest similarity to the landscape shape map are accurately found in a fine-grained manner, so that the migrated template landscape points have a better spatial position layout in the landscape area.

[0114] In step L3, the method for low-dimensional processing of the fused coordinates is:

[0115] The elevation values ​​of the template landscape points identified in the fused coordinates are processed in a low-dimensional manner, and the processing method is as follows: the coordinate values ​​of the coordinate axes representing the elevation values ​​in the fused coordinates of the template landscape points to be migrated to the landscaping shape map are the same;

[0116] For example, suppose Figure 2 The template landscape point in the sub-area 400 The three-dimensional coordinates in real space are , Indicates the elevation value of the landscape point of the template. For example, when the landscape type is rockery, the height of the highest point of the rockery from the ground is taken as the elevation data of the rockery. They respectively represent the horizontal axis coordinate value and the vertical axis coordinate value of the position of the rockery in the historical landscaping area corresponding to the template shape diagram. For example, with the center point of the historical landscaping area as the origin of the plane coordinate system, the horizontal axis coordinate value and the vertical axis coordinate value of the rockery in the plane coordinate system.

[0117] Template landscape point The three-dimensional coordinates in the computer's virtual space are , and There is a coordinate mapping relationship between the real space and the virtual space, and this mapping relationship is constructed by existing methods. For example, , The horizontal axis coordinate value representing the origin of the three-dimensional coordinate system in the virtual space, It is the scaling factor of the template shape area in real space and virtual space. and The mapping relationship construction principle is the same as and The principle of constructing the mapping relationship will not be elaborated on here.

[0118] The fusion coordinates obtained after migration are assumed to be: Similarly, assuming Figure 2 The template landscape point in the sub-area 400 The fusion coordinates are: , then for the template landscape point , The low-dimensional processing method is: let the , The coordinate values ​​of are the same, such as , The coordinate value of is "0".

[0119] Alternatively, the coordinate values ​​of two different types of coordinate axes in the fused coordinates are processed in a low-dimensional manner, and the processing method is: the number of coordinate values ​​having axis correspondence and the same coordinate value in the fused coordinates of each template landscape point to be migrated to the landscaping shape map is two.

[0120] For example, in the above example, and The values ​​are the same and and The same value, or and The values ​​are the same and , The same value as and The values ​​are the same and , The values ​​are the same.

[0121] There are many existing methods for low-dimensional assignment. You only need to load the corresponding low-dimensionality algorithm in the system, and then call these low-dimensionality algorithms and perform reverse calculations when performing high-dimensionality processing in step L4 to restore the original values ​​of the low-dimensionalized coordinate values.

[0122] In this embodiment, each fusion coordinate is processed in a low-dimensional manner, so that in the process of automatically landscaping a large number of landscaping areas at the same time, the amount of landscaping data processing is greatly reduced. In addition, after completing the migration of each template landscape point through step L3, the system can obtain a three-dimensional space model of the landscaping area by high-dimensional processing of the landscaping shape diagram that has completed the migration according to the instructions of the designer and actual needs, and does not construct a three-dimensional space model of the landscaping area for all landscaping shape diagrams that have completed the migration through low-dimensional processing, while reducing the problem of model construction errors or failures that are easily caused by excessive consumption of computing resources due to the construction of three-dimensional space models for a large number of landscaping shape diagrams at the same time.

[0123] Through step L3, after the low-dimensional processing of the template shape graph with the maximum similarity is completed and transferred to the landscape shape graph, as shown in FIG. Figure 1 As shown, the landscaping method based on landscaping feature migration provided in this embodiment enters the steps:

[0124] L4, according to the instruction, each template landscape point migrated to the landscaping shape map is subjected to high-dimensional processing to obtain a three-dimensional space model of the landscaping area carrying the inward contraction area and / or the outward expansion area mark, as well as the real space coordinates of each template landscape point in the landscaping area.

[0125] Specifically, step L4 includes the steps of:

[0126] B1, for each fused coordinate that has been transferred to the sub-region after low-dimensional processing, find a reference coordinate point for high-dimensional processing, where the reference coordinate point is: the landscaping vertex that has been transferred to the sub-region;

[0127] For example, Figure 2 For the template landscape points that have been migrated to the sub-region 400 after low-dimensional processing, The fusion coordinates , find the reference coordinate point for high-dimensional processing, which is: migrate to the landscape vertex of sub-area 400 .

[0128] B2, according to the mapping relationship between the found reference coordinate point and the real reference coordinate point of the reference coordinate point in the landscaping real space, calculate the real coordinate of each fused coordinate in the sub-area in the landscaping real space;

[0129] For example, Figure 2 The landscape vertex as the reference coordinate point of each template landscape point in the sub-area 400 and The real reference coordinate points in the real space of the landscape The mapping relationship of the horizontal axis coordinate value is:

[0130]

[0131] and The mapping relationship between the vertical axis coordinate values ​​and the z-axis coordinate values ​​is the same as the mapping relationship between the horizontal axis coordinate values, which will not be repeated here.

[0132] Through the above mapping relationship, the real coordinate value of each fusion coordinate in the virtual space in the real space of the landscaping can be obtained.

[0133] B3, high-dimensional processing is performed on each template landscape point migrated to the landscaping shape map to obtain a three-dimensional space model of the landscaping area carrying the inward contraction area and / or the outward expansion area mark, and the real coordinates of each template landscape point in the real space are marked in the model.

[0134] The three-dimensional spatial model of the landscaping area carries the marks of the shrinking area and / or the expanding area obtained by the step L2. Subsequently, the designer can focus on these areas for artificial landscaping design or make targeted adjustments to the landscaping plan issued by the machine.

[0135] In summary, in the landscaping method based on landscaping feature migration provided by the present invention, the designer only needs to input the landscaping shape diagram of the landscaping area, and the system will automatically construct the feature data of the landscaping area, and automatically match the template shape diagram with the maximum feature similarity from the solution library, and then calculate the indentation or outward expansion relationship between the landscaping vertices in the landscaping shape diagram and the template vertices in the template shape diagram that have an associated relationship with it, and calculate the fusion coordinates of each template landscape point in each sub-area in the intersection area of ​​the template shape diagram and the landscaping shape diagram after migration to the landscaping area, thereby realizing the system's automatic adjustment of the position of the template landscape point migrated to the landscaping area; by performing low-dimensional processing on the fusion coordinates, the amount of data when the system simultaneously processes a large number of landscaping requirements is reduced, thereby improving the landscaping speed; the high-dimensional processing uses the landscaping vertices of the sub-area as a reconstruction reference, and makes secondary fine-tuning on the layout of the template landscape points to the landscaping area, so that the layout of the template landscape points in the landscaping area is more reasonable.

[0136] It should be noted that the above specific implementations are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art should understand that various modifications, equivalent substitutions, changes, etc. can be made to the present invention. However, as long as these changes do not deviate from the spirit of the present invention, they should be within the scope of protection of the present invention. In addition, some terms used in the specification and claims of this application are not restrictive, but are only for the convenience of description.

Claims

1. A landscaping method based on landscaping feature migration, characterized in that the steps include: L1, based on the vertex array features, matches the template shape graph with the greatest similarity to the landscaping area shape from the sample library; L2, identifying the complementary area of ​​the template shape image and the landscaping shape image with the maximum similarity, marking the landscaping vertices in the landscaping shape image as inward vertices or outward vertices and synchronously marking the complementary area as inward vertices or outward vertices, and then calculating the inward contraction relationship or outward expansion relationship between each landscaping vertex and the template vertex associated with it in the template shape image; L3, dividing the intersection area of ​​the template shape map and the landscaping shape map after maximum similarity matching into a plurality of sub-areas, and obtaining the three-dimensional coordinates of each template landscape point in each sub-area on the template shape map, merging the inward contraction relationship or the outward expansion relationship bound to the sub-area to which it belongs into fused coordinates, performing low-dimensional processing, and then migrating them to the landscaping shape map; L4, according to the instruction, high-dimensional processing is performed on each of the template landscape points migrated to the landscape shape diagram to obtain a three-dimensional space model of the landscape area carrying a shrinking area and / or an expanding area mark, and the real space coordinates of each of the template landscape points in the landscape area are marked in the model; Step L1 specifically includes the following steps: L11, arbitrarily select at least one vertex in the landscaping shape graph enclosing the landscaping area as a reference vertex for similarity matching, and construct a feature array of each reference vertex, expressed as: , is a first basis angle formed by the basis vertex and a straight line connecting two adjacent basis vertices; A second basis angle formed by a first adjacent basis vertex adjacent to the basis vertex and a straight line connecting two adjacent basis vertices; A third basis angle formed by a second adjacent basis vertex adjacent to the basis vertex and a straight line connecting the two adjacent basis vertices; In step L2, the shrinking relationship or the expanding relationship calculated for the landscaping vertex having the association relationship includes: a straight-line migration distance and a migration direction required to migrate the landscaping vertex to the template vertex; The method of merging into the fusion coordinates is: From the inward contraction relationship or the outward expansion relationship bound to the landscape vertex having the association relationship, the linear migration distance required to migrate the landscape vertex to the template vertex is parsed and migration direction, wherein the migration direction constructs an xy axis coordinate system with the template vertex as the origin, representing the migration distance The angle between the straight line and the horizontal line express; For each template landscape point in the sub-area associated with the indentation relationship, Angular expansion migration distance The three-dimensional coordinates of the latter are the fusion coordinates; For each template landscape point in the sub-area associated with the outward expansion relationship, Angular inward migration distance The three-dimensional coordinates at which the fusion coordinates are located are the fusion coordinates.

2. The landscaping method based on landscaping feature migration according to claim 1, characterized in that: After step L1 is completed, continue to execute step L11: L12, selecting from the sample library each of the template shape graphs having array feature similarity with each of the base vertices in the landscaping shape graph; L13, for each of the template shape graphs screened in step L12, after aligning any vertex combination with array feature similarity, rotate the template shape graph with the alignment point as the fulcrum to find the critical point where the overlapping area of ​​the template shape graph and the landscape shape graph changes from increasing to decreasing, and use the maximum area intersection and union ratio of the template shape graph and the landscape shape graph calculated at each critical point as the similarity between the template shape graph and the landscape shape graph.

3. The landscaping method based on landscaping feature migration according to claim 2, characterized in that: In step L12, array feature similarity The calculation method is: The feature array of the template vertices in the template shape graph is recorded as: , is the first template angle formed by the template vertex and the straight line connecting two adjacent template vertices; A second template angle formed by a first adjacent template vertex adjacent to the template vertex and a straight line connecting two adjacent template vertices; A third template angle formed by a second adjacent template vertex adjacent to the template vertex and a straight line connecting the two adjacent template vertices; is the weight, .

4. The landscaping method based on landscaping feature migration according to claim 2, characterized in that: In step L11, the relationship between the number of the selected basis vertices and the number of edges enclosed by the landscaping shape diagram is: the number of edges of the landscaping shape diagram is equal to twice the number of the selected basis vertices plus 1.

5. The landscaping method based on landscaping feature migration according to claim 2, characterized in that: In step L2, the method for constructing the association relationship between each of the landscaping vertices in the landscaping shape graph and the template vertex in the template shape graph with the maximum similarity comprises the steps of: L211, sequentially acquiring each of the landscaping vertices in the enclosing path whose basis vertex is used as the rotation fulcrum for shape similarity matching in step L1 and is the starting vertex for enclosing the landscaping shape graph, and arranging them in the acquisition order to form a landscaping vertex list; At the same time, each of the template vertices in the enclosing path with the template vertex also serving as the rotation fulcrum as the starting vertex for enclosing the template shape graph is obtained in the same order, and arranged in the order of acquisition to form a template vertex list; L212, obtaining the feature array of the first landscape vertex in the landscape vertex list, and then matching the template vertex with the maximum array feature similarity to the feature array from the template vertex list in the order in which the template vertices are obtained, and constructing the serial number pair of the successfully matched landscape vertex and the template vertex as the association relationship between the two, and filtering out the landscape vertex and the template vertex whose association relationship construction is completed from the list; L213, repeating step L212 until the attempt to build the association relationship of all the landscaping vertices in the landscaping vertex list is completed, and then determining whether the landscaping vertex list is "empty", If so, it is determined that the association relationship is successfully constructed for the landscaping vertex list; If not, it will prompt that the automatic landscaping of the landscaping area has failed.

6. The landscaping method based on landscaping feature migration according to claim 1, characterized in that: In step L2, according to the identified complementary area, the method for marking each of the landscaping vertices in the landscaping shape diagram as an inward-contracting vertex or an outward-contracting vertex is: Determine whether the template vertices enclosing the complement area fall into the landscaping shape diagram; if so, mark the landscaping vertices having the association relationship with the template vertices as the inward-retracting vertices and mark the complement area as the inward-retracting area; otherwise, mark them as the outward-expanding vertices and mark the complement area as the outward-expanding area.

7. The landscaping method based on landscaping feature migration according to claim 1, characterized in that: Step L3 specifically includes the following steps: A1, identifying the center point of the template shape graph and the center point of each edge, and directly connecting each center point with the center point to divide the intersection area into a plurality of sub-areas; A2, obtaining the inward contraction relationship or the outward expansion relationship bound to the landscaping vertex having the associated relationship with the template vertex in the sub-area, merging the three-dimensional coordinates of each template landscape point in the sub-area into the fused coordinates, performing low-dimensional processing, and then migrating to the landscaping shape map.

8. The landscaping method based on landscaping feature migration according to claim 1 or 7, characterized in that: The method for low-dimensional processing of the fused coordinates is: The elevation values ​​representing the template landscape points in the fused coordinates are subjected to low-dimensional processing, wherein the coordinate values ​​of the coordinate axes representing the elevation values ​​in the fused coordinates of the template landscape points to be migrated to the landscaping shape map are the same; Alternatively, the coordinate values ​​of two different types of coordinate axes in the fused coordinates are subjected to low-dimensional processing, and the processing method is: the number of coordinate values ​​having axis correspondence and the same coordinate value in the fused coordinates of each template landscape point to be migrated to the landscaping shape diagram is two.

9. The landscaping method based on landscaping feature migration according to claim 8, characterized in that: Step L4 specifically includes the following steps: B1, according to the instruction, for each of the fused coordinates that have been low-dimensionalized and migrated to the sub-region, find a reference coordinate point for high-dimensionalization processing, the reference coordinate point being: the landscaping vertex that has been migrated to the sub-region; B2, calculating the real coordinates of each of the fused coordinates in the sub-region in the real space of landscaping according to the mapping relationship between the reference coordinate point found and the real reference coordinate point of the reference coordinate point in the real space of landscaping; B3, performing high-dimensional processing on each of the template landscape points migrated to the landscaping shape map to obtain a three-dimensional space model of the landscaping area carrying a shrinking area and / or an expanding area mark, and marking the real coordinates of each of the template landscape points in the real space in the model.

Images