A method for optimizing and integrating urban texture units based on set operation

Abstract

The present application aims at the problems of massive texture unit combination mode, low artificial screening efficiency and strong subjectivity in urban renewal, and proposes a city texture unit optimization integration method based on set operation, an electronic device and a storage medium. The method steps are: obtaining the spatial data of N texture units in the target area and numbering, and constructing a basic database; calculating the number of all two combinations, selecting the texture units from Z, merging according to the rules, and generating a new texture unit set ZB; based on the area, entrance position, space quality and other indicators, the ZB is weighted and quantified, and the optimal scheme is output according to the scoring order. The present application converts the texture combination into mathematical set operation, so that the massive combination can be calculated, the automatic processing and objective quantitative evaluation are realized, the modern functional requirements are met while inheriting the city historical texture, and it is suitable for historical block renewal and other scenes.

Description

Technical Field

[0001] This invention relates to the field of urban planning technology, and in particular to a method for optimizing and integrating urban fabric units based on set operations, which is applicable to the intelligent reorganization of courtyard units in the renewal of historical districts. Background Technology

[0002] With the acceleration of urbanization, urban renewal has become an important approach to sustainable development. As a spatial structure formed over a long period of time, urban fabric carries historical and cultural memories. For example, the unique fabrics of Beijing's hutongs and courtyards, and the streets and alleys of Jiangnan water towns, constitute the cultural identity of a city.

[0003] In urban renewal, on the one hand, it is essential to maintain the continuity of courtyards as basic structural units, preserving the city's historical and cultural heritage; on the other hand, it is necessary to explore different combinations of courtyard units and delineate new courtyard ownership boundaries to meet the needs of new functions in terms of area, entrance, and spatial quality. However, due to the sheer number of courtyards in cities, the possible combinations are astronomical. Relying on manual judgment and screening of these combinations is not only incredibly labor-intensive but also extremely inefficient. For example, a medium-sized urban renewal project may involve hundreds of courtyard units, with the number of possible combinations far exceeding the capacity of human intervention. Moreover, manual judgment is susceptible to subjective factors, making accuracy difficult to guarantee. Therefore, there is an urgent need for a method that utilizes computer technology to quickly identify and accurately judge massive combinations, thereby promoting the scientific and efficient implementation of urban renewal projects. Summary of the Invention

[0004] To address the problems existing in the background technology, this invention proposes a method for optimizing and integrating urban fabric units based on set operations.

[0005] To achieve the above objectives, the technical solution adopted by the present invention is as follows: A method for optimizing and integrating urban fabric units based on set operations includes: S1. Obtain the spatial data of N texture units within the target area, and assign each texture unit a number J1, J2, ..., Jm, Jn... in sequence, where m and n are natural numbers. Construct a basic database, where Jm = (p, q...), where p, q... are spatial data parameters. S2. Calculate the number of all pairwise combinations. By analyzing vector graphics, we select texture unit combinations with intersecting boundaries to form a set Z = {Z1, Z2, ..., Zi}, where Zi = {m, n}, m and n are the numbers of texture units with intersecting boundaries, and i is a natural number. S3. Select several elements from set Z to form a texture combination scheme ZA. Based on ZA, merge according to the array merging rules to generate a new texture unit set ZB={ZB1, ZB2, ..., ZBm}, where ZBm=(p, q...) represents the m-th new texture unit in set ZB. S4. Calculate the data indicators of each new texture unit ZBm in the set ZB, and quantify and score the set ZB based on the preset evaluation indicators. S5. Sort all the combined solutions generated by the subsets by score and output the optimal solution.

[0006] Furthermore, each texture unit includes information such as area, length, width, and entry position when it is numbered.

[0007] Furthermore, the vector graphics are calculated for each texture unit using a vector graphics processing algorithm.

[0008] Furthermore, the array merging rules of S3 include: For any two arrays in ZA, if there is overlap between them, the overlapping data is merged into one and the two arrays are integrated into a new array; If the data in an array does not overlap with any other array, then the original array is retained. After the above processing, the merged array and the original unmerged array together form the final combination scheme ZB.

[0009] Furthermore, the quantitative scoring of S4 includes: Calculate the weighted score S_i for each ZBm index, and the total score of the ZB set is S=ΣS_i.

[0010] On the other hand, this application also provides an electronic device including a processor and a memory, the memory storing a computer program that, when executed by the processor, implements the methods described above.

[0011] On the other hand, this application also provides a computer-readable storage medium storing program code that implements any of the methods described above.

