CN115471617A - Local updating method for large-scene real-scene three-dimensional slice data - Google Patents

Local updating method for large-scene real-scene three-dimensional slice data Download PDF

Info

Publication number
CN115471617A
CN115471617A CN202211263147.0A CN202211263147A CN115471617A CN 115471617 A CN115471617 A CN 115471617A CN 202211263147 A CN202211263147 A CN 202211263147A CN 115471617 A CN115471617 A CN 115471617A
Authority
CN
China
Prior art keywords
scene
updated
data
service
single building
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211263147.0A
Other languages
Chinese (zh)
Inventor
刘柄宏
孔凡强
张剑
叶远智
冯存钧
王晓辉
赵鹏程
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Institute Of Surveying And Mapping Science And Technology
Original Assignee
Zhejiang Institute Of Surveying And Mapping Science And Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Institute Of Surveying And Mapping Science And Technology filed Critical Zhejiang Institute Of Surveying And Mapping Science And Technology
Priority to CN202211263147.0A priority Critical patent/CN115471617A/en
Publication of CN115471617A publication Critical patent/CN115471617A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/005Tree description, e.g. octree, quadtree
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/10Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Geometry (AREA)
  • Computer Graphics (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention discloses a local updating method of large-scene real-scene three-dimensional slice data, which comprises the following steps of: acquiring a service to be updated, wherein the service to be updated adopts a quadtree algorithm to generate a pyramid structure slice; calculating the slice level which needs to be generated by the service needing to be updated; judging whether the updated data contains the single buildings; if the single building is not contained, replacing the updated slice data into a corresponding row and column number folder in the original service; and if the single buildings are contained, respectively covering the updated single buildings and the non-single building slices into the corresponding row column number folders in the original service. According to the local updating method of the large-scene real-scene three-dimensional slice data, only the updated elements in the scene are sliced, and scene service fusion is performed based on the slices, so that the large-scene global updating is avoided, the repeated loading of the slices is avoided, the service data volume is reduced, and the updating efficiency and the display effect of the large-scene elements are improved.

Description

Local updating method for large-scene real-scene three-dimensional slice data
Technical Field
The invention relates to a local updating method of large-scene real-scene three-dimensional slice data.
Background
At present, large-scene real-scene three-dimensional oblique photography data are generally processed into three-dimensional slices for browsing and application due to large data volume and low loading speed. When the local data changes, two ways are generally adopted for updating at the present stage. The first is a global update mode, i.e. original oblique photography data is processed, updated elements are fused, and then global slicing is performed again to replace the original live-action three-dimensional slice. The obvious disadvantage of this method is that once any element of a large scene is updated, the large scene needs to be re-sliced, which is time-consuming and labor-consuming, and is difficult to deal with the requirement of fast update of data. The second mode is to adopt an overlay display updating mode, that is, the updated element slice is directly loaded on the existing slice, so that the latest updated slice is overlaid on the original position of the updated element for displaying. The biggest disadvantage of this method is that the oblique photograph slices are loaded repeatedly at the same place, which increases the service data volume and affects the data loading speed.
Disclosure of Invention
The invention provides a local updating method of large-scene real-scene three-dimensional slice data, which solves the technical problems and specifically adopts the following technical scheme:
a local updating method for large-scene real-scene three-dimensional slice data comprises the following steps:
(1) Acquiring a service to be updated, wherein the service to be updated comprises a pyramid structure slice generated by adopting a quadtree algorithm;
(2) Calculating the slice level required to be generated by the service needing to be updated;
(3) Judging whether the updated data contains the single building;
(4) If the single building is not contained, replacing the updated slice data into a corresponding row column number folder in the original service;
(5) And if the single buildings are contained, respectively covering the updated single buildings and the non-single building slices into the corresponding row column number folders in the original service.
As an implementation manner, the step (1) obtains a service to be updated, where the service to be updated includes a pyramid-structured slice generated by using a quadtree algorithm, and includes the following steps:
(2.1) judging whether the service needing to be updated adopts a quadtree algorithm to generate a pyramid structure slice;
and (2.2) if the service needing to be updated does not adopt the quadtree algorithm, generating a pyramid structure slice based on the quadtree algorithm.
As an implementable manner, the step (2) calculates the slice level that needs to be generated by the service that needs to be updated, and the steps are as follows:
(3.1) acquiring the maximum row number and the maximum column number of the original inclination data, namely rowMax and colMax;
(3.2) calculating the level N of the original tilt based on the quadtree splitting principle, wherein the formula is as follows:
N=[log 2 (Max(rowMax,colMax))],
where N is the slice level, max () represents the maximum value taken therein, and [ ] represents the integer taken.
As an implementation manner, if step (4) does not include a single building, replacing the updated slice data into the corresponding row and column number folder in the original service, and the steps are as follows:
(4.1) slicing the update data;
and (4.2) replacing the slice data into a corresponding row-column number folder in the original service.
As an implementation manner, if the single building is included in the step (5), the updated single building and the non-single building slices are respectively covered in the corresponding row column number folders in the original service, and the steps are as follows:
(5.1) flattening the original oblique photography data of the oblique block where the single building is located;
(5.2) carrying out format conversion on the flattened oblique photography data and the single building to convert the flattened oblique photography data and the single building into 3D Tiles format slice data;
(5.3) calculating the row number and column number positions of the monomer building, namely row and col;
(5.4) replacing 3D Tiles formatted slice data of the non-single building into a corresponding row-column number folder in the original service;
(5.5) replace the 3D Tiles format tile data for the individual building into the row and column number folder calculated (5.3).
As an implementation manner, the step (5.1) of flattening the original oblique photography data of the oblique block where the single building is located includes the following steps:
(6.1) obtaining a projection surface of the single building;
(6.2) acquiring original oblique photography data of an oblique block where the single building is located;
and (6.3) flattening the original oblique photography data of the oblique block where the single building is located according to the data of the projection plane of the single building.
As an implementation, the step (5.3) of calculating the row number and column number positions of the single buildings comprises the following steps:
(7.1) judging whether the single building spans the oblique photography framing or not;
(7.2) if the single building does not cross the district, the row and column number of the single building is the framing number;
(7.3) if the single buildings cross the district, the row and column numbers completely containing the single buildings need to be searched upwards by levels, and the level row and column numbers are the positions of the row and column numbers where the single buildings are located.
As an implementation, the step (7.1) of determining whether the single building is framed across oblique photography includes the following steps:
(8.1) carrying out superposition analysis on the oblique photography framing map and the projection surface of the single building;
(8.2) if the projection plane of the single building is not intersected with the boundary of the oblique photography framing map, the single building does not cross the region; otherwise, the single building spans.
The method for locally updating the large scene live-action three-dimensional slice data has the advantages that the method for locally updating the large scene live-action three-dimensional slice data only slices the updating elements in the scene, and performs scene service fusion based on the slices, so that the large scene global updating is avoided, the repeated loading of the slices is avoided, the service data volume is reduced, and the updating efficiency and the display effect of the large scene elements are improved.
Drawings
FIG. 1 is a flow chart of a method for locally updating live-action three-dimensional slice data of a large scene according to the present invention;
fig. 2 is a diagram of the steps of calculating the row and column numbers of the single buildings across the district according to the present invention.
Detailed Description
The invention is described in detail below with reference to the figures and the embodiments.
As shown in fig. 1, a method for locally updating real-scene three-dimensional slice data of a large scene includes the following steps:
and acquiring the service to be updated, wherein the service to be updated comprises a pyramid structure slice generated by adopting a quadtree algorithm.
After the service needing to be updated is obtained, whether the service needing to be updated adopts a quadtree algorithm to generate a pyramid structure slice is judged. And if the service to be updated does not adopt the quadtree algorithm, generating the pyramid structure slice based on the quadtree algorithm.
And calculating the slice level which needs to be generated by the service needing to be updated.
The specific method for calculating the slice level required to be generated by the service needing to be updated comprises the following steps:
the maximum line column number of the original oblique photography data area is calculated and set to (rowMax, colMax).
The slice level is calculated according to the following formula,
N=[log 2 (Max(rowMax,colMax))],
where N is the slice level, max () represents the maximum value taken therein, and [ ] denotes the rounding operation.
Taking the navian-city range as an example, the reference ellipsoid of the original oblique photography data of the navian-city range is CGCS2000, the projection is a gaussian projection with 3 degrees of central meridian 122.25 degrees, the coordinate of the central point is (480000,3322000), the central point is divided into blocks by taking the central point to the east and the north, taking the south and the west as the negatives, and taking one row and one column at intervals of 100 meters, each block of data is stored in one folder, and the folders are named by row and column numbers. The maximum row and column number in the data is (230, 248), mmax is first determined,
Mmax={|230|,|248|}=248,
the current corresponding slice level N of the data is then calculated,
N=[log 2 (248)]=8
the current corresponding slice level of the Zhoushan city region range is represented as level 8, and then level 1-7 slices are reconstructed at the top layer of the inverse quad-tree algorithm.
And judging whether the updating data in the service needing updating contains the single building.
If the single building is not contained, executing a first processing step:
the update data is sliced directly. And replacing the updated slice data into the corresponding row column number folder in the original service.
If the single building is contained, executing a second processing step:
specifically, flattening processing is performed on the original oblique photography data of the oblique block where the single building is located. The specific method for flattening the original oblique photography data of the oblique block where the single building is located comprises the following steps: and obtaining a single building projection surface. And acquiring original oblique photography data of the oblique block where the single building is located. And flattening the original oblique photographing data of the oblique block where the single building is located according to the data of the projection surface of the single building.
And converting the format of the flattened oblique photography data and the format of the single building into 3D Tiles format slice data.
And calculating the row number and column number positions of the single buildings, namely row and col.
And replacing the 3D Tiles formatted slice data of the non-single building into a corresponding row and column number folder in the original service.
And replacing the 3D Tiles format slice data of the single building into the calculated corresponding row and column number folder.
After the 3D Tiles format slice data is replaced into the corresponding row column number folder in the original service, the second processing step further comprises the step of carrying out superposition analysis on the single buildings to judge whether the single buildings cross the region or not.
Specifically, a specific method for performing superposition analysis on the single building to judge whether the single building is across the region comprises the following steps:
and superposing the oblique photography framing map and the projection surface of the single building.
And judging whether the oblique photography framing map completely contains the projection plane of the single building.
If the oblique photography framing map completely contains the projection plane of the single building, the single building does not cross the region.
If the oblique photography framing chart does not completely contain the projection surface of the single building, the single building spans.
Further, calculating the row and column number of the single building.
The row and column numbers of the single buildings are calculated through the superposition result of the oblique photography framing chart and the projection surface of the single buildings.
If the single building does not cross the region, the single building is completely located in a certain region, and the row number and the column number of the region are the row number and the column number of the single building.
If the single building is cross-regional, the inclined blocks completely containing the projection plane of the single building need to be calculated upwards layer by layer, and the grade row and column number of the inclined blocks is the grade row and column number of the building. The row and column numbers completely containing the single buildings are searched upwards level by level, and the row and column numbers of the level are the positions of the row and column numbers where the single buildings are located.
The calculation steps are as shown in the attached figure 2, and the maximum column number, the minimum column number, the maximum row number and the minimum row number of the area spanned by the single building are respectively ColMax, colMin, rowMax and RowMin. The method comprises the following specific steps:
and recursively calculating two groups of values [ ColMax/2], [ ColMin/2], [ RowMax/2], [ RowMin/2] until the two groups of values are equal, wherein [ ] represents a rounding operation, and recording the recursion times as i and j respectively.
Calculating m = Max (i, j) -Min (i, j), wherein Max represents a larger value and Min represents a smaller value.Then C = [ ColMax/2] m ]、R=[RowMax/2 m ]L = N-m, where N is the result of the calculation in step 3.2.
L, R, C is the level, row number and column number of the individual building.
And replacing the 3D Tiles formatted slice data of the non-single buildings and the single buildings into corresponding level row column number folders in the original service.
The service update is completed through the above steps.
Compared with a global updating mode, the local updating method for the large-scene real-scene three-dimensional slice data only slices the updating elements in the scene by adopting the large-scene three-dimensional slice local updating mode, and performs scene service fusion based on the slices, so that the large-scene global updating is avoided, and the updating efficiency of the large-scene elements is improved. Compared with an overlapped display updating mode, the scheme that original oblique photography data are adopted for low-level slices, and updated data are adopted for high-level slices to replace original data can take balance between model fineness and data request quantity into consideration, so that the model after fusion requests less data, the speed is higher, the model is finer, and the rendering efficiency is higher.
The foregoing illustrates and describes the principles, general features, and advantages of the present invention. It should be understood by those skilled in the art that the above embodiments do not limit the present invention in any way, and all technical solutions obtained by using equivalent alternatives or equivalent variations fall within the scope of the present invention.

