Real-scene three-dimensional archive data application method and device and readable storage medium

By using Tile operation rules and semantic tools to perform tile processing and cropping of real-scene 3D data, the problem of insufficient adaptive response capability in the real-scene 3D archive data application method is solved, realizing accurate data delivery and secure release, and improving system efficiency and security.

CN120997429AActive Publication Date: 2025-11-21HEBEI NATURAL RESOURCES ARCHIVES +1
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
CN202511176633.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-08-21
Publication Date
2025-11-21
Estimated Expiration
2045-08-21

AI Technical Summary

Technical Problem

Existing methods for applying for real-world 3D archive data lack the ability to adapt to different user roles, real-time needs, and anonymization levels, resulting in low data sharing efficiency.

Method used

By using Tile operation rules to segment real-world 3D data, and combining semantic tools and GeoRegion format, data can be precisely cropped to meet user needs, building an automated data publishing system to achieve on-demand data delivery and security control.

Benefits of technology

It enables adaptive responses to different user roles and real-time needs, improves the accuracy and security of data delivery, enhances system resource utilization and release efficiency, and prevents data leakage.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120997429A_ABST
    Figure CN120997429A_ABST
Patent Text Reader

Abstract

The invention discloses a live-action three-dimensional archive data application method and device and a readable storage medium. The method comprises the steps of obtaining live-action three-dimensional data and an application space range of data application; performing framing processing on the live-action three-dimensional data based on Tile operation rules; querying all Tile mapsheets corresponding to the application space ranges in the Tile mapsheet data, and obtaining the space range of each Tile mapsheet; if the application space range contains the space range of the current Tile sheet, Tile sheet data corresponding to the current Tile sheet are converted into live-action three-dimensional data and then output; and if the application spatial range intersects with the spatial range of the current Tile sheet, obtaining an intersection area of the spatial range of the current Tile sheet and the application spatial range, cutting the current Tile sheet according to the intersection area, retaining Tile sheet data of the cutting area, converting the Tile sheet data in the cutting area into live-action three-dimensional data, and outputting the live-action three-dimensional data. According to the invention, adaptive response to different use roles, real-time requirements and desensitization levels is realized.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of image processing, and in particular to a real scene three-dimensional archive data application method, device and readable storage medium. BACKGROUND

[0002] In the application scenario of archive data application, the rapid application and sharing of real scene three-dimensional data are hindered by the complexity of the data, which reduces the practical value. At present, the cutting technology in the field of real scene three-dimensional archives is generally based on static hierarchical pre-generation, and lacks adaptive response capability for different user roles, real-time needs and desensitization levels.

[0003] Therefore, the present application develops a real scene three-dimensional archive data application method, device and readable storage medium to solve the above problems. SUMMARY

[0004] The present application proposes a real scene three-dimensional archive data application method, device and readable storage medium to solve the problem of lack of adaptive response capability for different user roles, real-time needs and desensitization levels in the existing real scene three-dimensional archive data application method.

[0005] The present application achieves the above-mentioned purposes through the following technical solutions:

[0006] The present application provides a real scene three-dimensional archive data application method, which comprises:

[0007] Obtaining real scene three-dimensional data and an application space range of data application;

[0008] Performing framing processing on the real scene three-dimensional data based on a Tile operation rule to obtain Tile map data;

[0009] Querying all Tile maps corresponding to the application space range in the Tile map data, and obtaining the space range of each Tile map;

[0010] Judging the positional relationship between the space range of each Tile map and the application space range;

[0011] If the application space range contains the space range of the current Tile map, the Tile map data corresponding to the current Tile map is converted into real scene three-dimensional data and then outputted;

[0012] If the application space range intersects with the space range of the current Tile map, the intersection area of the space range of the current Tile map and the application space range is obtained, the current Tile map is cut according to the intersection area, the Tile map data of the cutting area is retained, the Tile map data in the cutting area is converted into real scene three-dimensional data and then outputted, and a real scene three-dimensional data result is obtained.

[0013] Further, the acquisition of real three-dimensional data and the acquisition of the spatial range of the data includes:

[0014] Acquiring real three-dimensional data, the real three-dimensional data including digital elevation model data, digital orthophoto data, digital surface model data, and oblique photography data;

[0015] Storing the real three-dimensional data in the file server in a way of dividing by data scale;

