A business space layout method based on centroid voronoi diagram

Abstract

The application discloses a business space layout method based on a centroid Voronoi diagram, comprising the following steps: step 1, determining the boundary of the business space layout and dividing it into multiple levels; step 2, randomly generating initial seed points of the first level in the boundary of the business space and optimizing them; taking the boundary of the business space and the optimized seed points of the first level as inputs of the centroid Voronoi diagram, dividing multiple regions of the first level, and obtaining passable paths in the first level and the regions after refinement adjustment; step 3, for the Nth level, generating initial seeds from the boundary of each region in the (N-1)th level and optimizing them, dividing multiple regions of the Nth level based on the rectangular centroid Voronoi diagram, and obtaining passable paths in the Nth level and the regions after refinement adjustment. The method is simple, easy to deploy on a computer, highly automated, and has high controllability and flexibility.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of layout plan generation, and particularly relates to a commercial space layout method based on centroid Voronoi diagram. BACKGROUND

[0002] Layout design is one of the most common tasks in computer graphics, and is widely used in computer games, virtual reality and animated movies. Effective space layout not only affects the visual effect, but also has a significant impact on user experience. In commercial building design, a well-designed commercial environment can significantly improve customers' ability to identify and navigate products, significantly improve shopping experience, and prolong customers' stay time. In addition, commercial space design must also consider fire safety and evacuation requirements to ensure safety and effective evacuation in emergency situations. Therefore, the computational layout design for commercial space 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 been given enough attention. This neglect can be attributed to several challenges: scale and complexity, commercial space is usually large in scale and complex in design, unlike the relatively rigid residential layout; boundary processing, existing methods perform well when dealing with boundaries composed of horizontal and vertical line segments, but when facing more complex boundaries, such as boundaries involving inclined edges, complex additional constraints often need to be designed; path adjustment, traditional methods usually rely on path construction to adjust space units, and lack simple and direct control methods. Therefore, the existing technical commercial space layout method has the problems of difficult boundary processing, inconvenient path adjustment and low layout efficiency. SUMMARY

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

[0005] In order to achieve the above purpose, the technical scheme adopted by the present application is:

[0006] A commercial space layout method based on centroid Voronoi diagram, comprising the following steps:

[0007] Step 1, determining the polygon boundary of the commercial space layout, and dividing the commercial space into multiple levels;

[0008] Step 2, randomly generating an initial point inside the boundary of the commercial space obtained in step 1 as the initial seed point of the first level;

[0009] Next, taking the boundary of the commercial space obtained in step 1 and the first level random seed point as the input of the general centroid Voronoi diagram, the region corresponding to each optimized seed point of the first level is calculated based on the first level by the centroid Voronoi diagram, thereby dividing the first level into multiple regions;

[0010] Then, taking the boundary of the commercial space obtained in step 1 and the multiple regions of the first level divided, as the input of the centroid Voronoi diagram, the multiple regions generated in the first level are adjusted and refined according to the reachable path of the first level and the connection requirement between regions, to obtain the passable path in the first level and the region after adjustment and refinement.

[0011] Step 3, for the Nth level, N>1, randomly generate initial points inside the boundary of each region in the (N-1)th level as initial seed points of the Nth level, and optimize the positions of the initial seed points of the Nth level to obtain optimized seed points of the Nth level; when optimizing the seed points, replace the general centroid Voronoi diagram used in the first level with a rectangular centroid Voronoi diagram.

[0012] Next, taking 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 based on the Nth level by the rectangular centroid Voronoi diagram, thereby dividing the Nth level into multiple regions.

[0013] Then, taking the boundary of each region in the (N-1)th level and the multiple regions of the Nth level divided as the input of the rectangular centroid Voronoi diagram, the multiple regions generated in the Nth level are adjusted and refined according to the reachable path of the Nth level and the connection requirement between regions, to obtain the passable path in the Nth level and the region after adjustment and refinement, thereby realizing the region division of all levels in the commercial space and completing the layout of the commercial space.

[0014] Further, in steps 2 and 3, the position of each initial seed point is adjusted by using a centroid optimization algorithm to obtain an optimized seed point.

[0015] Further, in steps 2 and 3, when the multiple regions generated in each level are adjusted and refined, different operations are performed according to different levels. If the current level is a non-final level, the boundary is shrunk to create a passable path; if the current level is a final level, the gap is merged into an adjacent region, and a path is created to connect the unreachable regions.

[0016] Further, it further comprises step 4: adding additional facilities to each region of each level respectively, thereby obtaining the final layout of the commercial space.

[0017] Compared with the prior art, the present application has the following advantages:

[0018] According to the boundary of the commercial space layout of a given room, the present application can quickly and efficiently generate a commercial space layout division scheme, has the advantage of convenient path adjustment, effectively assists the work of designers in the creation and design process, reduces the work burden of designers, and improves the layout efficiency and user experience.