Claims (8)

1. A local updating method for large scene real scene three-dimensional slice data is characterized by comprising the following steps:
(1) Acquiring a service to be updated, wherein the service to be updated comprises a pyramid structure slice generated by adopting a quadtree algorithm;
(2) Calculating the slice level which needs to be generated by the service needing to be updated;
(3) Judging whether the updated data contains the single buildings;
(4) If the single building is not contained, replacing the updated slice data into a corresponding row and column number folder in the original service;
(5) And if the single buildings are contained, respectively covering the updated single buildings and the non-single building slices into the corresponding row column number folders in the original service.
2. The local updating method of the large-scene real-scene three-dimensional slice data according to claim 1, wherein the step (1) obtains the service to be updated, the service to be updated comprises a pyramid-structured slice generated by a quadtree algorithm, and the steps are as follows:
(2.1) judging whether the service needing to be updated adopts a quadtree algorithm to generate a pyramid structure slice;
and (2.2) if the service needing to be updated does not adopt the quadtree algorithm, generating a pyramid structure slice based on the quadtree algorithm.
3. The local updating method of three-dimensional slice data of large scene real scene as claimed in claim 1, wherein the step (2) calculates the slice level that needs to be generated by the service needing updating, and comprises the following steps:
(3.1) acquiring the maximum row number and the maximum column number of the original inclination data;
(3.2) calculating the level N of the original tilt based on the quadtree partitioning principle.
4. The local updating method of the large-scene real-scene three-dimensional slice data according to claim 1, wherein the step (4) replaces the updated slice data into the corresponding row column number folder in the original service if the single building is not included, and comprises the following steps:
(4.1) slicing the update data;
and (4.2) replacing the slice data into a corresponding row and column number folder in the original service.
5. The local updating method of the large-scene real-scene three-dimensional slice data according to claim 1, wherein the step (5) is to overlay the updated monomer building and non-monomer building slices into the corresponding row column number folder in the original service, if the monomer building is included, and the steps are as follows:
(5.1) flattening the original oblique photography data of the oblique block where the single building is located;
(5.2) carrying out format conversion on the flattened oblique photography data and the single building to convert the flattened oblique photography data and the single building into 3D Tiles format slice data;
(5.3) calculating the row number and column number positions of the single buildings;
(5.4) replacing 3D Tiles formatted slice data of the non-single building into a corresponding row-column number folder in the original service;
(5.5) replace the 3D Tiles format tile data for the individual building into the row and column number folder calculated (5.3).
6. The local updating method of the large scene real-scene three-dimensional slice data according to claim 5, wherein the step (5.1) flattens the original oblique photography data of the oblique block where the single building is located, and comprises the following steps:
(6.1) obtaining a projection surface of the single building;
(6.2) acquiring original oblique photography data of an oblique block where the single building is located;
and (6.3) flattening the original oblique photographing data of the oblique block where the single building is located according to the data of the projection surface of the single building.
7. The local updating method of the large-scene live-action three-dimensional slice data according to claim 5, wherein the step (5.3) of calculating the row and column number positions of the single buildings comprises the following steps:
(7.1) judging whether the single building spans the oblique photography framing or not;
(7.2) if the single building does not cross the district, the row and column number of the single building is the framing number;
(7.3) if the single buildings cross the district, the row and column numbers completely containing the single buildings need to be searched upwards by levels, and the level row and column numbers are the positions of the row and column numbers where the single buildings are located.
8. The method of claim 7, wherein the step (7.1) of determining whether the monolithic building is framed across oblique photography comprises the steps of:
(8.1) carrying out superposition analysis on the oblique photography framing map and the projection surface of the single building;
and (8.2) if the projection plane of the single building is not intersected with the boundary of the oblique photography framing map, the single building does not cross the region, otherwise, the single building crosses the region.
CN202211263147.0A 2022-10-14 2022-10-14 Local updating method for large-scene real-scene three-dimensional slice data Pending CN115471617A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211263147.0A CN115471617A (en) 2022-10-14 2022-10-14 Local updating method for large-scene real-scene three-dimensional slice data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211263147.0A CN115471617A (en) 2022-10-14 2022-10-14 Local updating method for large-scene real-scene three-dimensional slice data

