Commercial space layout method based on centroid Voronoi diagram

Abstract

The invention discloses a business space layout method based on a centroid Voronoi diagram. The business space layout method comprises the following steps: step 1, determining boundaries of business space layout and dividing the boundaries into a plurality of levels; 2, randomly generating an initial seed point of a first level at the boundary of the commercial space, and optimizing the initial seed point; taking the boundary of the commercial space and the optimized seed point of the first hierarchy as the input of a centroid Voronoi diagram, dividing to obtain a plurality of regions of the first hierarchy, and obtaining a passable path in the first hierarchy and a refined and adjusted region; and step 3, for the Nth hierarchy, generating an initial seed according to the boundary of each region in the (N-1) th hierarchy, performing optimization, performing division based on the rectangular centroid Voronoi diagram to obtain a plurality of regions of the Nth hierarchy, and obtaining a passable path in the Nth hierarchy and a refined and adjusted region. The method is simple, easy to deploy in a computer, high in automation degree and high in controllability and flexibility.

Description

Technical Field

[0001] The present invention relates to the technical field of layout floor plan generation, and specifically to a commercial space layout method based on the centroid Voronoi diagram. Background Art

[0002] Layout design is one of the most common tasks in the field of computer graphics and is widely used in fields such as computer games, virtual reality, and animated movies. Effective spatial layout not only affects the visual effect but also has a significant impact on the user experience. In commercial building design, a well-designed commercial environment can significantly improve customers' ability to identify products and navigate, significantly improve the shopping experience, and extend customers' stay time. In addition, commercial space design must also consider fire safety and evacuation requirements to ensure safe and effective evacuation in case of an emergency. Therefore, the computational layout design for commercial spaces has important research value and practical significance.

[0003] Although there has been a lot of research on residential layout, the automated design of commercial space layout has not received enough attention. This neglect can be attributed to several challenges: scale and complexity, commercial spaces are usually large in scale and complex in design, different from relatively rigid residential layouts; boundary handling, existing methods perform well in dealing with boundaries composed of horizontal and vertical line segments, but when faced with more complex boundaries, such as boundaries involving inclined edges, complex additional constraint conditions often need to be designed; path adjustment, traditional methods usually rely on path construction to adjust spatial units and lack simple and direct control methods. Therefore, the existing commercial space layout methods have problems such as difficult boundary handling, inconvenient path adjustment, and low layout efficiency. Summary of the Invention

[0004] The present invention provides a commercial space layout method based on the centroid Voronoi diagram to solve the problems of difficult boundary handling, inconvenient path adjustment, and low layout efficiency existing in the existing commercial space layout methods.

[0005] To achieve the above object, the technical solution adopted by the present invention is as follows: A commercial space layout method based on the centroid Voronoi diagram, comprising the following steps: Step 1, determine the polygonal boundary of the commercial space layout and divide the commercial space into multiple levels; Step 2, randomly generate initial points inside the boundary of the commercial space obtained in Step 1 as the initial seed points of the first level; Next, using the boundary of the commercial space obtained in Step 1 and the random seed points of the first level as the input of the general centroid Voronoi diagram, the region corresponding to each optimized seed point of the first level is calculated through the centroid Voronoi diagram, and multiple regions of the first level are thus divided; Then, using the boundary of the commercial space obtained in Step 1 and the multiple regions of the first level obtained by division as the input of the centroid Voronoi diagram, according to the reachable paths of the first level and the connection requirements between regions, the multiple regions generated in the first level are adjusted and refined to obtain the passable paths and the refined and adjusted regions in the first level; Step 3: For the Nth level, where N > 1, initial points are randomly generated inside the boundary of each region in the (N - 1)th level as the initial seed points of the Nth level, and the positions of the initial seed points of the Nth level are optimized to obtain the optimized seed points of the Nth level; when optimizing the seed points, the general centroid Voronoi diagram used in the first level is replaced with a rectangular centroid Voronoi diagram.