[0016] Acquiring the spatial range of the data acquisition, the spatial range including a preset range and administrative division information, the preset range including administrative region location information described by text, and the administrative division information including administrative region name and coordinate information of administrative region spatial range;

[0017] Converting the spatial range of the data acquisition into split sentences by a semantic tool and returning in geojson format.

[0018] Further, querying all Tile maps corresponding to the spatial range of the data acquisition in the Tile map data and acquiring the spatial range of each Tile map, including:

[0019] Acquiring all point string information in the spatial range of the data acquisition, the all point string information being all coordinate information within the administrative region spatial range;

[0020] Converting the point string information, the coordinate conversion formula being as follows: ; ;

[0021] In the formula, Tile column number represents the real three-dimensional column number result to be queried, Tile row number represents the real three-dimensional row number result to be queried, Tile width is the longitude range covered by a single Tile at this level, which is determined by the scale; Lng represents the longitude information of the point to be input, Lng origin is the real three-dimensional origin longitude information stored in the metadata file, Tile' width is the latitude range covered by a single Tile' at this level, which is determined by the scale, Lng' represents the latitude information of the point to be input, Lng' origin is the real three-dimensional origin latitude information stored in the metadata file, and Z represents the zoom scale of the real three-dimensional data.

[0022] Converting the administrative region spatial range (minLon, minLat, maxLon, maxLat) into the Tile column number and row number of the corresponding level, the conversion formula being as follows:

[0023] ;

[0024] ;

[0025] ;

[0026] ;

[0027] In the formula, StartX / Y represents the starting row number and column number, EndX / Y represents the ending row number and column number, minLon is the minimum longitude, maxLon is the maximum longitude; minLat is the minimum latitude, maxLat is the maximum latitude, and Z is the zoom level.

[0028] Further, the positional relationship between the spatial range of each Tile map and the claimed spatial range is judged, including:

[0029] If all the vertices in the spatial range of the current Tile map are within the claimed spatial range, and the edges of the spatial range of the current Tile map do not intersect with the edges of the claimed spatial range, it is indicated that the claimed spatial range contains the spatial range of the current Tile map.

[0030] If the lower-left corner coordinate (x1, y1) and the upper-right corner coordinate (x2, y2) of the claimed spatial range satisfy:

[0031] max(x1, a1) < min(x2, a2) & max(y1, b1) < min(y2, b2)

[0032] the spatial range of the current Tile map is judged to intersect with the claimed spatial range.

[0033] Further, the intersection region of the spatial range of the current Tile map and the claimed spatial range is obtained by performing a clipping operation on the spatial range of the current Tile map and the claimed spatial range.

[0034] Further, the current Tile map is clipped according to the intersection region, including:

[0035] The geojson data corresponding to the intersection region in the claimed spatial range is converted into GeoRegion format data;

[0036] The data after conversion is subjected to coordinate conversion to be consistent with the coordinate system of the current Tile map;

[0037] a three-dimensional clipping space plane group is constructed according to the GeoRegion format;

[0038] All model vertices of the current Tile map are traversed to judge whether the vertices are inside the three-dimensional clipping space plane group;

[0039] Reserve the vertexes located in the inner side of the three-dimensional clipping space plane group, and form a clipping area according to the vertexes.

[0040] Further, the three-dimensional clipping space plane group is constructed according to the GeoRegion format, and the three-dimensional clipping space plane group comprises:

[0041] The GeoRegion format data is converted into a convex polygon according to a Delaunay triangulation tool.

[0042] The minimum X and Y values and the maximum X and Y values are calculated according to the vertexes of the convex polygon, four vertical planes are generated, and the four vertical planes are a right side plane, a left side plane, a front side plane and a back side plane.

[0043] The maximum Z value and the minimum Z value are calculated according to the elevation data in the digital elevation model data, and an upper plane and a lower plane are generated.

[0044] The three-dimensional clipping space plane group is constructed according to the right side plane, the left side plane, the front side plane, the back side plane, the upper plane and the lower plane.

[0045] Further, the three-dimensional clipping space plane group further comprises:

[0046] The real three-dimensional data achievement is output to a specified path.

[0047] The output real three-dimensional data achievement is automatically packed.

[0048] The projection conversion of the real three-dimensional data achievement is completed by using a GDAL tool, a real three-dimensional data achievement cache configuration file is generated, a real three-dimensional data achievement cache is generated, and the cache is added to a three-dimensional data scene.