Publications (1)

Publication Number Publication Date
CN115471617A true CN115471617A (en) 2022-12-13

Family

ID=84336750

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211263147.0A Pending CN115471617A (en) 2022-10-14 2022-10-14 Local updating method for large-scene real-scene three-dimensional slice data

Country Status (1)

Country Link
CN (1) CN115471617A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116226131A (en) * 2023-03-07 2023-06-06 易智瑞信息技术有限公司 Multi-temporal three-dimensional slice data storage method and device under multi-tree structure
CN117351170A (en) * 2023-10-09 2024-01-05 北京达美盛软件股份有限公司 Method and system for realizing regional three-dimensional model replacement

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116226131A (en) * 2023-03-07 2023-06-06 易智瑞信息技术有限公司 Multi-temporal three-dimensional slice data storage method and device under multi-tree structure
CN116226131B (en) * 2023-03-07 2024-03-19 易智瑞信息技术有限公司 Multi-temporal three-dimensional slice data storage method and device under multi-tree structure
CN117351170A (en) * 2023-10-09 2024-01-05 北京达美盛软件股份有限公司 Method and system for realizing regional three-dimensional model replacement

Similar Documents

Publication Publication Date Title
CN115471617A (en) Local updating method for large-scene real-scene three-dimensional slice data
CN110555119B (en) Unmanned aerial vehicle remote sensing image slicing method and system under real-time scene
CN109493407A (en) Realize the method, apparatus and computer equipment of laser point cloud denseization
CN111090716B (en) Vector tile data processing method, device, equipment and storage medium
JP2010518458A (en) Case / partial differential expression based blanking technique and related accuracy evaluation
US20090085915A1 (en) Geospatial modeling system providing user-selectable building shape options and related methods
US8099264B2 (en) Geospatial modeling system providing inpainting and error calculation features and related methods
CN115797592B (en) Method and device for automatically generating building block based on oblique photography three-dimensional model
CN110865750B (en) Stepless zooming display method of tile map
CN114219819A (en) Oblique photography model unitization method based on orthoscopic image boundary detection
CN110335354B (en) Modularized 3D modeling method and device
CN112017285B (en) Method for accurately fitting terrain to strip-shaped model in three-dimensional GIS (geographic information System) in real time
CN106611438B (en) Local area updating and map cutting method and device of three-dimensional simulation map
CN111090712A (en) Data processing method, device and equipment and computer storage medium
CN113750516A (en) Method, system and equipment for realizing three-dimensional GIS data loading in game engine
CN114549772A (en) Multi-source three-dimensional model fusion processing method and system based on engineering independent coordinate system
JP2010525491A (en) Geospatial modeling system and associated method for providing data decimation of geospatial data
RU2296368C2 (en) Method for cutting off a line and method for displaying three-dimensional image based on this method
KR20070099298A (en) Method and apparatus for three-dimensional form generation for mobile navigation
CN114328795B (en) Live-action three-dimensional data processing method, device, server and storage medium
CN102117493B (en) Method and device for updating data in three-dimensional modeling
CN114926646A (en) Remote sensing image elevation extraction method fusing context information
CN102117495B (en) New data partitioning method and device in three-dimensional modeling
CN112381715A (en) Method and device for parallelly generating map tiles by mass remote sensing images
CN112907752A (en) Point cloud slice processing method based on global index

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination