Ultra-high resolution projection mapping method, system and device based on GPU acceleration

By using GPU acceleration technology in graphics rendering, combining CUDA and OpenGL, using algorithms such as bounding box cropping and BVH lookup tree search, the problem of low efficiency in three-dimensional to two-dimensional graph formation is solved, and efficient and accurate image rendering effect is achieved.

CN117635412BActive Publication Date: 2024-11-26TIANHUA ARCHITECTURE DESIGN COMPANY
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202311472655.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-11-07
Publication Date
2024-11-26
Estimated Expiration
2043-11-07

AI Technical Summary

Technical Problem

In the prior art, three-dimensional to two-dimensional graphing based on IFC data is inefficient, making it difficult to meet the performance and accuracy requirements of modern computer graphics.

Method used

The ultra-large resolution projection graphing method based on GPU acceleration is adopted, combined with CUDA, OpenGL and multi-threading technology, and the data processing speed and accuracy are improved through algorithms such as bounding box cropping, blanking and BVH search tree search.

Benefits of technology

It significantly improves the data processing speed and accuracy of projected images, reduces rendering time and memory usage, and achieves efficient image rendering.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117635412B_ABST
    Figure CN117635412B_ABST
Patent Text Reader

Abstract

The present invention belongs to the field of image display, and specifically relates to a method, system and device for ultra-high resolution projection mapping based on GPU acceleration, aiming to solve the problem of low efficiency of three-dimensional to two-dimensional mapping based on IFC data in the current architectural field. The present invention includes: collecting information of the file to be mapped and visual information input by the user; adjusting the direction of the projection bounding box according to the visual information to obtain the first mode of the sight projection bounding box; based on OpenGL, Cuda and multi-threaded algorithms, eliminating all invisible triangles in the initial clipping bounding box to obtain the first mode of the clipping bounding box; enlarging and clipping the first mode of the clipping bounding box through the clipper library to obtain the second mode of the clipping bounding box; performing multi-threaded hidden calculation on the visible triangles to obtain the third mode of the clipping bounding box; performing triangle face fusion on the third mode of the clipping bounding box and the first mode of the sight projection bounding box based on the clipper library and preset fusion rules to obtain the final bounding box.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] In modern computer graphics, projection algorithm is an important imaging technology, which is widely used in various fields such as film making, game development, architectural design, etc. At present, the field of graphics rendering is developing rapidly, and the 3D graphics data is getting larger and larger. The traditional CPU calculation method often cannot meet the requirements of performance and accuracy. Therefore, a more efficient technology is needed to deal with this situation.

[0003] The present invention proposes a method for ultra-high resolution projection mapping based on GPU acceleration, which uses a combination of CUDA, OpenGL and CPU multithreading technologies, as well as a pipeline technology consisting of bounding box clipping, hidden fading, fusion and other algorithms. This method can effectively solve the efficiency problem of 3D to 2D mapping based on IFC data in the current architectural field, and can significantly improve the data processing speed and accuracy of projection mapping. Summary of the invention

[0004] In order to solve the above-mentioned problem in the prior art, that is, the problem of low efficiency of 3D to 2D mapping based on IFC data in the current architectural field, the present invention provides a super-high resolution projection mapping method based on GPU acceleration, the method comprising:

[0005] Step S100, collecting the file information to be drawn and the visual information input by the user;

[0006] Step S200, constructing an initial cropping bounding box based on the information of the image file to be generated, constructing a projection bounding box based on the initial cropping bounding box, adjusting the direction of the projection bounding box according to the visual information, and obtaining an initial sight projection bounding box; marking the mesh information in the initial sight projection bounding box that is completely not in the initial cropping bounding box as being eliminated, and obtaining a first mode of the sight projection bounding box;

[0007] The mesh information is represented by a three-dimensional object in the form of a triangle vector, i.e., a triangular face;

[0008] Step S300, based on OpenGL, Cuda and multi-threaded algorithms, all invisible triangles in the initial clipping bounding box are removed according to visual information to obtain the first mode of the clipping bounding box;

[0009] Step S400, according to the first mode of the cropping bounding box, the first mode of the cropping bounding box is enlarged and cropped by using the cropping function of the clipper library to obtain the second mode of the cropping bounding box;

[0010] Step S500, constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the sight direction, searching for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree;

[0011] Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box;

[0012] Step S600, performing two-dimensional projection on the triangular facets in the third mode of the clipping bounding box according to the sight line direction of the first mode of the projection bounding box; fusing the triangular facets based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box;

[0013] Step S700, saving the final bounding box in svg format to generate an ultra-high resolution projection image based on GPU acceleration.

[0014] In some preferred implementations, the image-to-be-drawn file information specifically includes:

[0015] IFC file information and bounding box information to be built.

[0016] In some preferred implementations, the step S200 specifically includes:

[0017] Step S210, constructing an initial clipping bounding box according to the image file information to be drawn, wherein the initial clipping bounding box is an orthogonal bounding box that encloses all vertices in the image file information to be drawn;

[0018] Step S220, using the length of the diagonal corner of the initial cropping bounding box as the edge length and the center of the initial cropping bounding box as the center, constructing a cube as the projected bounding box;

[0019] Step S230, constructing a viewpoint B outside the projection bounding box according to the visual information input by the user; the user visual information is a sight direction vector; the viewpoint B is a viewpoint facing the center of the initial clipping bounding box, and aligning the sight line with the center of the bounding box to obtain the initial sight projection bounding box;

[0020] Step S240, marking the triangular facets in the initial projection bounding box that are completely not in the initial clipping bounding box as eliminated, and obtaining the first mode of the sight projection bounding box; it is stipulated that if any point of the triangular facet is not inside the initial clipping bounding box, it is completely not in the initial clipping bounding box.

[0021] In some preferred implementations, the step S300 specifically includes:

[0022] Step S310, setting the length and width of the rendering scene according to the GPU performance adaptability;

[0023] Step S320, dividing the scene into a plurality of scene blocks according to a block division algorithm to obtain a scene block set;

[0024] The block algorithm is:

[0025] max_texture_size=8192

[0026] horizental_blocks_num=width / max_texture_size+(width%max_texture_size!= 0)

[0027] vertical_blocks_num=height / max_texture_size+(height%max_texture_size!= 0)

[0028] blocks_number=horizental_blocks_num*vertical_blocks_num

[0029] Where max_texture_size is the maximum pixel that the GPU can render; horizontal_blocks_num is the number of horizontal blocks, vertical_blocks_num is the number of vertical blocks, and blocks_number is the total number of blocks;

[0030] Step S330, performing a depth test, performing off-screen rendering on each scene block in the scene block set through OpenGL, and filtering out triangles that cannot be seen from the sight direction by the depth test, so as to obtain the texture of each scene block;

[0031] Step S340, reading the texture data of the texture of each scene block through Cuda to obtain initial cropping bounding box texture data;

[0032] Step S350, performing GPU parallel sorting and deduplication on the polygon IDs in the initial clipping bounding box texture data through the thrust library to obtain a deduplicated polygon ID array v;

[0033] Step S360, based on the deduplicated polygon ID array v, an array flag is created, where the subscript of the array flag represents the triangle ID, and the array v is traversed by a CPU multi-threaded parallel method, and for each element e in the array v, flag[e]=true is set, indicating that the face with ID equal to e is visible;

[0034] Step S370, traverse the IDs of all polygons, if flag[Id] == true, keep them, otherwise discard them; remove all invisible triangles to obtain the first mode of the clipping bounding box.

[0035] In some preferred implementations, the step S400 specifically includes:

[0036] Enlarge the vertex coordinates of all triangles and each point of the Polygon by a preset magnification factor, intersect the marked triangles with the first mode of the clipping bounding box, and clip the triangles outside the first mode of the clipping bounding box;

[0037] According to each face of the first mode of the clipping bounding box, the triangular facets at the boundary are clipped, and the polygon within the clipping bounding box is retained to obtain the second mode of the clipping bounding box.

[0038] In some preferred implementations, constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box specifically includes:

[0039] Step A100, creating a leaf node based on each triangular face in the second mode of the clipping bounding box, and adding the leaf node to the BVH; wherein each leaf node represents a triangular face and stores the bounding box information of the corresponding triangular face;

[0040] Step A200, specify any triangle patch node TN, whose outer bounding box is TNBounds, starting from the root node, recursively judge by area to determine whether to join the left subtree or the right subtree;

[0041] The basis for judgment includes:

[0042] Cost1 = GetArea(LeftNodeBound + TNBounds) – LeftNodeArea;

[0043] Cost2 = GetArea(RightNodeBound + TNBounds) – RightNodeArea;

[0044] If Cost1 < Cost2, add it to the left subtree, otherwise, add it to the right subtree;

[0045] Among them, GetArea is a function for finding the area of ​​the bounding box; LeftNodeBound is the bounding box of the left child node, TNBounds is the bounding box of the current triangle; LeftNodeBound + TNBounds is the new bounding box after the fusion of the bounding box of the left child node and the bounding box of the current triangle; LeftNodeArea is the area of ​​the left child node; Cost1 is the difference between the area of ​​the bounding box of the left child node after fusion and the area before; similarly, Cost2 is the difference between the area of ​​the bounding box of the right child node after fusion and the area before;

[0046] Step A300, recursively repeat step A200 until all triangles are added to the BVH search tree.

[0047] In some preferred implementations, the multi-threaded hidden layer calculation specifically includes:

[0048] Step B100, taking any visible triangle in the second mode of the clipping bounding box, record it as the first visible triangle A1, and finding out other visible triangle sets C intersecting with B1 from the BVH search tree according to the outer bounding box B1 of the first visible triangle;

[0049] The intersection here refers to the intersection of the bounding box B1 of triangle A1 with any bounding box B2 in set C, which is specifically defined as follows:

[0050] Intersection = B1 intersects B2

[0051] Where B1 and B2 are two axis-aligned bounding boxes (AABB), Intersection is the intersection of B1 and B2, and intersects means finding the intersection;

[0052] If Intersection is not empty, the bounding boxes B1 and B2 intersect.

[0053] Step B200, randomly taking out a second visible triangle face A2 from other visible triangle face sets C;

[0054] Step B300, determining the intersection relationship between the first visible triangular face A1 and the second visible triangular face A2, if the first visible triangular face A1 and the second visible triangular face A2 do not intersect, returning to step A200; otherwise, proceeding to step B400;

[0055] Step B400, using the first visible triangular face A1 as a cutter, cutting the second visible triangular face A2 into two segments P1 and P2, and projecting P1 and P2 onto the projection plane PA;

[0056] The projection surface includes a horizontal surface or a vertical surface;

[0057] Step B500, calculating the intersection SA1 of the first visible triangle A1 and P1; if SA1 belongs to the first visible triangle A1, calculating the Z value gz1 of the barycentric coordinates of SA1; if SA1 belongs to P1, calculating the Z value gz2 of the barycentric coordinates of SA1;

[0058] Step B600, if gz1>gz2, find the difference between the first visible triangle A1 and P1, A1-P1;