[0049] The map and the workspace are saved, a vector map service and a three-dimensional data service are published, and the steps are as follows:

[0050] The data service publishing platform is connected by using a username and a password.

[0051] The type and the data workspace of the real three-dimensional data achievement are acquired, and the data workspace path address is copied.

[0052] The metadata information of the real three-dimensional data is automatically generated according to a configuration file.

[0053] The data service publishing interface is called according to the type and the workspace path address of the real three-dimensional data.

[0054] The map service and the three-dimensional data service are automatically registered to a real three-dimensional GIS data platform, and the three-dimensional service superposition and display of the real three-dimensional data achievement are completed.

[0055] The application further discloses a real three-dimensional archive data claiming device, which comprises:

[0056] an acquisition module, configured to acquire real-scene three-dimensional data and a space range of a data claim;

[0057] a framing module, configured to perform framing processing on the real-scene three-dimensional data based on a Tile operation rule to obtain Tile map data;

[0058] a query module, configured to query all Tile maps corresponding to the space range of the data claim in the Tile map data, and acquire a space range of each Tile map;

[0059] a judgment module, configured to judge a positional relationship between the space range of each Tile map and the space range of the data claim;

[0060] a first output module, configured to, if the space range of the data claim contains the space range of a current Tile map, convert Tile map data corresponding to the current Tile map into real-scene three-dimensional data and then output the real-scene three-dimensional data;

[0061] a second output module, configured to, if the space range of the data claim intersects with the space range of the current Tile map, acquire an intersection region of the space range of the current Tile map and the space range of the data claim, perform cropping on the current Tile map according to the intersection region, retain Tile map data in a cropped region, convert the Tile map data in the cropped region into real-scene three-dimensional data and then output the real-scene three-dimensional data to obtain real-scene three-dimensional data results.

[0062] The application further provides a readable storage medium, wherein the readable storage medium stores a computer program, and the computer program is executed by a processor to implement steps of the real-scene three-dimensional archive data claim method according to any one of claims 1 to 8.

[0063] The application has the following beneficial effects:

[0064] The real-scene three-dimensional archive data claim method, device and readable storage medium can accurately locate a space range and an object category corresponding to data claimed by a user, replace a traditional manual screening operation, improve intelligent extraction capability and spatial accuracy, automatically perform a hierarchical cropping strategy according to different data levels, security requirements or user roles, control precision and region segmentation of real-scene three-dimensional data, support flexible configuration and on-demand delivery of data, improve system resource utilization and publishing efficiency, construct a real-scene three-dimensional data publishing system linked with cropping results, realize a full-process controllable data visualization and delivery mechanism, prevent unauthorized access and data leakage, and enhance system data security and sensitive area protection capability. BRIEF DESCRIPTION OF DRAWINGS

[0065] Figure 1The method flowchart of the real scene three-dimensional archive data application method, device and readable storage medium. DETAILED DESCRIPTION

[0066] In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be described clearly and completely below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings can be arranged and designed in various different configurations.

[0067] Therefore, the detailed description of the embodiments of the present application provided in the drawings below is not intended to limit the scope of the claimed present application, but only represents selected embodiments of the present application. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present application without creative labor are within the scope of protection of the present application.

[0068] The specific embodiments of the present application will be described in detail below with reference to the drawings.

[0069] As shown in the drawings, a real scene three-dimensional archive data application method comprises: Figure 1

[0070] S1: acquiring real scene three-dimensional data and an application space range of data application;

[0071] S2: performing framing processing on the real scene three-dimensional data based on a Tile operation rule to obtain Tile map data;

[0072] S3: querying all Tile maps corresponding to the application space range in the Tile map data and acquiring a space range of each Tile map;

[0073] S4: judging the positional relationship between the space range of each Tile map and the application space range;

[0074] S5: if the application space range contains the space range of the current Tile map, then converting the Tile map data corresponding to the current Tile map into real scene three-dimensional data and outputting;

[0075] S6: if the application space range intersects with the space range of the current Tile map, acquiring an intersection region of the space range of the current Tile map and the application space range, performing clipping on the current Tile map according to the intersection region, retaining the Tile map data in the clipping region, converting the Tile map data in the clipping region into real scene three-dimensional data and outputting, to obtain real scene three-dimensional data results.

[0076] ​Specifically, the application discloses a real scene three-dimensional file data application method, which comprises the following steps.

[0077] Step 1: data acquisition: acquiring real scene three-dimensional data such as DEM (digital elevation model), DOM (digital orthophoto map), DSM (digital surface model) and oblique photography which needs data application, and storing the data in a file server in a data scale and sheet manner.

[0078] Step 2: data application semanticization: through data application data self-defined range and application administrative division information, semanticization tools (such as text2sql) are used to convert into split statements, the application space range is obtained, and geojson format is returned.

[0079] Step 3: calculating data sheet range: inputting geojson space return to obtain sheet range information of real scene three-dimensional data, and the calculation steps are as follows:

[0080] Tile operation rule: real scene three-dimensional data is stored in a quadtree tiling structure, each Tile is recursively divided by 4 to the power of N, the higher the level (the larger the value), the lower the precision, and the smaller the data amount (for example: L1 level (original precision) → L2 level (4 sub-blocks) → L3 level (16 sub-blocks)), the Tile is quickly positioned through a quadtree index, a parent node contains four child nodes, and the row and column numbers of the child nodes are twice the row and column numbers of the parent node (for example, the child nodes of the parent node Tile_1_1_1 are Tile_2_2_2, Tile_2_3_2 and the like).

[0081] According to the application space range of step 2, the Tile row and column numbers of the corresponding sheet data are queried.

[0082] 2.1, all point string information in the geojson range is obtained, and coordinate conversion is carried out (taking longitude as an example)

[0083] ;

[0084] In the formula, the Tile column number represents the real scene three-dimensional column number result to be queried, the Tile width is the longitude range covered by a single Tile at the level, which is determined by the scale; Lng represents the longitude information of the input point, and the Lng origin is the real scene three-dimensional origin longitude information stored in a metadata file (such as metadata.xml); and Z represents the zooming scale of the real scene three-dimensional data.

[0085] The latitude calculation coordinate conversion is the same, the longitude parameter in the formula is replaced, and the calculation formula is as follows:

[0086] ;

[0087] 2.2, Range calculation, input geographic range (minLon, minLat, maxLon, maxLat), zoom level Z, convert minLon / minLat and maxLon / maxLat to the start Tile column number and row number and the end Tile column number and row number of the corresponding level respectively:

[0088] ;

[0089] ;

[0090] ;

[0091] ;

[0092] wherein, / Y represents the start row number and column number, EndX / Y represents the end row number and column number, minLon is the minimum longitude, maxLon is the maximum longitude; minLat is the minimum latitude, maxLat is the maximum latitude, and Z is the zoom level.

[0093] 2.3, Traverse the row and column number range [StartX, EndX] x [StartY, EndY], generate all Tile row and column number combinations.

[0094] Step 4: Calculate the map sheet relationship: get all the row and column numbers, traverse the spatial range information of each Tile map sheet obtained in step 3, calculate the position relationship with the current range, and the calculation steps are as follows:

[0095] 4.1, Containment relationship judgment: if the claim spatial range surface A contains the Tile current map range surface B, then there is the following formula:

[0096] A ⊇ B ⟺ ∀P ∈ B, P ∈ A;

[0097] Need to determine whether all vertices of B are in A, and the edges of B have no intersection with the edges of A (or only touch the boundary).

[0098] 4.2, Intersection relationship judgment: if the left lower corner (x1, y1) and the right upper corner (x2, y2) of the claim spatial range and the left lower corner (a1, b1) and the right upper corner (a2, b2) of the Tile map range surface satisfy:

[0099] max(x1, a1) < min(x2, a2) & max(y1, b1) < min(y2, b2);

[0100] then the claim spatial range surface and the current Tile map range intersect.

[0101] Contains: Directly output the corresponding real three-dimensional data of the current single tile map range data corresponding to step 1.

[0102] 4.3, Map intersection space range calculation, wherein the calculation process is as follows:

[0103] 1. Perform merge analysis between the space range surface and the current tile map range surface, calculate the intersection point (perform clipping operation);

[0104] 2, output the node and chain, and build the coordinate string information of the viewable surface;

[0105] 3, establish topology and new object, and generate surface object;

[0106] 4, remove a large number of broken polygons, and fuse similar polygons;

[0107] 5, repeat steps 1-4 to obtain the intersection area of the viewable domain.

[0108] Step 5: Real three-dimensional automatic clipping: The map information of the containing relationship does not participate in the clipping calculation, and the intersection space range generates two-dimensional data participating in the real three-dimensional data clipping, and the calculation steps are as follows:

[0109] 5.1, convert the range geojson data generated by the intersection into GeoRegion format;

[0110] 5.2, use proj4js or GDAL tool for coordinate conversion, and keep consistent with the tile map coordinate system.

[0111] 5.3, define a three-dimensional clipping space plane group, and the calculation steps are as follows:

[0112] Calculate the convex hull: use the Delaunay triangulation tool to convert the irregular polygon of GeoRegion into a convex polygon.

[0113] Generate bounding box plane: calculate the minimum / maximum X, Y values according to the convex hull vertex, generate a vertical plane, and the formula of the vertical plane is as follows:

[0114]

[0115] Where: (A, B, C) is the normal vector of the plane, which determines the orientation of the plane. D is the offset of the plane to the origin, which determines the position of the plane. If the result is positive, it means that the point is on the side of the plane normal vector direction (reserved); if it is negative, it means that the point is on the opposite side of the plane; if it is 0, it means that it is located on the plane, x, y, x are the longitude, latitude and elevation information of the convex hull vertex respectively.

[0116] According to the minimum / maximum X / Y value calculated by the convex vertex, 4 vertical planes can be obtained:

[0117] ;

[0118] From top to bottom, they are right plane, left plane, front plane and back plane.

[0119] Generate height constraint planes. According to the maximum and minimum values of Z in the metadata file (such as metadata.xml) of the real scene three-dimensional, the upper and lower planes can be generated, and the results are as follows:

[0120] ;

[0121] 5.4, traverse all model vertices of the Tile map, and use OpenSceneGraph (OSG) to determine whether they are inside the vertical clipping plane and the upper and lower planes.

[0122] 5.5, patch reorganization: reconstruct the topological relationship of the retained patches to avoid breaking caused by clipping. The steps are as follows:

[0123] (1) extract the inside vertices of the retained model;

[0124] (2) regenerate triangular mesh (use Delaunay triangulation or incremental method);

[0125] (3) repair texture coordinates (use UV mapping);

[0126] 5.6, configure the output path of the clipping result;

[0127] 5.7, configure the data name of the clipping result, and the naming rule is Tile map number + data name + clipping timestamp;

[0128] 5.8, input the input file, clipping range, output path and other parameters, retain the data in the clipping area, and exclude the external data;

[0129] 5.9, real scene three-dimensional result data post-processing: use LOD optimization on the clipped model data to generate multi-level details and balance rendering performance and accuracy;

[0130] 5.10, convert the data into real scene three-dimensional data (such as osgb) format and output to the specified path.

[0131] Step 6: clipping data result automatic packaging, the steps are as follows:

[0132] 6.1, create Zip output stream: specify the path of the compressed ZIP file;

[0133] 6.2, recursively traverse the real three-dimensional data folder: get all files and subfolders in the folder;

[0134] 6.3, add files to the Zip stream: convert each file to ZipEntry and write to the compressed package.

[0135] Step 7: push the path and basic information of the real three-dimensional data result to the data processing system.

[0136] Step 8: complete the real three-dimensional data projection conversion using GDAL tools.

[0137] Step 9: generate real three-dimensional data cache configuration file.

[0138] Step 10: generate real three-dimensional data cache, add cache to three-dimensional data scene.

[0139] Step 11: save the map and workspace, publish vector map service and three-dimensional data service. The steps are as follows:

[0140] 11.1, connect the data service publishing platform using the username and password;

[0141] 11.2, get the real three-dimensional data type workspace location and copy the data workspace path address;

[0142] 11.3, automatically generate real three-dimensional metadata information according to the configuration file;

[0143] 11.4, according to the real three-dimensional data type and working path, call the data service publishing interface.

[0144] Step 12: automatically register the service to the real three-dimensional GIS data platform, complete the three-dimensional service superposition and display of the real three-dimensional data result.