[0006] Next, using the boundary of each region in the (N - 1)th level and the initial seed points of the Nth level as the input of the rectangular centroid Voronoi diagram, the region corresponding to each optimized seed point of the Nth level is calculated through the rectangular centroid Voronoi diagram, and multiple regions of the Nth level are thus divided; Then, using the boundary of each region in the (N - 1)th level and the multiple regions of the Nth level obtained by division as the input of the rectangular centroid Voronoi diagram, according to the reachable paths of the Nth level and the connection requirements between regions, the multiple regions generated in the Nth level are adjusted and refined to obtain the passable paths and the refined and adjusted regions in the Nth level, thereby realizing the division of regions in all levels of the commercial space and completing the layout of the commercial space.

[0007] Further, in Steps 2 and 3, a centroid optimization algorithm is used to adjust the positions of each initial seed point to obtain the optimized seed points.

[0008] Further, in Steps 2 and 3, when adjusting and refining the multiple regions generated in each level, different operations are performed according to the different levels. If the current level is a non-final level, the boundary is contracted to create passable paths; if the current level is the final level, the gaps are merged into adjacent regions, and paths are created to connect unreachable regions.

[0009] Further, it further includes Step 4: Adding additional facilities to each region of each level obtained, thereby obtaining the final layout of the commercial space.

[0010] Compared with the prior art, the advantages of the present invention are as follows: According to the boundaries of the given commercial space layout, the present invention can quickly and efficiently generate a commercial space layout division plan automatically, and has the advantage of convenient path adjustment, effectively assisting the designer in the creation and design process, reducing the designer's workload, and improving the layout efficiency and user experience.

[0011] The method of the present invention is simple, easy to be deployed on a computer, with a high degree of automation, high controllability and flexibility. The designer can adjust and optimize the generated layout division according to the specific requirements of the actual project, so that it can perfectly meet the diverse design requirements of different commercial spaces. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 is the working flow chart of the present invention.

[0013] Figure 2 is the technical solution diagram of the area division with boundary alignment.

[0014] Figure 3 is the technical solution diagram of the layout adjustment. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0015] The present invention will be further described below with reference to the drawings and embodiments.

[0016] As Figure 1 shown, this embodiment discloses a commercial space layout method based on the centroid Voronoi diagram, including the following steps: Step 1: Determine the polygonal boundary of the commercial space layout, and divide the commercial space into multiple levels. In this embodiment, the commercial space is divided into three levels. Subsequently, the area division is carried out separately in each level, and multiple areas of the next level are generated based on the boundary division of the previous level.

[0017] Step 2: Randomly generate initial points inside the boundary of the commercial space obtained in Step 1 as the initial seed points of the first level. Each seed point corresponds to the area divided in the subsequent first level and has a specific type to correspond to the different functions of the corresponding area. The association between the seed point and the area can provide controllability for the layout division.

[0018] Then, taking the boundary of the commercial space obtained in Step 1 and the random seed points of the first level as the input of the general centroid Voronoi diagram, the area corresponding to each optimized seed point of the first level is calculated through the centroid Voronoi diagram, and multiple areas of the first level are thus divided; Then, using the boundary of the commercial space obtained in Step 1 and the multiple regions at the first level obtained by division as the input of the centroid Voronoi diagram, adjust and refine the multiple regions generated at the first level according to the reachable paths at the first level and the connection requirements between regions, so as to obtain the passable paths and the refined and adjusted regions at the first level; Step 3: For the Nth level, where N > 1, randomly generate initial points inside the boundary of each region in the (N - 1)th level as the initial seed points for the Nth level, and use the centroid optimization algorithm to optimize the positions of the initial seed points for the Nth level to obtain the optimized seed points for the Nth level.

[0019] Next, using the boundary of each region in the (N - 1)th level and the initial seed points for the Nth level as the input of the rectangular centroid Voronoi diagram, calculate the regions corresponding to each optimized seed point for the Nth level through the rectangular centroid Voronoi diagram, and thus divide to obtain multiple regions for the Nth level; Then, using the boundary of each region in the (N - 1)th level and the multiple regions for the Nth level obtained by division as the input of the rectangular centroid Voronoi diagram, adjust and refine the multiple regions generated for the Nth level according to the reachable paths at the Nth level and the connection requirements between regions, so as to obtain the passable paths and the refined and adjusted regions at the Nth level, thereby realizing the division of regions for all levels in the commercial space and completing the layout of the commercial space. Through such continuous iterative operations, it is possible to continuously make more refined adjustments and improvements to the regional division of each level, and thus achieve the layout design goal of multiple levels that meets the actual requirements.

[0020] When optimizing the seed points through the centroid optimization algorithm, different centroid Voronoi diagrams are selected according to the level. In the first level, the space to be divided is large, and the user is less affected by the shape and direction of the region, so a general centroid Voronoi diagram is used for regional division; in subsequent levels, the rectangular centroid Voronoi diagram (RCVT) is used for regional division to limit the shape of the region.

[0021] The Voronoi diagram is a method of spatial partitioning. Its basic idea is to divide space into several regions, each region being defined by a specific seed point. The Rectangular Voronoi Diagram (RVD) is a type of Voronoi diagram that places a restriction on the shape of the regions, making each region rectangular. The Centroid Voronoi Diagram (CVT) is a variant of the Voronoi diagram, characterized in that the seed point corresponding to each region coincides with the centroid of that region. Different from the traditional Voronoi diagram, each region of the CVT not only considers the position of the centroid but also optimizes the size of the region to minimize the weighted distance from the points within the region to the centroid. The CVT can effectively divide space into multiple uniform regions to meet different functional requirements. Through a reasonable regional layout, customers can more easily find the products they need. The design of the CVT can be adjusted according to actual needs to adapt to various business models and spatial layouts. The Rectangular Centroid Voronoi Diagram (RCVT) is a special method within the CVT. In general, the CVT has no requirements for the shape of the regions, while the RCVT combines the Rectangular Voronoi Diagram (RVD) with the general Centroid Voronoi Diagram (CVT) to place a restriction on the shape of the regional division to form a regional division suitable for building layouts. Therefore, in this embodiment, the Rectangular Centroid Voronoi Diagram (RCVT) is used to divide the regions of each level.

[0022] When using the Rectangular Centroid Voronoi Diagram for regional division, first perform a certain number of iterative optimizations using the general Centroid Voronoi Diagram to reduce the occurrence of narrow and long regions. Then use the boundaries of the (N - 1)th level and the optimized seed points of the Nth level as the input for the boundary-aligned Rectangular Voronoi Diagram and perform iterative optimization. In each iteration, the boundaries of the regions are represented as polygons, calculate the centroid of each polygon, and reposition the corresponding optimized seed point to that centroid. Then calculate a new regional division by using the updated seed points in the Rectangular Voronoi Diagram (RVD).

[0023] During the process of dividing regions by the Rectangular Centroid Voronoi Diagram, the specific steps of using the boundary-aligned Rectangular Voronoi Diagram are as Figure 2As shown, the boundary and the optimized seed points at the current level are used as the input of the rectangular Voronoi diagram (RVD). The direction of the longest side of the boundary is calculated through the rectangular Voronoi diagram as the main direction of the boundary. The coordinate system is rotated to keep the main direction of the boundary horizontal. The boundary containing the hypotenuse is fitted with horizontal or vertical continuous line segments. The area constrained by the boundary is calculated through the rectangular Voronoi diagram, and the part of the area exceeding the boundary is cropped and restored to its original direction. Finally, these areas are used as the multiple areas obtained by dividing each level.

[0024] In Steps 2 and 3 of this embodiment, when adjusting and refining the multiple areas generated at each level, different operations are performed according to different levels. If the current level is a non-final level, such as the first level and the second level of this embodiment, the boundary is contracted to create a passable path; if the current level is the final level, such as the third level of this embodiment, the voids are merged into adjacent areas, and paths are created to connect the inaccessible areas. This step ensures the fluidity between the areas and facilitates the movement of customers in the commercial space.

[0025] Specifically, as Figure 3 shown, after the space is divided by the rectangular centroid Voronoi diagram, the obtained areas need to be adjusted to form the actual layout. The following two adjustment strategies are adopted: For non-final levels (the first level and the second level), the voids between the areas are designated as public areas accessible to pedestrians. The boundary of each area is regarded as an accessible path, and the boundary is contracted inward by a fixed width to create a passable path. This method ensures the effective utilization of the space area and maintains the accessibility of pedestrians throughout the layout. At the last level, the detected voids are subdivided into smaller rectangles. These subdivided rectangles are traversed and integrated into adjacent areas to minimize the difference between the convex hull area and the actual area of the merged areas. For inaccessible areas, new paths connecting to the existing accessible paths are created to ensure that each area is accessible to pedestrians.