[0059] Step B700, calculating the intersection SA2 of the first visible triangle A1 and P2; if SA2 belongs to the first visible triangle A1, calculating the Z value of its barycentric coordinates gz3; if SA2 belongs to P2, calculating the Z value of its barycentric coordinates gz4;

[0060] Step B800, if gz3>gz4, find the difference between the first visible triangle A1 and P2, A1-P2.

[0061] In some preferred implementations, the step S600 specifically includes:

[0062] Use the cilpper library to fuse the triangular faces of the third mode of the clipping bounding box and the first mode of the sight projection bounding box according to the preset fusion rules to eliminate the common edges;

[0063] According to the preset fusion rules, the triangular facets to be fused are divided into the same group through the hash table. Each group of facets is merged. In each merging iteration, the triangular facets with the same edges and normals are merged in pairs until a fused polygonal surface is generated.

[0064] The fusion rules include fusion of structural professional components by component type and fusion of structural professional components by material.

[0065] Another aspect of the present invention provides a super-high resolution projection mapping system based on GPU acceleration, comprising: an original information collection module, a sight projection bounding box first mode acquisition module, a cropping bounding box first mode acquisition module, a cropping bounding box second mode acquisition module, a cropping bounding box third mode acquisition module, a final bounding box acquisition module and a mapping module;

[0066] The original information collection module is configured to collect the information of the file to be drawn and the visual information input by the user;

[0067] The sight projection bounding box first mode acquisition module is configured to construct an initial cropping bounding box based on the information of the image file to be generated, construct a projection bounding box based on the initial cropping bounding box, adjust the direction of the projection bounding box according to the visual information, and obtain the initial sight projection bounding box; mark the grid information in the initial sight projection bounding box that is completely not in the initial cropping bounding box as being eliminated, and obtain the first mode of the sight projection bounding box;

[0068] The cropping bounding box first mode acquisition module is configured to remove all invisible triangles in the initial cropping bounding box according to visual information based on OpenGL, Cuda and multi-threaded algorithms to obtain the first mode of the cropping bounding box;

[0069] The cropping bounding box second mode acquisition module is configured to enlarge and crop the first mode of the cropping bounding box according to the first mode of the cropping bounding box through the cropping function of the clipper library to obtain the cropping bounding box second mode;

[0070] The clipping bounding box third mode acquisition module is configured to construct a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the line of sight, search for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree;

[0071] Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box;

[0072] The final bounding box acquisition module is configured to fuse the triangular facets of the clipping bounding box third mode and the sight projection bounding box first mode based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box;

[0073] The mapping module is configured to save the final bounding box in svg format and generate an ultra-high resolution projection image based on GPU acceleration.

[0074] According to a third aspect of the present invention, an electronic device is provided, comprising:

[0075] at least one processor; and

[0076] a memory communicatively connected to at least one of the processors; wherein,

[0077] The memory stores instructions that can be executed by the processor, and the instructions are used to be executed by the processor to implement the above-mentioned ultra-high resolution projection mapping method based on GPU acceleration.

[0078] In a fourth aspect of the present invention, a computer-readable storage medium is proposed, wherein the computer-readable storage medium stores computer instructions, and the computer instructions are used to be executed by the computer to implement the above-mentioned ultra-high resolution projection mapping method based on GPU acceleration.

[0079] Beneficial effects of the present invention:

[0080] (1) The present invention improves the efficiency of ultra-high resolution image rendering by combining CUDA and OpenGL technologies;

[0081] (2) The present invention significantly reduces rendering time and memory usage through bounding box clipping, fusion, clipping and other algorithms. BRIEF DESCRIPTION OF THE DRAWINGS

[0082] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

[0083] Figure 1 This is a flowchart of the ultra-high resolution projection mapping method based on GPU acceleration;

[0084] Figure 2 It is the first top-down plan view, and the initial cropping bounding box as input can be calculated through the layer height;

[0085] Figure 3 It is the second top view, and the initial cropping bounding box as input can be calculated through the layer height;

[0086] Figure 4 It is the third top view, and the initial cropping bounding box as input can be calculated through the layer height;

[0087] Figure 5 It is a partial elevation view. The initial bounding box is the bounding box of the entire building, and then it is partially cropped.

[0088] Figure 6 It is a structural diagram of a computer system of a server for implementing the method, system, and device embodiments of the present application. DETAILED DESCRIPTION

[0089] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It is also necessary to explain that, for ease of description, only the parts related to the relevant invention are shown in the accompanying drawings.

[0090] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0091] The present invention provides a super-high resolution projection mapping method based on GPU acceleration, comprising:

[0092] Step S100, collecting the file information to be drawn and the visual information input by the user;

[0093] Step S200, constructing an initial cropping bounding box based on the information of the image file to be generated, constructing a projection bounding box based on the initial cropping bounding box, adjusting the direction of the projection bounding box according to the visual information, and obtaining an initial sight projection bounding box; marking the mesh information in the initial sight projection bounding box that is completely not in the initial cropping bounding box as being eliminated, and obtaining a first mode of the sight projection bounding box;

[0094] The mesh information is represented by a three-dimensional object in the form of a triangle vector, i.e., a triangular face;

[0095] Step S300, based on OpenGL, Cuda and multi-threaded algorithms, all invisible triangles in the initial clipping bounding box are removed according to visual information to obtain the first mode of the clipping bounding box;

[0096] Step S400, according to the first mode of the cropping bounding box, the first mode of the cropping bounding box is enlarged and cropped by using the cropping function of the clipper library to obtain the second mode of the cropping bounding box;

[0097] Step S500, constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the sight direction, searching for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree;

[0098] Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box;

[0099] Step S600, performing two-dimensional projection on the triangular facets in the third mode of the clipping bounding box according to the sight line direction of the first mode of the projection bounding box; fusing the triangular facets based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box;

[0100] Step S700, saving the final bounding box in svg format to generate an ultra-high resolution projection image based on GPU acceleration.

[0101] In order to more clearly illustrate the ultra-high resolution projection mapping method based on GPU acceleration of the present invention, each step in the embodiment of the present invention is described in detail below with reference to the accompanying drawings.

[0102] The first embodiment of the present invention is a method for ultra-high resolution projection mapping based on GPU acceleration, such as Figure 1 As shown, each step is described in detail as follows:

[0103] Step S100, collecting the file information to be drawn and the visual information input by the user;

[0104] In this embodiment, the image file information to be generated specifically includes:

[0105] IFC file information and bounding box information to be built.

[0106] Step S200: constructing a Figure 2 , Figure 3 and Figure 4The initial cropping bounding box shown, constructing a projection bounding box based on the initial cropping bounding box, adjusting the direction of the projection bounding box according to the visual information, and obtaining an initial sight projection bounding box; marking the mesh information in the initial sight projection bounding box that is completely not in the initial cropping bounding box as being eliminated, and obtaining the first mode of the sight projection bounding box;

[0107] The mesh information is vectorized by triangles to represent a three-dimensional object, namely, a triangular face.

[0108] In this embodiment, the step S200 specifically includes:

[0109] Step S210, constructing an initial clipping bounding box according to the image file information to be drawn, wherein the initial clipping bounding box is an orthogonal bounding box that encloses all vertices in the image file information to be drawn;

[0110] Using the diagonal length of the initial cropped bounding box as the edge length and the center of the initial cropped bounding box as the center, a cube is constructed as the projected bounding box.

[0111] Step S230, constructing a viewpoint B outside the projection bounding box according to the visual information input by the user; the user visual information is a sight direction vector; the viewpoint B is a viewpoint facing the center of the initial clipping bounding box, and aligning the sight line with the center of the bounding box to obtain the initial sight projection bounding box;

[0112] Step S240, marking the triangular facets in the initial projection bounding box that are completely not in the initial clipping bounding box as eliminated, and obtaining the first mode of the sight projection bounding box; it is stipulated that if any point of the triangular facet is not inside the initial clipping bounding box, it is completely not in the initial clipping bounding box.

[0113] Step S300, based on OpenGL, Cuda and multi-threaded algorithms, all invisible triangles in the initial clipping bounding box are removed according to visual information to obtain the first mode of the clipping bounding box;

[0114] In this embodiment, the step S300 specifically includes:

[0115] Step S310, setting the length and width of the rendering scene to 16384 pixels according to the GPU performance adaptability. This value is generally set to an integer multiple of 2 to speed up the calculation;

[0116] Step S320, dividing the scene into a plurality of scene blocks according to a block division algorithm to obtain a scene block set;

[0117] The block algorithm is:

[0118] max_texture_size=8192

[0119] horizental_blocks_num=width / max_texture_size+(width%max_texture_size!= 0)

[0120] vertical_blocks_num=height / max_texture_size+(height%max_texture_size!= 0)

[0121] blocks_number=horizental_blocks_num*vertical_blocks_num

[0122] Where max_texture_size is the maximum pixel that the GPU can render; horizontal_blocks_num is the number of horizontal blocks, vertical_blocks_num is the number of vertical blocks, and blocks_number is the total number of blocks;

[0123] Step S330, performing a depth test, performing off-screen rendering on each scene block in the scene block set through OpenGL, and filtering out triangles that cannot be seen from the sight direction by the depth test, so as to obtain the texture of each scene block;

[0124] Step S340, reading the texture data of the texture of each scene block through Cuda to obtain initial cropping bounding box texture data;

[0125] Step S350, performing GPU parallel sorting of the polygon ids in the first cropped bounding box texture data into an array and then removing duplicates through the thrust library to obtain a polygon id array v after removing duplicates;

[0126] Step S360, based on the deduplicated polygon id array v, a large array flag is created, where the subscript of the data represents the triangle id, and the array v is traversed by a CPU multi-threaded parallel method, and corresponding to each element e in the array v, flag[e]=true is set;

[0127] Step S370, judging whether the first polygon is to be retained through flag[polygon.id];

[0128] The triangle ids start from 0 and increase as natural numbers. When the flag array is created, the size of the array will be initialized to the total number of triangles.

[0129] Step S400, according to the second clipping bounding box and the marked triangular facets, the second clipping bounding box is enlarged and clipped by the clipper library to obtain a third clipping bounding box;

[0130] In this embodiment, the step of enlarging and cropping specifically includes:

[0131] Magnify the vertex coordinates of all triangles and each point of the Polygon by a preset magnification factor, which is 2 to the 25th power, that is, 3435978368, after experimentation. Intersect the marked triangles with the first mode of the clipping bounding box, and clip the triangles outside the first mode of the clipping bounding box.

[0132] According to each face of the first mode of the clipping bounding box, the polygon at the boundary is clipped to obtain the clipped polygon;

[0133] Calculate the intersection points of the polygon and the clipping surface and the directed example, determine which parts should be retained, and generate the corresponding path. Use the clipper library to simplify the clipped polygon and obtain the second mode of the clipping bounding box.

[0134] Step S500, constructing a BVH tree based on the visible triangles in the third clipping bounding box as a subset of the BVH tree, and dividing the visible triangles in the third clipping bounding box into visible triangles that may intersect, visible triangles that may not intersect, and visible triangles that must intersect through the BVH tree;

[0135] A multi-threaded hidden calculation is performed on the visible triangular facets according to the number of CPU threads supported by the computer, and the clipping of the partially blocked face is completed to obtain a fourth clipping bounding box.

[0136] In this embodiment, the step of constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box specifically includes:

[0137] Step A100, creating a leaf node based on each triangular face in the second mode of the clipping bounding box, and adding the leaf node to the BVH; wherein each leaf node represents a triangular face and stores the bounding box information of the corresponding triangular face;

[0138] Step A200, recursively constructing a BVH tree, starting from a leaf node, using a surface area-inspired partitioning strategy to construct the BVH tree, specifically including:

[0139] Specify any triangle patch node TN, whose outer bounding box is TNBounds, starting from the root node, recursively judge by area to determine whether to join the left subtree or the right subtree;

[0140] The basis for judgment includes:

[0141] Cost1 = GetArea(LeftNodeBound + TNBounds) – LeftNodeArea;

[0142] Cost2 = GetArea(RightNodeBound + TNBounds) – RightNodeArea;

[0143] If Cost1 < Cost2, add it to the left subtree, otherwise, add it to the right subtree;

[0144] Among them, GetArea is a function for finding the area of ​​the bounding box; LeftNodeBound is the bounding box of the left child node, TNBounds is the bounding box of the current triangle; LeftNodeBound + TNBounds is the new bounding box after the fusion of the bounding box of the left child node and the bounding box of the current triangle; LeftNodeArea is the area of ​​the left child node; Cost1 is the difference between the area of ​​the bounding box of the left child node after fusion and the area before; similarly, Cost2 is the difference between the area of ​​the bounding box of the right child node after fusion and the area before;

[0145] Step A300, recursively repeat step A200 until all triangles are added to the BVH search tree.

[0146] In this embodiment, the multi-threaded hidden layer calculation specifically includes:

[0147] Step B100, taking any visible triangle in the second mode of the clipping bounding box, record it as the first visible triangle A1, and finding out other visible triangle sets C intersecting with B1 from the BVH search tree according to the outer bounding box B1 of the first visible triangle;

[0148] The intersection here refers to the intersection of the bounding box B1 of triangle A1 with any bounding box B2 in set C, which is specifically defined as follows:

[0149] Intersection = B1 intersects B2

[0150] Where B1 and B2 are two axis-aligned bounding boxes (AABB), Intersection is the intersection of B1 and B2, and intersects means finding the intersection;

[0151] If Intersection is not empty, the bounding boxes B1 and B2 intersect.

[0152] Step B200, randomly taking out a second visible triangle face A2 from other visible triangle face sets C;

[0153] Step B300, determining the intersection relationship between the first visible triangular face A1 and the second visible triangular face A2, if the first visible triangular face A1 and the second visible triangular face A2 do not intersect, returning to step A200; otherwise, proceeding to step B400;

[0154] Step B400, using the first visible triangular face A1 as a cutter, cut the second visible triangular face A2 into two segments P1 and P2, and project P1 and P2 to Figure 5 The projection surface PA shown;

[0155] The projection surface includes a horizontal surface or a vertical surface;

[0156] Step B500, calculating the intersection SA1 of the first visible triangle A1 and P1; if SA1 belongs to the first visible triangle A1, calculating the Z value gz1 of the barycentric coordinates of SA1; if SA1 belongs to P1, calculating the Z value gz2 of the barycentric coordinates of SA1;

[0157] Step B600, if gz1>gz2, find the difference between the first visible triangle A1 and P1, A1-P1;

[0158] Step B700, calculating the intersection SA2 of the first visible triangle A1 and P2; if SA2 belongs to the first visible triangle A1, calculating the Z value of its barycentric coordinates gz3; if SA2 belongs to P2, calculating the Z value of its barycentric coordinates gz4;

[0159] Step B800, if gz3>gz4, find the difference between the first visible triangle A1 and P2, A1-P2;

[0160] Step S600, performing two-dimensional projection on the triangular facets in the third mode of the clipping bounding box according to the sight line direction of the first mode of the projection bounding box; fusing the triangular facets based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box;

[0161] In this embodiment, the step S600 specifically includes:

[0162] Use the cilpper library to fuse the triangular faces of the third mode of the clipping bounding box and the first mode of the sight projection bounding box according to the preset fusion rules to eliminate the common edges;

[0163] According to the preset fusion rules, the triangular faces to be fused are divided into the same group through a hash table. For each group of faces, the merging method is adopted. In each merging iteration, the triangular faces with common edges and the same normal are fused two by two until a fused polygonal surface is generated to obtain the final bounding box. This method can avoid the holes that appear when all faces are directly merged together due to the wrong polygon direction.

[0164] The fusion rules include fusion of structural professional components by component type and fusion of structural professional components by material.

[0165] Step S700, saving the final bounding box in svg format to generate an ultra-high resolution projection image based on GPU acceleration.

[0166] Although the various steps in the above embodiment are described in the above-mentioned order, those skilled in the art can understand that in order to achieve the effect of this embodiment, different steps do not have to be executed in such an order. They can be executed simultaneously (in parallel) or in a reverse order. These simple changes are within the scope of protection of the present invention.

[0167] The second embodiment of the present invention is a super-high resolution projection mapping system based on GPU acceleration, comprising: an original information collection module, a sight projection bounding box first mode acquisition module, a cropping bounding box first mode acquisition module, a cropping bounding box second mode acquisition module, a cropping bounding box third mode acquisition module, a final bounding box acquisition module and a mapping module;

[0168] The original information collection module is configured to collect the information of the file to be drawn and the visual information input by the user;

[0169] The sight projection bounding box first mode acquisition module is configured to construct an initial cropping bounding box based on the information of the image file to be generated, construct a projection bounding box based on the initial cropping bounding box, adjust the direction of the projection bounding box according to the visual information, and obtain the initial sight projection bounding box; mark the grid information in the initial sight projection bounding box that is completely not in the initial cropping bounding box as being eliminated, and obtain the first mode of the sight projection bounding box;

[0170] The cropping bounding box first mode acquisition module is configured to remove all invisible triangles in the initial cropping bounding box according to visual information based on OpenGL, Cuda and multi-threaded algorithms to obtain the first mode of the cropping bounding box;

[0171] The cropping bounding box second mode acquisition module is configured to enlarge and crop the first mode of the cropping bounding box according to the first mode of the cropping bounding box through the cropping function of the clipper library to obtain the cropping bounding box second mode;

[0172] The clipping bounding box third mode acquisition module is configured to construct a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the line of sight, search for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree;

[0173] Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box;

[0174] The final bounding box acquisition module is configured to fuse the triangular facets of the clipping bounding box third mode and the sight projection bounding box first mode based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box;

[0175] The mapping module is configured to save the final bounding box in svg format and generate an ultra-high resolution projection image based on GPU acceleration.

[0176] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process and related instructions of the system described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0177] It should be noted that the ultra-high resolution projection mapping system based on GPU acceleration provided in the above embodiment is only illustrated by the division of the above functional modules. In practical applications, the above functions can be assigned to different functional modules as needed, that is, the modules or steps in the embodiments of the present invention can be decomposed or combined. For example, the modules in the above embodiments can be combined into one module, or further divided into multiple sub-modules to complete all or part of the functions described above. The names of the modules and steps involved in the embodiments of the present invention are only for distinguishing the modules or steps and are not regarded as improper limitations of the present invention.

[0178] An electronic device according to a third embodiment of the present invention includes:

[0179] at least one processor; and

[0180] a memory communicatively connected to at least one of the processors; wherein,

[0181] The memory stores instructions that can be executed by the processor, and the instructions are used to be executed by the processor to implement the above-mentioned ultra-high resolution projection mapping method based on GPU acceleration.

[0182] A computer-readable storage medium according to a fourth embodiment of the present invention stores computer instructions, and the computer instructions are used to be executed by the computer to implement the above-mentioned ultra-high resolution projection mapping method based on GPU acceleration.

[0183] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process and related instructions of the storage device and processing device described above can refer to the corresponding process in the aforementioned method embodiment and will not be repeated here.

[0184] Those skilled in the art should be able to appreciate that the modules and method steps of each example described in conjunction with the embodiments disclosed herein can be implemented with electronic hardware, computer software, or a combination of the two, and the programs corresponding to the software modules and method steps can be placed in random access memory (RAM), memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disks, removable disks, CD-ROMs, or any other form of storage medium known in the technical field. In order to clearly illustrate the interchangeability of electronic hardware and software, the composition and steps of each example have been generally described in the above description according to the function. Whether these functions are performed in electronic hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0185] Reference below Figure 6 , which shows a schematic diagram of the structure of a computer system of a server for implementing the method, system, and device embodiments of the present application. Figure 6 The server shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0186] like Figure 6 As shown, the computer system includes a central processing unit (CPU) 601, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 602 or the program loaded from the storage part 608 to the random access memory (RAM) 603. Various programs and data required for system operation are also stored in the RAM 603. The CPU 601, ROM 602 and RAM 603 are connected to each other through a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0187] The following components are connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed so that a computer program read therefrom is installed into the storage section 608 as needed.

[0188] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the central processing unit (CPU) 601, the above-mentioned functions defined in the method of the present application are executed. It should be noted that the above-mentioned computer-readable medium of the present application can be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium can be, for example, - but not limited to - an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection with one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, an apparatus or a device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in combination with an instruction execution system, an apparatus or a device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0189] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0190] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0191] The terms "first", "second", etc. are used to distinguish similar objects rather than to describe or indicate a particular order or sequence.

[0192] The term "comprise" or any other similar term is intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus / device that includes a list of elements includes not only those elements but also other elements not expressly listed, or also includes elements inherent to such process, method, article, or apparatus / device.

[0193] So far, the technical solutions of the present invention have been described in conjunction with the preferred embodiments shown in the accompanying drawings. However, it is easy for those skilled in the art to understand that the protection scope of the present invention is obviously not limited to these specific embodiments. Without departing from the principle of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will fall within the protection scope of the present invention.

Claims

1. A method for ultra-high resolution projection mapping based on GPU acceleration, characterized in that: The method comprises: Step S100, collecting the file information to be drawn and the visual information input by the user; Step S200, constructing an initial cropping bounding box based on the information of the image file to be generated, constructing a projection bounding box based on the initial cropping bounding box, adjusting the direction of the projection bounding box according to visual information, and obtaining an initial sight projection bounding box; marking the triangular facets in the initial sight projection bounding box that are completely not in the initial cropping bounding box as being eliminated, and obtaining the marked triangular facets and the first mode of the sight projection bounding box; Wherein, the triangular facet is the mesh information of a three-dimensional object represented by triangle vectorization; Step S300, based on the depth test of OpenGL, Cuda and multi-threaded algorithm, all invisible triangles in the initial clipping bounding box are eliminated through the rendering pipeline according to the visual information to obtain the first mode of the clipping bounding box; The step S300 specifically includes: Step S310, setting the length and width of the rendering scene according to the GPU performance adaptability; Step S320, dividing the scene into a plurality of scene blocks according to a block division algorithm to obtain a scene block set; The block algorithm is to divide the scene into several scene blocks by setting the maximum number of GPU rendering pixels, the maximum number of horizontal blocks and the maximum number of vertical blocks of the scene; Step S330, performing a depth test, performing off-screen rendering on each scene block in the scene block set through OpenGL, and eliminating triangles that cannot be seen from the sight direction by the depth test, so as to obtain the texture of each scene block; Step S340, reading the texture data of the texture of each scene block through Cuda to obtain initial cropping bounding box texture data; Step S350, performing GPU parallel sorting of the polygon ids in the initial clipping bounding box texture data into an array and then removing duplicates through the thrust library to obtain a polygon id array v after removing duplicates; Step S360, based on the deduplicated polygon id array v, a large array flag is created, where the subscript of the data represents the triangle id, and the polygon id array v is traversed by a CPU multi-threaded parallel method, and corresponding to each element e in the array v, flag[e]=true is set; Step S370, traverse all polygon ids, if flag[Id] == true, keep them, otherwise discard them; remove all invisible triangles to obtain the first mode of the clipping bounding box; Step S400, according to the first mode of the cropping bounding box, the first mode of the cropping bounding box is enlarged and cropped by using the cropping function of the clipper library to obtain the second mode of the cropping bounding box; Step S500, constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the sight direction, searching for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree; Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box; Step S600, performing two-dimensional projection on the triangular facets in the third mode of the clipping bounding box according to the sight line direction of the first mode of the projection bounding box; fusing the triangular facets based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box; Step S700, saving the final bounding box in svg format to generate an ultra-high resolution projection image based on GPU acceleration.

2. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 1, characterized in that: The image file information to be generated specifically includes: IFC file information and bounding box information to be built.

3. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 1, characterized in that: The step S200 specifically includes: Step S210, constructing an initial clipping bounding box according to the image file information to be drawn; the initial clipping bounding box is an orthogonal bounding box that encloses all vertices in the image file information to be drawn; Step S220, using the diagonal length of the initial cropping bounding box as the edge length and the center of the initial cropping bounding box as the geometric center, constructing a cube as the projected bounding box; Step S230, constructing a viewpoint B outside the projection bounding box according to the visual information input by the user; the visual information is a sight direction vector; the viewpoint B is a viewpoint facing the center of the initial clipping bounding box, and aligning the sight line with the center of the bounding box to obtain the initial sight projection bounding box; Step S240, marking the triangular facets in the initial projection bounding box that are completely not in the initial clipping bounding box as eliminated, and obtaining the first mode of the sight projection bounding box; stipulating that any point of the triangular facet that is not inside the initial clipping bounding box is a triangular facet that is completely not in the initial clipping bounding box.

4. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 1, characterized in that: The step S400 specifically includes: Magnify the vertex coordinates of all triangles and each point of the Polygon by a preset magnification, find the intersection of the marked triangles and the first mode of the clipping bounding box, and clip the triangles outside the first mode of the clipping bounding box; According to each face of the first mode of the clipping bounding box, the triangular facets at the boundary are clipped, and the polygon within the clipping bounding box is retained to obtain the second mode of the clipping bounding box.

5. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 1, characterized in that: The step of constructing a BVH search tree based on the triangular facets in the second mode of the clipping bounding box specifically includes: Step A100, creating a leaf node based on each triangular face in the second mode of the clipping bounding box, and adding the leaf node to the BVH search tree; wherein each leaf node represents a triangular face and stores the bounding box information of the corresponding triangular face; Step A200, specify any triangle patch node TN, whose outer bounding box is TNBounds, starting from the root node, recursively add it to the left subtree or the right subtree by area judgment; The basis for determining the area includes: Cost1 = GetArea(LeftNodeBound + TNBounds) – LeftNodeArea; Cost2 = GetArea(RightNodeBound + TNBounds) – RightNodeArea; If Cost1 < Cost2, add it to the left subtree, otherwise, add it to the right subtree; Among them, GetArea is a function for finding the area of ​​the bounding box; LeftNodeBound is the bounding box of the left child node, TNBounds is the bounding box of the current triangle; LeftNodeBound + TNBounds is the new bounding box after the fusion of the bounding box of the left child node and the bounding box of the current triangle; LeftNodeArea is the area of ​​the left child node; Cost1 is the difference between the area of ​​the bounding box of the left child node after fusion and the area before; similarly, Cost2 is the difference between the area of ​​the bounding box of the right child node after fusion and the area before; Step A300, recursively perform step A200 until all triangles are added to the BVH search tree.

6. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 5, characterized in that: The multi-threaded hidden layer calculation specifically includes: Step B100, taking any visible triangle in the second mode of the clipping bounding box, record it as the first visible triangle A1, and finding out other visible triangle sets C intersecting with B1 from the BVH search tree according to the outer bounding box B1 of the first visible triangle; The set C is specifically defined as follows: Intersection = B1 intersects B2 Where B1 and B2 are two axis-aligned bounding boxes AABB, Intersection is the intersection of B1 and B2, and intersects means finding the intersection; If Intersection is not empty, the bounding boxes B1 and B2 intersect; Step B200, randomly taking out a second visible triangle face A2 from other visible triangle face sets C; Step B300, determining the intersection relationship between the first visible triangular face A1 and the second visible triangular face A2, if the first visible triangular face A1 and the second visible triangular face A2 do not intersect, returning to step B200; otherwise, proceeding to step B400; Step B400, using the first visible triangular face A1 as a cutter, cutting the second visible triangular face A2 into two segments P1 and P2, and projecting P1 and P2 onto the projection plane PA; The projection surface includes a horizontal surface or a vertical surface; Step B500, calculating the intersection SA1 of the first visible triangle A1 and P1; if SA1 belongs to the first visible triangle A1, calculating the Z value gz1 of the barycentric coordinates of SA1; if SA1 belongs to P1, calculating the Z value gz2 of the barycentric coordinates of SA1; Step B600, if gz1>gz2, find the difference between the first visible triangle A1 and P1, A1-P1; Step B700, calculating the intersection SA2 of the first visible triangle A1 and P2; if SA2 belongs to the first visible triangle A1, calculating the Z value of its barycentric coordinates gz3; if SA2 belongs to P2, calculating the Z value of its barycentric coordinates gz4; Step B800, if gz3>gz4, find the difference between the first visible triangle A1 and P2, A1-P2.

7. The method for ultra-high resolution projection mapping based on GPU acceleration according to claim 1, characterized in that: The step S600 specifically includes: Use the cilpper library to fuse the triangular faces of the third mode of the clipping bounding box and the first mode of the sight projection bounding box according to the preset fusion rules to eliminate the common edges; According to the preset fusion rules, the triangles to be fused are divided into the same group through the hash table. Each group of faces is merged. In each merging iteration, the triangles with the same edges and normals are merged in pairs until a fused polygonal surface is generated to obtain the final bounding box. The fusion rules include fusion of structural professional components by component type and fusion of structural professional components by material.

8. A GPU-accelerated ultra-high resolution projection mapping system, characterized in that: The system comprises: The original information collection module is configured to collect the information of the file to be drawn and the visual information input by the user; The sight projection bounding box first mode acquisition module is configured to construct an initial cropping bounding box based on the information of the image file to be generated, construct a projection bounding box based on the initial cropping bounding box, adjust the direction of the projection bounding box according to the visual information, and obtain the initial sight projection bounding box; mark the triangular facets in the initial sight projection bounding box that are completely not in the initial cropping bounding box as being eliminated, and obtain the marked triangular facets and the first mode of the sight projection bounding box; Wherein, the triangular facet is the mesh information of a three-dimensional object represented by triangle vectorization; A cropping bounding box first mode acquisition module is configured to remove all invisible triangles in the initial cropping bounding box according to visual information based on OpenGL, Cuda and multi-threaded algorithms to obtain the first mode of the cropping bounding box; The first mode of obtaining the cropping bounding box specifically includes: Set the length and width of the rendering scene according to GPU performance adaptability; Divide the scene into several scene blocks according to the block algorithm to obtain a scene block set; The block algorithm is to divide the scene into several scene blocks by setting the maximum number of GPU rendering pixels, the maximum number of horizontal blocks and the maximum number of vertical blocks of the scene; Perform depth testing and perform off-screen rendering on each scene block in the scene block set through OpenGL. Triangles that cannot be seen from the line of sight will be eliminated by the depth test to obtain the texture of each scene block. Reading the texture data of the texture of each scene block through Cuda to obtain initial cropping bounding box texture data; By using the thrust library, the polygon ids in the initial clipping bounding box texture data are sorted into arrays in parallel by GPU and then deduplicated, thereby obtaining a deduplicated polygon id array v; A large array flag is created based on the deduplicated polygon id array v, where the subscript of the data represents the triangle id. The polygon id array v is traversed by a CPU multi-threaded parallel method, and flag[e]=true is set for each element e in the array v. Traverse all polygon ids, if flag[Id] == true, keep them, otherwise discard them; remove all invisible triangles and obtain the first mode of the clipping bounding box; A cropping bounding box second mode acquisition module is configured to enlarge and crop the first mode of the cropping bounding box through the cropping function of the clipper library according to the first mode of the cropping bounding box to obtain the second mode of the cropping bounding box; The clipping bounding box third mode acquisition module is configured to construct a BVH search tree based on the triangular facets in the second mode of the clipping bounding box, and for a triangular facet seen from the sight direction, search for the intersecting triangular facets in the second mode of the clipping bounding box through the BVH search tree; Perform multi-threaded hidden calculation on the visible triangular facets according to the number of CPU threads supported by the computer, complete clipping of the partially blocked face, and obtain the third mode of the clipping bounding box; The final bounding box acquisition module is configured to fuse the triangular facets of the clipping bounding box third mode and the sight projection bounding box first mode based on the fusion function of the clipper library and the preset fusion rules to obtain the final bounding box; The mapping module is configured to save the final bounding box in SVG format and generate an ultra-high resolution projection map based on GPU acceleration.

9. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to at least one of the processors; wherein, The memory stores instructions executable by the processor, and the instructions are used to be executed by the processor to implement the ultra-high resolution projection mapping method based on GPU acceleration as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to be executed by the computer to implement the ultra-high resolution projection mapping method based on GPU acceleration as described in any one of claims 1-7.

Citation Information

Patent Citations

  • Real-time ray cast volume rendering method of three-dimensional earthquake volume data

    CN103198514A

  • Multi-camera combined rapid ray tracing method, system and application

    CN113240785A

  • Quick acquisition method and system for three-dimensional model of virtual simulation scene

    CN116503577A

  • Apparatus and method for accelerating BVH builds by merging bounding boxes

    US20230298254A1