[0019] The method of the present application is simple, easy to deploy on a computer, has high automation, high controllability and flexibility, and designers can adjust and optimize the generated layout division according to the specific needs of actual projects, so that it can perfectly meet the diversified design requirements of different commercial spaces. BRIEF DESCRIPTION OF DRAWINGS

[0020] Figure 1 The workflow diagram of the present application.

[0021] Figure 2 The technical scheme diagram of boundary-aligned region division.

[0022] Figure 3 The technical scheme diagram of layout adjustment. DETAILED DESCRIPTION

[0023] The present application will be further described below in conjunction with the drawings and examples.

[0024] As shown in the drawings, the present embodiment discloses a commercial space layout method based on centroid Voronoi diagram, comprising the following steps: Figure 1 Step 1, determine the polygon boundary of the commercial space layout, and divide the commercial space into multiple levels. In the present embodiment, the commercial space is divided into three levels, and the division of regions in each level is carried out subsequently, and the boundary of the previous level is used to divide the multiple regions of the next level.

[0025] Step 2, randomly generate initial points inside the boundary of the commercial space obtained in step 1 as initial seed points of the first level, each seed point corresponds to a region to be divided in the first level subsequently, and has a specific type to correspond to the different functions of the corresponding region, and the association of the seed point and the region can provide controllability for the layout division.

[0026]

[0027] ​Next, taking the boundary of the commercial space obtained in step 1 and the random seed points of the first level as inputs of the general centroid Voronoi diagram, the region corresponding to each optimized seed point of the first level is calculated based on the centroid Voronoi diagram, thereby dividing the plurality of regions of the first level;

[0028] Then, taking the boundary of the commercial space obtained in step 1 and the plurality of regions of the first level obtained by division as inputs of the centroid Voronoi diagram, the plurality of regions generated in the first level are adjusted and refined according to the reachable paths of the first level and the connection requirements between regions, so as to obtain the passable paths in the first level and the regions after adjustment and refinement.

[0029] Step 3, for the Nth level, N>1, randomly generating initial points inside the boundary of each region in the (N-1)th level as initial seed points of the Nth level, and using the centroid optimization algorithm to optimize the positions of the initial seed points of the Nth level to obtain the optimized seed points of the Nth level.

[0030] Next, taking the boundary of each region in the (N-1)th level and the initial seed points of the Nth level as inputs of the rectangular centroid Voronoi diagram, the region corresponding to each optimized seed point of the Nth level is calculated based on the rectangular centroid Voronoi diagram, thereby dividing the plurality of regions of the Nth level.

[0031] Then, taking the boundary of each region in the (N-1)th level and the plurality of regions of the Nth level obtained by division as inputs of the rectangular centroid Voronoi diagram, the plurality of regions generated in the Nth level are adjusted and refined according to the reachable paths of the Nth level and the connection requirements between regions, so as to obtain the passable paths in the Nth level and the regions after adjustment and refinement, thereby realizing the division of regions of all levels in the commercial space and completing the layout of the commercial space. Through such continuous iteration, the region division of each level can be continuously adjusted and improved more finely, and the multi-level layout design goal meeting the actual requirements can be achieved.

[0032] When optimizing the seed points by the centroid optimization algorithm, different centroid Voronoi diagrams are selected according to different levels. 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 the general centroid Voronoi diagram is used for region division; in the subsequent levels, the rectangular centroid Voronoi diagram (RCVT) is used for region division to limit the shape of the region.

[0033] A Voronoi diagram is a method of spatial partitioning, the basic idea of which is to divide space into regions, each of which is defined by a specific seed point. Rectangular Voronoi diagram (RVD) is a kind of Voronoi diagram, which limits the shape of each region to be rectangular. Centroidal Voronoi diagram (CVT) is a variant of Voronoi diagram, which is characterized by each region corresponding to a seed point that coincides with the seed point of the region. Unlike traditional Voronoi diagrams, CVT not only considers the position of the centroid, but also optimizes the size of the region to minimize the weighted distance from the centroid to the points within the region. CVT can effectively divide the space into multiple uniform regions to meet different functional requirements. Through reasonable regional layout, customers can more easily find the products they need. The design of CVT can be adjusted according to actual needs to adapt to various business models and space layouts. Rectangular Centroidal Voronoi Diagram (RCVT) is a special method in CVT, which generally does not require the shape of the region, while RCVT combines rectangular Voronoi diagram (RVD) with general centroidal Voronoi diagram (CVT) to limit the shape of the region division to form a region division suitable for building layout, so this embodiment uses rectangular centroidal Voronoi diagram (RCVT) to divide the regions of each level.

[0034] When using rectangular centroidal Voronoi diagram for region division, first use the general centroidal Voronoi diagram to perform a certain number of iterations of optimization to reduce the occurrence of narrow regions. Then use the boundary of the N-1 level and the optimized seed points of the N level as the input of the boundary-aligned rectangular Voronoi diagram, and perform iterative optimization. In each iteration, the boundary of each region is represented as a polygon, the centroid of each polygon is calculated, and the corresponding optimized seed point is repositioned to the centroid. Then a new region division is calculated by using the updated seed points in the rectangular Voronoi diagram (RVD).

[0035] In the process of region division by rectangular centroidal Voronoi diagram, the specific steps of using boundary-aligned rectangular Voronoi diagram are as follows Figure 2As shown, the boundary and the optimized seed points of the current level are taken as the input of the rectangular Voronoi diagram (RVD), the direction of the longest side of the boundary is calculated as the main direction of the boundary by the rectangular Voronoi diagram, the coordinate system is rotated to keep the main direction of the boundary horizontal, the boundary containing the diagonal side is fitted by horizontal or vertical continuous line segments, the region constrained by the boundary is calculated by the rectangular Voronoi diagram, the part of the region beyond the boundary is cut off, and the original direction is restored. Finally, these regions are taken as the multiple regions obtained by dividing each level.

[0036] In steps 2 and 3 of the embodiment, when the multiple regions generated in each level are adjusted and refined, different operations are performed according to different levels. If the current level is in a non-final level, such as the first level and the second level of the embodiment, the boundary is shrunk to create a passable path. If the current level is in a final level, such as the third level of the embodiment, the gap is merged into the adjacent region, and a path is created to connect the unreachable region. This step ensures the flow between regions, facilitating the movement of customers in the commercial space.

[0037] Specifically, as shown in Figure 3 After the space is divided by the rectangular centroid Voronoi diagram, the obtained regions 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 gap between regions is designated as a public area accessible to pedestrians. The boundary of each region is considered as an accessible path, and the boundary is shrunk inward by a fixed width to create a passable path. This method ensures efficient space area utilization and maintains the accessibility of pedestrians throughout the layout. In the last level, the detected gap is subdivided into smaller rectangles. These subdivided rectangles are traversed and integrated into adjacent regions to minimize the difference between the convex hull area of the merged region and its actual area. For inaccessible regions, new paths connected to existing accessible paths are created to ensure that each region is accessible to pedestrians.

[0038] In step 4, additional facilities including escalators and rest areas are added to each region of 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 appeal of the commercial space.

[0039] The preferred embodiments of the present application are described in detail above with reference to the accompanying drawings, and the embodiments described in the present application are merely a description of the preferred embodiments of the present application, and are not intended to limit the concept and scope of the present application. In the above specific embodiments, various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction, and such combination should also be considered as disclosed by the present disclosure, as long as it does not deviate from the concept of the present application. In order to avoid unnecessary repetition, the present application will not further describe various possible combinations.

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

Claims

1. A commercial space layout method based on centroid Voronoi diagrams, characterized in that, Includes the following steps: Step 1: Determine the polygonal boundaries 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 for 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 input to the general centroid Voronoi diagram. The region corresponding to each seed point is calculated based on each optimized seed point of the first level through the centroid Voronoi diagram, thereby dividing the first level into multiple regions. Then, using the boundaries of the commercial space obtained in step 1 and the multiple regions of the first level as input to the centroid Voronoi diagram, the multiple regions generated in the first level are adjusted and refined according to the reachable paths in the first level and the connection requirements between regions, so as to obtain the passable paths in the first level and the refined and adjusted regions. Step 3: For the Nth level, N>1, randomly generate initial points inside the boundary of each region in the (N-1)th level as the initial seed points of the Nth level. Optimize the position of the initial seed points of the Nth level to obtain the optimized seed points of the Nth level. When optimizing the seed points, 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-1)th level and the initial seed point of the Nth level are used as inputs to the rectangular centroid Voronoi diagram. The region corresponding to each seed point is calculated based on each optimized seed point in the Nth level through the rectangular centroid Voronoi diagram, thereby dividing the Nth level into multiple regions. Then, using the boundaries of each region in the (N-1)th level and the multiple regions of the Nth level obtained from the division as input to the rectangular centroid Voronoi diagram, the multiple regions generated in the Nth level are adjusted and refined according to the reachable paths in the Nth level and the connection requirements between regions, so as to obtain the passable paths in the Nth level and the refined and adjusted regions, thereby realizing the division of regions in all levels of the commercial space and completing the layout of the commercial space.

2. The commercial spatial 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. A commercial spatial layout method based on a centroid Voronoi diagram according to claim 1, characterized in that, In steps 2 and 3, when adjusting and refining multiple regions generated at each level, different operations are performed depending on the level. If the current level is not the final level, the boundary is shrunk to create a passable path. If the current level is the final level, gaps are merged into adjacent areas, and paths are created to connect unreachable areas.

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

Images