[0026] Step 4: Add additional facilities including escalators and rest areas to each area at each level obtained, thereby obtaining the final layout of the commercial space. The design of these facilities should consider the convenience and comfort of users to ensure the overall functionality and attractiveness of the commercial space.

[0027] The preferred embodiments of the present invention have been described in detail above in conjunction with the accompanying drawings. The embodiments described in the present invention are only descriptions of the preferred embodiments of the present invention, and do not limit the concept and scope of the present invention. Among the various specific technical features described in the above specific embodiments, they can be combined in any suitable manner without contradiction. As long as such a combination does not violate the idea of the present invention, it should also be regarded as the content disclosed in this disclosure. To avoid unnecessary repetition, the present invention will not separately describe various possible combination methods.

[0028] The present invention is not limited to the specific details in the above embodiments. Without departing from the technical concept of the present invention and under the premise of not deviating from the design idea of the present invention, various modifications and improvements made by those skilled in the art to the technical solutions of the present invention should fall within the protection scope of the present invention. The technical content claimed by the present invention has been fully recorded in the claims.

Claims

1. A commercial space layout method based on centroid Voronoi diagram, characterized in that: The following steps are involved: Step 1: Determine the polygonal boundary of the commercial space layout and divide the commercial space into multiple levels; Step 2: Randomly generate an initial point inside the boundary of the commercial space obtained in step 1 as the initial seed point of the first level; Next, the boundary of the commercial space obtained in step 1 and the random seed points of the first level are used as the input of the general centroid Voronoi diagram. The area corresponding to the seed point is calculated based on each optimized seed point of the first level through the centroid Voronoi diagram, thereby dividing multiple areas of the first level; Then, the boundary of the commercial space obtained in step 1 and the multiple areas of the first level obtained by division are used as the input of the centroid Voronoi diagram, and the multiple areas generated in the first level are adjusted and refined according to the reachable paths of the first level and the connection requirements between the areas, so as to obtain the passable paths in the first level and the refined and adjusted areas; Step 3, for the Nth level, N>1, randomly generate an initial point inside the boundary of each area in the N-1th level as the initial seed point of the Nth level, optimize the position of the initial seed point of the Nth level to obtain the optimized seed point of the Nth level; when optimizing the seed point, replace the general centroid Voronoi diagram used in the first level with a rectangular centroid Voronoi diagram; Next, the boundary of each region in the N-1th level and the initial seed point of the Nth level are used as the input of the rectangular centroid Voronoi diagram. The region corresponding to the seed point is calculated based on each optimized seed point of the Nth level through the rectangular centroid Voronoi diagram, thereby dividing multiple regions of the Nth level; Then, the boundaries of each area in the N-1th level and the multiple areas of the Nth level obtained by division are used as the input of the rectangular centroid Voronoi diagram. According to the reachable paths of the Nth level and the connection requirements between areas, the multiple areas generated by the Nth level are adjusted and refined to obtain the passable paths and refined and adjusted areas in the Nth level, thereby realizing the regional division of all levels in the commercial space and completing the commercial space layout.

2. The commercial space layout method based on centroid Voronoi diagram according to claim 1, characterized in that: In steps 2 and 3, the centroid optimization algorithm is used to adjust the position of each initial seed point to obtain the optimized seed point.

3. The commercial space layout method based on centroid Voronoi diagram according to claim 1, characterized in that: In steps 2 and 3, when adjusting and refining the multiple areas generated at each level, different operations are performed according to the different levels. If the current level is not the final level, the boundary is shrunk to create a passable path; If the current level is at the final level, the gaps are merged into adjacent areas and paths are created to connect unreachable areas.

4. The commercial space layout method based on centroid Voronoi diagram according to claim 1, characterized in that: The method also includes step 4: adding additional facilities to each area of ​​each level, thereby obtaining the final layout of the commercial space.

Images