[0145] The real three-dimensional archive data application method, device and readable storage medium provided by the application can accurately position the spatial range and object category corresponding to the user's application data, replace the traditional manual screening operation, improve the intelligent extraction capability and spatial accuracy; According to different data levels, security requirements or user roles, automatically execute hierarchical clipping strategy, control the precision and region of real three-dimensional data, support flexible configuration and on-demand delivery of data, improve system resource utilization and publishing efficiency; Build a real three-dimensional data publishing system linked with the clipping result, realize the whole process controllable data visualization and delivery mechanism, prevent unauthorized access and data leakage, and enhance the system data security and sensitive area protection capability. Integrate user request submission, semantic processing, data clipping, and release notification steps to form an automatic processing chain without manual intervention, realize the automatic closed loop of "user initiation-system response-data delivery", and significantly improve the efficiency and service response speed.

[0146] The above merely describes the preferred embodiments of the present application, and it should be pointed out that those skilled in the art can make several improvements and refinements without departing from the technical principles of the present application, and these improvements and refinements should also be considered as falling within the protection scope of the present application.

Claims

1. A method for real-time three-dimensional archival data retrieval, characterized by, The application relates to a method for outputting real three-dimensional data based on data application. The method comprises the following steps: acquiring real three-dimensional data and a spatial range of a data application; processing the real three-dimensional data based on a Tile operation rule to obtain Tile map data; inquiring all Tile maps corresponding to the spatial range of the data application in the Tile map data and acquiring the spatial range of each Tile map; judging the positional relationship between the spatial range of each Tile map and the spatial range of the data application; if the spatial range of the data application contains the spatial range of the current Tile map, converting the Tile map data corresponding to the current Tile map into real three-dimensional data and then outputting the real three-dimensional data; 2. A method of issuing a real scene three-dimensional archive data according to claim 1, characterized in that, if the spatial range of the data application intersects with the spatial range of the current Tile map, acquiring the intersection area of the spatial range of the current Tile map and the spatial range of the data application, cutting the current Tile map according to the intersection area, reserving the Tile map data of the cutting area, converting the Tile map data in the cutting area into real three-dimensional data and then outputting the real three-dimensional data to obtain real three-dimensional data results. The method for acquiring real three-dimensional data and a spatial range of a data application comprises the following steps: acquiring real three-dimensional data, wherein the real three-dimensional data comprises digital elevation model data, digital orthophoto map data, digital surface model data and oblique photography data; storing the real three-dimensional data in a file server in a way of being divided into maps according to a data scale; acquiring a spatial range of a data application, wherein the spatial range of the data application comprises preset ranges and administrative division information, the preset ranges comprise administrative region position information described by texts, and the administrative division information comprises administrative region names and coordinate information of administrative region spatial ranges; 3. A method of issuing a real scene three-dimensional archive data according to claim 2, characterized in that, translating the spatial range of the data application into split statements by using a semantic tool and returning the split statements in a geojson format. inquiring all Tile maps corresponding to the spatial range of the data application in the Tile map data and acquiring the spatial range of each Tile map, which comprises the following steps: acquiring all point string information in the spatial range of the data application, wherein the point string information is all coordinate information in the administrative region spatial range; ; ; performing coordinate conversion on the point string information, and the coordinate conversion formula is as follows: wherein, Tile column number represents a real three-dimensional column number result to be inquired, Tile row number represents a real three-dimensional row number result to be inquired, Tile width is a longitude range covered by a single Tile at a level and is determined by a scale; Lng represents longitude information of a point to be input, Lng original point is original longitude information of real three-dimensional data stored in a metadata file, Tile' width is a latitude range covered by a single Tile' at the level and is determined by the scale, Lng' represents latitude information of the point to be input, Lng' original point is original latitude information of the real three-dimensional data stored in the metadata file, and Z represents a zooming scale of the real three-dimensional data; converting the administrative region spatial range (minLon, minLat, maxLon, maxLat) into Tile column number and row number of a corresponding level, and the conversion formula is as follows: ; ; ; ; In the formula, StartX / Y represents the starting row number and column number, EndX / Y represents the ending row number and column number, minLon is the minimum longitude, maxLon is the maximum longitude; minLat is the minimum latitude, maxLat is the maximum latitude, and Z is the zoom level.

4. A method of claiming real scene three-dimensional archival data according to claim 1 or 3, characterized in that, Determine the spatial range of each Tile map and the positional relationship of the claimed spatial range, including: If all the vertices in the spatial range of the current Tile map are within the claimed spatial range, and the edges of the spatial range of the current Tile map do not intersect with the edges of the claimed spatial range, it means that the claimed spatial range contains the spatial range of the current Tile map; If the bottom-left corner coordinate (x1, y1) and the top-right corner coordinate (x2, y2) of the claimed spatial range satisfy: max(x1, a1) < min(x2, a2) & max(y1, b1) < min(y2, b2), Then determine that the spatial range of the current Tile map intersects with the claimed spatial range.