[0012] Compared with the prior art, the present invention has the following beneficial effects: This application transforms the graphical problem of urban fabric combination into mathematical set operations, making massive combinations computable and realizing the automated processing and quantitative evaluation of massive combination schemes, significantly improving the efficiency of urban renewal decision-making. The objective evaluation system based on multi-dimensional indicators avoids human subjective bias and ensures the scientificity and rationality of the scheme. At the same time, it continues the historical fabric characteristics by recombining basic units, effectively inheriting the urban cultural context while meeting modern functional needs, and has broad planning applicability. Attached Figure Description

[0013] Figure 1 A flowchart illustrating a method for optimizing and integrating urban fabric units based on set operations, provided in an embodiment of the present invention; Figure 2 This is a structural block diagram of a terminal for an urban fabric unit optimization and integration method based on set operations, provided in an embodiment of the present invention. Detailed Implementation

[0014] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0015] Figure 1 This is a flowchart of a method for optimizing and integrating urban fabric units based on set operations, according to an embodiment of this application, including the following steps: S1 Data Acquisition and Input: Acquire spatial data of N texture units within the target area, and assign each texture unit a number J1, J2, ..., Jm, Jn... in sequence, where m and n are natural numbers. Construct a basic database, where Jm = (p, q...), where p, q... are spatial data parameters; First, clearly define the target urban area and collect information on urban fabric units within that area using various methods. For areas where courtyards are the fabric units, precise dimensions and area data of courtyards can be obtained through on-site surveying. Geolocation technology can be used to determine the latitude and longitude coordinates of the entrance, and detailed information such as the shape of the courtyard and its surrounding environment can be recorded. For example, when conducting urban renewal planning for a historical district, a professional surveying team can be organized to conduct on-site measurements of every courtyard within the district, recording the length, width, area, and the location and distance of the entrance relative to the main street of the district.

[0016] The collected information is then digitized and entered into a computer system to form a basic database containing N texture units. Each texture unit corresponds to an independent data record in the database, containing its detailed data indicators, such as area (square meters), length (meters), width (meters), and entrance location (latitude and longitude coordinates or relative coordinates), providing raw data support for subsequent combined analysis.

[0017] To facilitate the computer's execution of subsequent steps, each texture unit is assigned the number J1, J2, ..., Jm, Jn..., where m and n are natural numbers, Jm = (p, q...), and p, q... are spatial data parameters, namely the aforementioned area (square meters), length (meters), width (meters), entrance location (latitude and longitude coordinates or relative coordinates), etc.

[0018] S2 Combinatorial Possibility Analysis: Calculate the number of all pairwise combinations. By analyzing vector graphics, we select texture unit combinations with intersecting boundaries to form a set Z = {Z1, Z2, ..., Zi}, where Zi = {m, n}, m and n are the numbers of texture units with intersecting boundaries, and i is a natural number.

[0019] S21 combination method calculation: In a computer program, for N input texture units [J1, J2, ..., Jm, Jn…], the combinatorial mathematical formula is used to... =N! / (2!*(N-2)!) calculates the total number of possible pairwise combinations. For example, if N=100, then there are a total of =100*99 / 2=4950 ways to combine pairs.

[0020] S22 Intersection Boundary Judgment: Vector graphics processing algorithms are used to abstract each texture unit into a vector graphic. For each pairwise combination, the boundary relationship between the two vector graphics is analyzed to determine whether they intersect. For example, boundary detection algorithms in computer graphics are used to determine whether the boundaries of two adjacent courtyards overlap or intersect. All combinations with intersecting boundaries are filtered out and stored in a set Z = {Z1, Z2, ..., Zi}, where each element Zi = {m, n}, m and n are the numbers of the texture units with intersecting boundaries, and i is a natural number.

[0021] S3 Combination Scheme Generation: Select several elements from set Z to form a texture combination scheme ZA. Based on ZA, merge according to the array merging rules to generate a new texture unit set ZB={ZB1, ZB2, ..., ZBm}, where ZBm=(p, q...) represents the m-th new texture unit in set ZB; S31 subset selection: For a set Z, arbitrarily select 'a' elements (where 'a' is a natural number), such as Z1, Z2, ..., Za, to form a subset ZA of texture units. This subset of texture units represents a potential texture combination scheme. For example, randomly selecting 5 elements from set Z forms the combination scheme ZA = {ZA1, ZA2, ZA3, ZA4, ZA5}.

