Method for dividing and searching spherical area in virtual scene
By establishing a two-way mapping relationship between the sphere and the cube surface and mesh generation, the problems of uniformity and computational efficiency in spherical region partitioning are solved, achieving efficient and uniform spherical region partitioning and searching, and overcoming the problems of extreme distortion and boundary discontinuity.
Patent Information
- Application Number
- CN202511638175.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-11-10
- Publication Date
- 2026-02-17
AI Technical Summary
Existing methods for partitioning spherical regions are insufficient in terms of uniformity and computational efficiency. They are prone to distortion and computational complexity in extreme regions, making it difficult to meet the requirements for efficient and uniform partitioning.
By establishing a two-way mapping relationship between spherical coordinates and cube face coordinates, the cube face is divided into N×N grids, and the spherical region is determined through two-way mapping. Random noise perturbation and normalization processing are used to improve the uniformity of the division and the search efficiency.
This method achieves uniform subdivision of the spherical region, significantly improving the uniformity of the subdivision, reducing computational overhead, and ensuring the continuity of the region and the efficiency of the search, while avoiding the boundary discontinuity problem in traditional methods.
Smart Images
Figure CN121544834A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of computer graphics technology, and in particular to a method for dividing and searching spherical regions in a virtual scene. Background Technology
[0002] Spherical region division refers to the technique of dividing the surface of a sphere into multiple continuous regions according to specific rules. This technique has wide applications in fields such as computer graphics, physical simulation, geographic information systems, and game development.
[0003] For example, when constructing a large 3D planet scene, the planet's surface needs to be divided into plates to generate continents and oceans; when simulating the effect of a sphere breaking, the crack paths of the breaking also need to be predefined. All of these rely on efficient and uniform spherical region division algorithms.
[0004] Currently, common methods for dividing spherical regions include latitude and longitude partitioning, regular polyhedron partitioning, and cube partitioning. Latitude and longitude partitioning uses meridians and parallels to form a grid, a simple and intuitive method. However, it produces severe sampling distortion at the poles of the sphere, resulting in huge differences in area and failing to meet uniformity requirements. Regular polyhedron partitioning (such as based on icosahedrons) divides the sphere into multiple regions of similar area. While improving uniformity, its boundaries are often irregular, and the logic for handling adjacency relationships is complex, resulting in high computational and storage overhead. Another common approach is cube partitioning, which involves dividing the circumscribed sphere into cubes and mapping each cube unit back to the sphere. While computationally simple, this method has inherent drawbacks: first, the resulting spherical regions have vastly different areas, leading to poor uniformity; second, each cube unit has 26 neighboring units in 3D space, but only some intersect the sphere, requiring complex intersection checks when searching for actual neighboring regions, resulting in low computational efficiency. Summary of the Invention
[0005] To address the shortcomings of existing technologies, the purpose of this application is to provide a method for dividing and searching spherical regions in a virtual scene, thereby improving the uniformity of spherical region division and search efficiency.
[0006] To achieve the above objectives, this application provides a method for dividing and searching spherical regions in a virtual scene, including: In response to the division of the target sphere into regions, a bidirectional mapping relationship is established between spherical coordinates and cube face coordinates, wherein the cube face coordinates include face index and two-dimensional coordinates on the face; Divide each face of the cube into N×N grids, where N is an integer not less than 1, and each grid corresponds to a region on the sphere. For a target point on the sphere, its corresponding cube face coordinates are determined according to the bidirectional mapping relationship, and then the grid to which it belongs is determined according to the cube face coordinates, thus completing the regional division of the target sphere.
[0007] Furthermore, the specific steps for establishing the bidirectional mapping relationship between spherical coordinates and cube surface coordinates include: The corresponding face index is determined based on the axis containing the maximum absolute value among the three coordinate values in spherical coordinates; Calculate the first and second radian values corresponding to the spherical coordinates based on the axis corresponding to the face index; The first and second radian values are linearly transformed to the [0,1] interval to obtain the two-dimensional coordinates.
[0008] Furthermore, the specific steps for calculating the first and second radian values corresponding to the spherical coordinates based on the axis corresponding to the face index include: If the axis corresponding to the face index is the X-axis, the following formula is used for calculation: u1 = atan(y / |x|), v1 = atan(z / |x|); If the axis corresponding to the face index is the Y-axis, the following formula is used for calculation: u1 = atan(x / |y|), v1 = atan(z / |y|); If the axis corresponding to the face index is the Z-axis, the following formula is used for calculation: u1 = atan(x / |z|), v1 = atan(y / |z|); Where u1 is the first radian value, v1 is the second radian value, x, y, z are the coordinates of the spherical coordinates on the X-axis, Y-axis and Z-axis respectively, u1∈[-π / 2,π / 2], v1∈[-π / 2,π / 2].
[0009] Furthermore, the specific steps for linearly transforming the first and second radian values to the [0,1] interval to obtain the two-dimensional coordinates are as follows: , ; Where u1 is the first radian value, v1 is the second radian value, u2 is the coordinate value of u1 in the two-dimensional coordinate system, and v2 is the coordinate value of v1 in the two-dimensional coordinate system.
[0010] Furthermore, the specific steps for establishing the bidirectional mapping relationship between spherical coordinates and cube surface coordinates also include: Transform the two-dimensional coordinates on the face of the cube into the first radian value and the second radian value; The weighting factor is calculated using the following formula: ; Based on the weighting factor, the first radian value and the second radian value are corrected; Based on the axes corresponding to the face indices of the cube, the weighting factor, the first radian value, and the second radian value are converted into spherical coordinate values.
[0011] Furthermore, the method also includes: Random noise perturbation is applied to the spherical coordinates, and the perturbed coordinates are then normalized.
[0012] Furthermore, the method also includes: In response to finding the neighboring regions of the target region on the sphere, the cube face coordinates corresponding to the target region are determined, and the neighborhood is expanded in multiple directions around it to obtain the cube face coordinates of the neighboring regions. Based on the cube-shaped coordinates of adjacent regions and the two-way mapping relationship, the adjacent regions of the target region on the sphere are determined.
[0013] Furthermore, the plurality of directions refers to eight directions.
[0014] To achieve the above objectives, the electronic device provided in this application includes: processor; A memory having stored thereon one or more computer program instructions that run on the processor; When the processor executes the computer instructions, it performs the method for dividing and searching the spherical region in the virtual scene as described above.
[0015] To achieve the above objectives, the present application provides a computer-readable storage medium storing computer instructions that, when executed by a processor, perform the steps of the method for dividing and searching spherical regions in a virtual scene as described above.
[0016] This application discloses a method for dividing and finding spherical regions in a virtual scene. The method maps the sphere onto the six faces of a cube and then subdivides it uniformly, making the areas generated on the sphere more similar. This fundamentally overcomes the problem of uneven sampling, lays a solid foundation for subsequent accurate calculation and analysis, significantly improves the uniformity of the division, and effectively avoids extreme distortion.
[0017] This application presents a method for dividing and searching spherical regions in a virtual scene, which is efficient and convenient for finding adjacent regions and significantly reduces computational overhead.
[0018] This application presents a method for dividing and searching spherical regions in a virtual scene, which ensures that the divided regions are a continuous whole on the sphere and does not have the boundary discontinuity or gap problems commonly found in traditional polyhedral division, making it simpler and more reliable to perform logical processing such as path search and region spread.
[0019] Other features and advantages of this application will be set forth in the following description, and will be apparent in part from the description, or may be learned by practicing this application. Attached Figure Description
[0020] The accompanying drawings are provided to further illustrate the present application and form part of the specification. Together with the embodiments of the present application, they serve to explain the present application but do not constitute a limitation thereof. In the drawings: Figure 1 This is a flowchart illustrating the method for dividing and searching spherical regions in the virtual scene of this application; Figure 2 This is a schematic diagram illustrating the division of the spherical region. Figure 3 This is a schematic diagram illustrating the division of the spherical region after adding noise perturbation. Detailed Implementation
[0021] Embodiments of this application will now be described in more detail with reference to the accompanying drawings. While some embodiments of this application are shown in the drawings, it should be understood that this application can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this application. It should be understood that the drawings and embodiments of this application are for illustrative purposes only and are not intended to limit the scope of protection of this application.
[0022] It should be understood that the steps described in the method embodiments of this application may be performed in different orders and / or in parallel. Furthermore, the method embodiments may include additional steps and / or omit the steps shown. The scope of this application is not limited in this respect.
[0023] The term "comprising" and its variations as used herein are open-ended inclusions, meaning "including but not limited to". The term "based on" means "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Definitions of other terms will be given in the description below.
[0024] It should be noted that the terms "one" and "multiple" used in this application are illustrative rather than restrictive, and those skilled in the art should understand that, unless explicitly stated otherwise in the context, they should be understood as "one or more". "Multiple" should be understood as two or more.
[0025] The embodiments of this application will now be described in detail with reference to the accompanying drawings.
[0026] Example 1 One embodiment of this application provides a method for dividing and searching spherical regions in a virtual scene. Figure 1 This is a flowchart illustrating a method for dividing and searching spherical regions in a virtual scene according to this application. The following will refer to... Figure 1 This application provides a detailed description of a method for dividing and searching spherical regions in a virtual scene, including: Step S101: In response to the division of the target sphere into regions, a bidirectional mapping relationship is established between the spherical coordinates and the cube face coordinates, wherein the cube face coordinates include the face index and the two-dimensional coordinates on the face.
[0027] The embodiments of this application, taking the division of the spherical surface of a simulated planet in a game as an example, will be used to describe the technical solution of this application in detail.
[0028] In the embodiments of this application, assuming the radius of the simulated planet is R, the spherical coordinates of the simulated planet are a three-dimensional vector Sphere(x, y, z), where, .
[0029] In the embodiments of this application, the cube face coordinates can be represented as Cube(a, u2, v2), where a is a face index used to represent the corresponding axis face, specifically including positive X-axis, negative X-axis, positive Y-axis, negative Y-axis, positive Z-axis, and negative Z-axis, and u2 and v2 are two-dimensional coordinates on the cube face.
[0030] In this embodiment of the application, the mapping method from spherical coordinates to cube coordinates is as follows: The corresponding face index is determined based on the axis containing the maximum absolute value among the three coordinate values in spherical coordinates; Calculate the absolute values of x, y, and z, and find the maximum value among |x|, |y|, and |z|. The maximum value determines which axis the point is located on. If it is positive, the point is on the positive axis; if it is negative, the point is on the negative axis. This determines which plane of the six axes the point is on. If |x| is the largest, the point is on the X-axis plane, and the sign of x determines whether it is on the positive or negative X-axis. If |y| is the largest, the point is on the Y-axis plane, and the sign of y determines whether it is on the positive or negative Y-axis. If |z| is the largest, the point is on the Z-axis plane, and the sign of z determines whether it is on the positive or negative Z-axis.
[0031] Calculate the first and second radian values corresponding to the spherical coordinates based on the axis corresponding to the face index; Then, calculate the first radian value and the second radian value: If the axis corresponding to the face index is the X-axis, the following formula is used for calculation: u1 = atan(y / |x|), v1 = atan(z / |x|); If the axis corresponding to the face index is the Y-axis, the following formula is used for calculation: u1 = atan(x / |y|), v1 = atan(z / |y|); If the axis corresponding to the face index is the Z-axis, the following formula is used for calculation: u1 = atan(x / |z|), v1 = atan(y / |z|); Where u1 is the first radian value, v1 is the second radian value, x, y, z are the coordinates of the spherical coordinates on the X-axis, Y-axis and Z-axis respectively, u1∈[-π / 2,π / 2], v1∈[-π / 2,π / 2].
[0032] The first and second radian values are linearly transformed to the [0,1] interval to obtain the two-dimensional coordinates, using the following formula: , ; Where u1 is the first radian value, v1 is the second radian value, u2 is the coordinate value of u1 in the two-dimensional coordinate system, and v2 is the coordinate value of v1 in the two-dimensional coordinate system.
[0033] In this embodiment, the mapping method from cube surface coordinates to spherical coordinates is as follows: Transform the two-dimensional coordinates on the face of the cube into the first radian value and the second radian value; ; ; The weighting factor w, used to scale the tangential component to a unit sphere, is calculated as follows: ; Based on the weighting factor, the first radian value and the second radian value are corrected; Specifically, ; ; Based on the axes corresponding to the face indices of the cube, the weighting factor, the first radian value, and the second radian value are converted into spherical coordinate values.
[0034] Finally, based on the different axes a, w, u, and v are assigned to x, y, and z to obtain the points on the sphere: If a is the positive X-axis: ; If a is the negative X-axis: ; If a is the positive Y-axis: ; If a is the negative Y-axis: ; If a is the positive Z-axis: ; If a is the negative Z-axis: ; Step S102: Divide each face of the cube into N×N grids, where N is an integer not less than 1, and each grid corresponds to a region on the sphere; In this embodiment of the application, each face of the cube can be regarded as a large region. The sphere is divided into 6 regions, each region corresponding to a square face. Then, according to the required number of regions, each face is divided into N times N equal parts, that is, the sphere can be divided into 6 times N times N regions.
[0035] Step S103: For a target point on the sphere, determine its corresponding cube face coordinates according to the bidirectional mapping relationship, and then determine the grid to which it belongs according to the cube face coordinates to complete the region division of the target sphere; Furthermore, based on the two-way mapping relationship, by determining the grid to which the target point on the sphere belongs on the cube, the region to which it belongs can be determined, thus completing the region division.
[0036] For example, such as Figure 2 As shown, Figure 2 This is a schematic diagram illustrating the division of the spherical region.
[0037] In other embodiments, random noise perturbation is applied to the spherical coordinates, and the perturbed coordinates are normalized to give the divided regions a certain degree of randomness. For example, such as... Figure 3 As shown, Figure 3 This is a schematic diagram illustrating the division of the spherical region after adding noise perturbation.
[0038] In this embodiment of the application, if you want to find the neighboring regions of the target region on the sphere, you can expand the neighborhood in multiple directions around the target region by using the cube face coordinates corresponding to the target region to obtain the cube face coordinates of the neighboring regions, and then determine the neighboring regions of the target region on the sphere.
[0039] In this embodiment of the application, each ordinary area has 8 adjacent areas, and the area located at the corner of the square has 7 adjacent areas.
[0040] Example 2 In this embodiment, an electronic device is also provided, including a processor and a memory. The memory is used to store non-transitory computer-readable instructions. The processor is used to execute the non-transitory computer-readable instructions, which, when executed by the processor, can perform one or more steps of the method for dividing and searching spherical regions in the virtual scene described above. The memory and the processor can be interconnected via a bus system and / or other forms of connection mechanisms.
[0041] For example, the processor can be a central processing unit (CPU), a digital signal processor (DSP), or other processing units with data processing and / or program execution capabilities, such as a field-programmable gate array (FPGA); for example, the central processing unit (CPU) can be an x86 or ARM architecture.
[0042] For example, the memory may include any combination of one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and / or cache memory. Non-volatile memory may include, for example, read-only memory (ROM), hard disk, erasable programmable read-only memory (EPROM), portable compact disc read-only memory (CD-ROM), USB storage, flash memory, etc. One or more computer program modules may be stored on the computer-readable storage medium, and the processor may run one or more computer program modules to implement various functions of the electronic device. Various application programs and various data, as well as various data used and / or generated by the application programs, may also be stored in the computer-readable storage medium.
[0043] It should be noted that, in the embodiments of this application, the specific functions and technical effects of the electronic devices can be referred to the description above of a method for dividing and searching spherical regions in a virtual scene, and will not be repeated here.
[0044] Example 3 In this embodiment, a computer-readable storage medium is also provided for storing non-transitory computer-readable instructions. For example, when the non-transitory computer-readable instructions are executed by a computer, one or more steps in the method for dividing and searching spherical regions in the virtual scene described above can be performed.
[0045] For example, this storage medium can be used in the aforementioned electronic device. For example, the storage medium can be the memory in the electronic device of Embodiment 2. For example, relevant descriptions of the storage medium can be found in the corresponding description of the memory in the electronic device of Embodiment 2, and will not be repeated here.
[0046] It should be noted that the storage medium (computer-readable medium) mentioned above in this application may be a computer-readable signal medium or a non-transitory computer-readable storage medium, or any combination of the two. A non-transitory computer-readable storage medium may be, for example,, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a non-transitory computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof.
[0047] In this application, a non-transitory computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can also be any computer-readable medium other than a non-transitory computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination thereof.
[0048] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device.
[0049] Computer program code for performing the operations of this application can be written in one or more programming languages or a combination thereof. These programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, and C++, as well as conventional procedural programming languages such as C or similar languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server.
[0050] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0051] The units described in the embodiments of this application can be implemented in software or hardware. The names of the units are not, in some cases, limiting the scope of the unit itself.
[0052] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), etc.
[0053] The above description is merely a partial embodiment of this application and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of disclosure in this application is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described concept. For example, technical solutions formed by substituting the above features with (but not limited to) technical features with similar functions disclosed in this application.
[0054] Furthermore, while the operations are described in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or in sequential order. Multitasking and parallel processing may be advantageous in certain environments. Similarly, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of this application. Certain features described in the context of individual embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented individually or in any suitable sub-combination in multiple embodiments.
[0055] Although the subject matter has been described using language specific to structural features and / or methodological logic, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. Rather, the specific features and actions described above are merely illustrative examples of implementing the claims.
Claims
1. A method for dividing and searching spherical regions in a virtual scene, characterized in that, The method comprises the following steps: In response to the division of the region of the target sphere, a bidirectional mapping relationship between the spherical coordinate and the cube face coordinate is established, the cube face coordinate comprising a face index and a two-dimensional coordinate on the face; Each face of the cube is divided into N×N grids, N being an integer not less than 1, each grid corresponding to a region on the sphere; For a target point on the sphere, the corresponding cube face coordinate is determined according to the bidirectional mapping relationship, and then the grid to which the target point belongs is determined according to the cube face coordinate, thereby completing the division of the region of the target sphere.
2. The method of claim 1, wherein, The specific steps of establishing the bidirectional mapping relationship between the spherical coordinate and the cube face coordinate comprise: Based on the maximum value in the absolute values of the three coordinate values of the spherical coordinate, the face index corresponding to the axis is determined; According to the axis corresponding to the face index, the first radian value and the second radian value corresponding to the spherical coordinate are calculated; The first radian value and the second radian value are linearly transformed to the interval [0, 1] to obtain the two-dimensional coordinate. 3.The method of claim 2, wherein, The specific steps of calculating the first radian value and the second radian value corresponding to the spherical coordinate according to the axis corresponding to the face index comprise: If the axis corresponding to the face index is the X axis, the following formula is used for calculation: u1 = atan(y / |x|), v1= atan(z / |x|); If the axis corresponding to the face index is the Y axis, the following formula is used for calculation: u1= atan(x / |y|), v1= atan(z / |y|); If the axis corresponding to the face index is the Z axis, the following formula is used for calculation: u1= atan(x / |z|), v1 = atan(y / |z|); Wherein, u1 is the first radian value, v1 is the second radian value, x, y, z are the coordinate values of the spherical coordinate on the X axis, Y axis and Z axis respectively, u1∈[-π / 2,π / 2], v1∈[-π / 2,π / 2].
4. The method of claim 2, wherein, The specific steps of linearly transforming the first radian value and the second radian value to the interval [0, 1] to obtain the two-dimensional coordinate use the following formula: ， ； Wherein, u1 is the first radian value, v1 is the second radian value, u2 is the coordinate value corresponding to the two-dimensional coordinate of u1, v2 is the coordinate value corresponding to the two-dimensional coordinate of v1.
5. The method of claim 1, wherein, The specific steps of establishing the bidirectional mapping relationship between the spherical coordinate and the cube face coordinate further comprise: The two-dimensional coordinate on the face of the cube is inversely transformed into the first radian value and the second radian value; A weight factor is calculated, and the formula is as follows: ； Based on the weight factor, the first radian value and the second radian value are corrected; According to the axis corresponding to the face index of the cube, the weight factor, the first radian value and the second radian value are converted into the spherical coordinate value.
6. The method of claim 1, wherein, The method further comprises: Random noise disturbance is applied to the spherical coordinate, and the disturbed coordinate is normalized.
7. The method of claim 1, wherein, The method further comprises: In response to finding the adjacent region of the target region on the sphere, the cube face coordinate corresponding to the target region is determined, and the neighborhood is expanded in multiple directions around the cube face coordinate, thereby obtaining the cube face coordinate of the adjacent region; Based on the cube face coordinate of the adjacent region and the bidirectional mapping relationship, the adjacent region of the target region on the sphere is determined.
8. The method of claim 7, wherein, The plurality of directions are 8 directions.
9. An electronic device, comprising: Comprise: A processor; A memory having one or more computer program instructions stored thereon for running on the processor; Wherein, the processor executes the computer program instructions, executes the method for dividing and searching the spherical region in the virtual scene according to any one of claims 1-8.
10. A computer-readable storage medium, characterized in that, A computer program product, comprising a computer readable storage medium having stored thereon computer instructions that, when executed at the processor, cause the processor to carry out the steps of the method for dividing and searching the spherical region in the virtual scene according to any one of claims 1-8.