5. A method according to claim 1 or 3, wherein, By performing a clipping operation on the spatial range of the current Tile map and the claimed spatial range, the intersection area of the spatial range of the current Tile map and the claimed spatial range is obtained.

6. A method of issuing a real scene three-dimensional archive data according to claim 3, wherein, According to the intersection area, clip the current Tile map, including: Convert the geojson data corresponding to the intersection area in the claimed spatial range to GeoRegion format data; Perform coordinate conversion on the converted data to keep the coordinate system consistent with that of the current Tile map; Construct a three-dimensional clipping space plane group according to the GeoRegion format; Iterate through all the model vertices of the current Tile map to determine whether the vertices are inside the three-dimensional clipping space plane group; Keep the vertices inside the three-dimensional clipping space plane group and construct a clipping area according to these vertices.

7. A method of issuing a real scene three-dimensional archive data according to claim 6, characterized in that, Construct a three-dimensional clipping space plane group according to the GeoRegion format, including: Convert the GeoRegion format data to a convex polygon according to the Delaunay triangulation tool; Calculate the minimum X and Y values and the maximum X and Y values according to the vertices of the convex polygon, and generate four vertical planes, namely the right plane, the left plane, the front plane, and the back plane; Calculate the maximum Z value and the minimum Z value according to the elevation data in the digital elevation model data, and generate the upper plane and the lower plane; Construct a three-dimensional clipping space plane group according to the right plane, the left plane, the front plane, the back plane, the upper plane, and the lower plane.

8. A method of issuing a real scene three-dimensional archive data according to claim 7, characterized in that, Also includes: Output the real three-dimensional data result to a specified path; Automatically package the output real three-dimensional data result; Use the GDAL tool to complete the projection conversion of the real three-dimensional data result, generate a real three-dimensional data result cache configuration file, a real three-dimensional data result cache, and add the cache to the three-dimensional data scene; Save the map and workspace, publish the vector map service and three-dimensional data service, and the steps are as follows: Connect the data service publishing platform using a username and password; Obtaining the type of real three-dimensional data achievement and data workspace, copying the data workspace path address; According to the configuration file, automatically generating the metadata information of real three-dimensional; According to the type of real three-dimensional data and the workspace path address, calling the data service publishing interface; Registering the map service and three-dimensional data service to the real three-dimensional GIS data platform automatically, completing the three-dimensional service superposition and display of real three-dimensional data achievement.

9. A live three-dimensional archival data retrieval device, characterized by, It comprises: The acquisition module is used for acquiring real three-dimensional data and data application space range; The framing module is used for carrying out framing processing on the real three-dimensional data based on the Tile operation rule, and obtaining Tile map data; The query module is used for querying all Tile maps corresponding to the application space range in the Tile map data, and acquiring the space range of each Tile map; The judgment module is used for judging the positional relationship between the space range of each Tile map and the application space range; The first output module is used for converting the Tile map data corresponding to the current Tile map into real three-dimensional data and outputting if the application space range contains the space range of the current Tile map; The second output module is used for obtaining the intersection area of the space range of the current Tile map and the application space range if the application space range intersects with the space range of the current Tile map, carrying out cutting on the current Tile map according to the intersection area, reserving the Tile map data of the cutting area, converting the Tile map data in the cutting area into real three-dimensional data and outputting, and obtaining real three-dimensional data achievement.

10. A readable storage medium, characterized by, The readable storage medium has a computer program stored thereon, and the computer program is executed by the processor to realize the steps of the real three-dimensional archive data application method in any one of claims 1 to 8.

Citation Information

Patent Citations

  • Three-dimensional picture clipping method, representing method and processing device thereof

    CN102184572A

  • Virtual reality three-dimensional scene loading and rendering method and device and terminal equipment

    CN113516769A

  • Method for real-time display of cloud three-dimensional reconstruction data

    CN114863024A

  • Distributed slicing method and distributed slicing device for framing images

    CN115689886A

  • Three-dimensional expression form basic geographic entity construction method considering morphological constraints

    CN118334262A