[0022] S32 array merging process: For any two arrays, if there is overlap in their data, for example, ZA1=(2,3) and ZA2=(3,9), where the number 3 overlaps, then they are merged into a new array ZB1=(2,3,9).

[0023] If multiple arrays contain pairs of overlapping indexed data, such as ZA1=(2,3), ZA2=(3,9), ZA3=(13,9), ZA4=(33,2), ZA5=(33,7), these arrays can be merged into a new array ZB1=(2,3,7,9,13,33) through loop comparison and merging operations. This can be achieved by writing nested loop code to compare elements in each array sequentially and merge overlapping elements.

[0024] If the index data of an array does not overlap with that of other arrays, then the original array is retained.

[0025] After the above processing, the merged array and the original unmerged array together form the final combination scheme ZB={ZB1, ZB2, ..., ZBm}. ZB1, ZB2, ..., ZBm in the final combination scheme ZB are then transformed into a texture unit combination scheme through the mapping relationship of texture unit numbers.

[0026] (S4) Scheme evaluation: Calculate the data indicators of each new texture unit ZBm in the set ZB, and quantify and score the set ZB based on the preset evaluation indicators; S41 New Texture Unit Index Calculation: For each new texture unit ZBm=(p, q, ...) in the combination scheme ZB, various data indicators of ZBm are calculated based on the data indicators of the original texture units it composes. For example, for the area indicator, the area of ​​ZBm is equal to the sum of the areas of the original texture units; for the entrance location indicator, if the new texture unit is composed of multiple courtyards, the location of the new main entrance can be determined according to the combination method and relevant rules, such as selecting the entrance of the courtyard located on the side with higher traffic flow as the entrance of the new texture unit.

[0027] S42 Scheme Rating and Evaluation: The combined scheme ZB is scored based on a pre-defined evaluation scheme. This evaluation scheme can be tailored to the specific needs of urban renewal, for example: Area Index: Set an optimal area range, such as 500-800 square meters for commercial office functions. If the area (ZBm) falls within this range, a higher score is given, such as 80-100 points; if the area deviates slightly from this range, a score of 60-80 points is given; if the deviation is significant, a score of 0-60 points is given.

[0028] Entrance Location Index: Scored based on the accessibility and convenience of the entrance location. A high score is given if the entrance is located next to a main road and has good surrounding transportation facilities; a low score is given if the entrance is located in a remote area with inconvenient transportation.

[0029] Space quality indicators: Scoring is based on a comprehensive consideration of factors such as lighting, ventilation, and spatial dimensions. For example, the quality of space is quantitatively evaluated by simulating indicators such as lighting duration and ventilation effectiveness. Spaces with good lighting and ventilation and appropriate spatial dimensions are given higher scores, while those with poor lighting and ventilation are given lower scores.

[0030] The scores of each texture unit ZBm are weighted and averaged to obtain the comprehensive score of ZBm. Then, the comprehensive scores of all ZBm in the combined scheme ZB are summed or calculated using other comprehensive methods to obtain the overall evaluation score of the combined scheme ZB.

[0031] (S5) Solution Optimization: Sort all combined solutions generated from all subsets by score and output the optimal solution. After evaluating all combination schemes generated through subsets, all schemes are sorted from highest to lowest according to their evaluation scores. Common sorting algorithms such as quicksort or bubble sort can be used. The top-ranked schemes are considered relatively superior, with the scheme having the highest score being the optimal urban fabric combination optimization scheme. For example, after obtaining the evaluation scores of all combination schemes, quicksort is used to rank them, and the top-ranked scheme is selected as the final urban fabric unit optimization and integration scheme, providing a scientific and reasonable decision-making basis for urban renewal projects.

[0032] According to another aspect of the embodiments of this application, a server or terminal for a method of optimizing and integrating urban fabric units based on set operations is also provided.

[0033] Figure 2 This is a structural block diagram of a terminal according to an embodiment of this application, such as... Figure 2 As shown, the terminal may include: one or more (only one is shown in the figure) processors 401, memory 403, and transmission devices 405, such as... Figure 2 As shown, the terminal may also include input / output devices 407.

[0034] The memory 403 can be used to store software programs and modules, such as the program instructions / modules corresponding to the urban fabric unit optimization and integration method based on set operations in this embodiment of the application. The processor 401 executes various functional applications and data processing by running the software programs and modules stored in the memory 403, thereby realizing the aforementioned urban fabric unit optimization and integration method based on set operations. The memory 403 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 403 may further include memory remotely located relative to the processor 401, and these remote memories can be connected to the terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0035] The aforementioned transmission device 405 is used to receive or send data via a network, and can also be used for data transfer between the processor and memory. Specific examples of the network described above may include wired networks and wireless networks. In one example, the transmission device 405 includes a Network Interface Controller (NIC), which can be connected to other network devices and a router via a network cable to communicate with the Internet or a local area network. In another example, the transmission device 405 is a radio frequency (RF) module used for wireless communication with the Internet.

[0036] Specifically, memory 403 is used to store application programs.

[0037] The processor 401 can call the application stored in the memory 403 through the transmission device 405 to execute the steps of an urban fabric unit optimization and integration method based on set operations.

[0038] Optionally, specific examples in this embodiment can refer to the examples described in the above embodiments, and will not be repeated here.

[0039] Those skilled in the art will understand that Figure 2 The structure shown is for illustrative purposes only. The terminal can be a smartphone (such as an Android phone, an iOS phone, etc.), a tablet computer, a PDA, a mobile internet device (MID), a PAD, or other terminal devices. Figure 2 This does not limit the structure of the aforementioned electronic device. For example, the terminal may also include components that are more... Figure 2 The more or fewer components shown (such as network interfaces, display devices, etc.), or having the same Figure 2 The different configurations shown.

[0040] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by a program instructing the hardware related to the terminal device. The program can be stored in a computer-readable storage medium, which may include: flash drive, read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0041] Embodiments of this application also provide a storage medium. Optionally, in this embodiment, the storage medium can be used to execute program code for a method for optimizing and integrating urban fabric units based on set operations. The storage medium can be located on at least one of a plurality of network devices in the network shown in the above embodiment. The storage medium is configured to store program code for executing steps of a method for optimizing and integrating urban fabric units based on set operations.

[0042] The aforementioned storage media may include, but are not limited to: USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, optical disks, and other media capable of storing program code.

[0043] Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing embodiments or make equivalent substitutions for some of the technical features. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for optimizing and integrating urban fabric units based on set operations, characterized in that, include: S1. Obtain the spatial data of N texture units within the target area, and assign each texture unit a number J1, J2, ..., Jm, Jn... in sequence, where m and n are natural numbers. Construct a basic database, where Jm = (p, q...), where p, q... are spatial data parameters. S2. Calculate the number of all pairwise combinations. The method involves filtering texture unit combinations with intersecting boundaries through vector graphics analysis. Specifically, it uses boundary detection algorithms in computer graphics to determine whether the boundaries of two adjacent courtyards overlap or intersect. All combinations with intersecting boundaries are then filtered out and stored as a set Z = {Z1, Z2, ..., Zi}, where each element Zi = {m, n}, m and n are the numbers of texture units with intersecting boundaries, and i is a natural number. S3. Select several elements from set Z to form a texture combination scheme ZA. Based on ZA, merge according to the array merging rules to generate a new texture unit set ZB={ZB1, ZB2, ..., ZBm}, where ZBm=(p, q...) represents the m-th new texture unit in set ZB. S4. Calculate the data indicators of each new texture unit ZBm in the set ZB, and quantify and score the set ZB based on the preset evaluation indicators. S5. Sort the set ZB generated by all texture combination schemes by score and output the optimal scheme.

2. The method for optimizing and integrating urban fabric units based on set operations according to claim 1, characterized in that, Each texture unit is numbered with information including area, length, width, and entrance location.

3. The method for optimizing and integrating urban fabric units based on set operations according to claim 1, characterized in that, The vector graphics are calculated for each texture unit using a vector graphics processing algorithm.

4. The method for optimizing and integrating urban fabric units based on set operations according to claim 1, characterized in that, The array merging rules of S3 include: For any two arrays in ZA, if there is overlap between them, the overlapping data is merged into one and the two arrays are integrated into a new array; If the data in an array does not overlap with any other array, then the original array is retained. After the above processing, the merged array and the original unmerged array together form the final combination scheme ZB.

5. The method for optimizing and integrating urban fabric units based on set operations according to claim 1, characterized in that, The quantitative scoring of S4 includes: calculating the weighted score S_i for each ZBm index, and the total score of the set ZB is S=ΣS_i.

6. An electronic device comprising a processor and a memory, characterized in that, The memory stores a computer program, which, when executed by a processor, implements the urban fabric unit optimization and integration method based on set operations as described in any one of claims 1-5.

7. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, causes the processor to perform the urban fabric unit optimization and integration method based on set operations as described in any one of claims 1-5.

Images