CN111854683A - Method, device and equipment for three-dimensional spatial data elevation sampling - Google Patents
Method, device and equipment for three-dimensional spatial data elevation sampling Download PDFInfo
- Publication number
- CN111854683A CN111854683A CN202010690291.7A CN202010690291A CN111854683A CN 111854683 A CN111854683 A CN 111854683A CN 202010690291 A CN202010690291 A CN 202010690291A CN 111854683 A CN111854683 A CN 111854683A
- Authority
- CN
- China
- Prior art keywords
- elevation
- triangular patch
- sampling
- dimensional
- node
- 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.)
- Granted
Links
- 238000005070 sampling Methods 0.000 title claims abstract description 125
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000013507 mapping Methods 0.000 claims description 29
- 239000003086 colorant Substances 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000004422 calculation algorithm Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 229910052930 hexahydrite Inorganic materials 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C5/00—Measuring height; Measuring distances transverse to line of sight; Levelling between separated points; Surveyors' levels
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T19/00—Manipulating 3D models or images for computer graphics
- G06T19/20—Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
Abstract
The application relates to the technical field of three-dimensional geographic information, and discloses a method for three-dimensional spatial data elevation sampling. The method comprises the following steps: acquiring a three-dimensional geometric body list; obtaining triangular patch information according to the three-dimensional geometric body list; obtaining a triangular patch spatial index according to the triangular patch information; and performing elevation sampling according to the space index of the triangular patch to obtain an elevation value of the sampling point. According to the method, the triangular patch information is obtained through the three-dimensional geometry list, so that the triangular patch spatial index is obtained, the elevation sampling is performed through the triangular patch spatial index, so that the elevation value of a sampling point is obtained, useless data for elevation sampling such as geometry texture data, vertex colors, multiple sets of vertex texture coordinates and the like are abandoned, the efficiency of sampling three-dimensional space mass data elevation points is effectively improved, and the large-data-volume three-dimensional space data elevation sampling can be supported. The application also discloses a device and equipment for three-dimensional spatial data elevation sampling.
Description
Technical Field
The present application relates to the field of three-dimensional geographic information technology, and for example, to a method, apparatus, and device for elevation sampling of three-dimensional spatial data.
Background
At present, with the rapid development of geospatial information technology, large-scale three-dimensional city modeling engineering continuously appears, three-dimensional representation increasingly becomes a main representation mode of geospatial information, three-dimensional city models are more and more widely applied to city data processing and management, and vivid three-dimensional digital representation of cities becomes one of hot problems which are generally concerned by current city informatization because the three-dimensional digital representation shows huge application potential in numerous fields of city infrastructure management, city development decision support and the like; for example: three-dimensional Digital cities, three-dimensional spatial data, three-dimensional Model expressions, Digital Elevation Models (DEMs), Digital Surface Models (DSMs). The elevation sampling algorithm is the basis of DSM and three-dimensional scene analysis, and regular grid acquisition, profile acquisition and the like depend on the elevation sampling algorithm; the sampling algorithm extracts the height information of the model, and the extracted height data can be used for filling and excavating analysis and the like.
In the process of implementing the embodiments of the present disclosure, it is found that at least the following problems exist in the related art: the sampling efficiency of the prior art to the three-dimensional space data elevation point is low.
Disclosure of Invention
The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed embodiments. This summary is not an extensive overview nor is intended to identify key/critical elements or to delineate the scope of such embodiments but rather as a prelude to the more detailed description that is presented later.
The embodiment of the disclosure provides a method, a device and equipment for three-dimensional spatial data elevation sampling, so that the efficiency of sampling elevation points of the three-dimensional spatial data can be improved.
In some embodiments, the method comprises:
acquiring a three-dimensional geometric body list;
obtaining triangular patch information according to the three-dimensional geometry list;
obtaining a triangular patch spatial index according to the triangular patch information;
and performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of a sampling point.
In some embodiments, obtaining triangular patch information from the list of three-dimensional geometries includes:
acquiring a vertex list and a surface list of the three-dimensional geometric body;
and obtaining the triangular patch information of the three-dimensional geometric body according to the vertex list and the face list of the three-dimensional geometric body.
In some embodiments, obtaining a triangular patch spatial index from the triangular patch information comprises:
And inserting the triangular patch information into a node of a spatial index tree to obtain a triangular patch spatial index.
In some embodiments, inserting the triangular patch information into a node of a spatial index tree comprises:
and inserting the triangular patch information into a node which can surround the triangular patch information in a spatial index tree.
In some embodiments, after obtaining the triangular patch spatial index, the method further includes:
and outputting the space index of the triangular patch into a space index file of the triangular patch.
In some embodiments, performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of a sampling point includes:
establishing memory mapping for the triangular patch spatial index file;
acquiring a memory mapping basic block corresponding to each node from the memory mapping;
acquiring bounding boxes of corresponding nodes according to the memory mapping basic blocks;
under the condition that the bounding box of the node comprises a preset sampling point and the triangular surface in the surface list comprises the sampling point, acquiring a ray which takes the sampling point as an origin and is vertically upward;
taking the elevation value of the intersection point of the ray and the triangular surface as the alternative elevation value of the sampling point;
And acquiring the elevation value of the sampling point according to the alternative elevation value.
In some embodiments, further comprising: and outputting the elevation value of the sampling point.
In some embodiments, the apparatus comprises: a processor and a memory storing program instructions, the processor being configured to, when executing the program instructions, perform the method for three-dimensional spatial data elevation sampling as described above.
In some embodiments, the apparatus comprises: device for three-dimensional spatial data elevation sampling as described above
The method, the device and the equipment for elevation sampling of three-dimensional spatial data of the user provided by the embodiment of the disclosure can realize the following technical effects: the method comprises the steps of obtaining triangular surface patch information through a three-dimensional geometric body list, obtaining triangular surface patch spatial indexes, executing elevation sampling through the triangular surface patch spatial indexes, obtaining elevation values of sampling points, abandoning useless data of elevation sampling such as geometric body texture data, vertex colors, multiple sets of vertex texture coordinates and the like, effectively improving the efficiency of sampling three-dimensional space mass data elevation points, and supporting the large-data-volume three-dimensional space data elevation sampling.
The foregoing general description and the following description are exemplary and explanatory only and are not restrictive of the application.
Drawings
One or more embodiments are illustrated by way of example in the accompanying drawings, which correspond to the accompanying drawings and not in limitation thereof, in which elements having the same reference numeral designations are shown as like elements and not in limitation thereof, and wherein:
FIG. 1 is a schematic diagram of a method for elevation sampling of three-dimensional spatial data according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of an apparatus for elevation sampling of three-dimensional spatial data according to an embodiment of the present disclosure.
Detailed Description
So that the manner in which the features and elements of the disclosed embodiments can be understood in detail, a more particular description of the disclosed embodiments, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings. In the following description of the technology, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may be practiced without these details. In other instances, well-known structures and devices may be shown in simplified form in order to simplify the drawing.
The terms "first," "second," and the like in the description and in the claims, and the above-described drawings of embodiments of the present disclosure, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the present disclosure described herein may be made. Furthermore, the terms "comprising" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions.
The term "plurality" means two or more unless otherwise specified.
In the embodiment of the present disclosure, the character "/" indicates that the preceding and following objects are in an or relationship. For example, A/B represents: a or B.
The term "and/or" is an associative relationship that describes objects, meaning that three relationships may exist. For example, a and/or B, represents: a or B, or A and B.
With reference to fig. 1, an embodiment of the present disclosure provides a method for elevation sampling of three-dimensional spatial data, including:
step S101, acquiring a three-dimensional geometric body list;
step S102, triangular patch information is obtained according to the three-dimensional geometry list;
step S103, obtaining a triangular patch space index according to the triangular patch information;
and step S104, performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of the sampling point.
By adopting the method for three-dimensional space data elevation sampling provided by the embodiment of the disclosure, the triangular patch information is obtained through the three-dimensional geometric body list, so that the triangular patch spatial index is obtained, elevation sampling is performed through the triangular patch spatial index, so that the elevation value of the sampling point is obtained, data which is useless for elevation sampling, such as geometric body texture data, vertex colors, multiple sets of vertex texture coordinates and the like, is abandoned, and the efficiency for sampling three-dimensional space mass data elevation points is effectively improved.
For step S101, a three-dimensional geometry list is obtained, and in a preferred embodiment of the present invention, steps S101-1 to S101-3 are performed:
s101-1, aiming at a three-dimensional city model scene, obtaining each three-dimensional model list; for each three-dimensional model, collecting a contained geometry list GeometryList; and then collecting the GeometryLists of all models to form a TotalGeometryList of all three-dimensional geometries of the three-dimensional city model scene.
S101-2, aiming at a three-dimensional scene of an oblique photography live-action, acquiring a finest layer tile list FinestTiLEList in multilevel LOD (Levels of Detail) tiles; for each finest layer tile, collecting a geometry list geotryList contained; and further collecting the GeometryLists of all the finest layer tiles to form TotalGeometryLists of all the three-dimensional geometry lists of the oblique photography live-action three-dimensional scene.
S101-3, directly obtaining a geometry list GeometryList of the three-dimensional model aiming at the single three-dimensional model, wherein the geometry list GeometryList is the three-dimensional geometry list TotalGeometryList.
For step S102, obtaining triangular patch information according to the three-dimensional geometry list, including: acquiring a vertex list and a surface list of the three-dimensional geometric body; and obtaining the triangular patch information of the three-dimensional geometry according to the vertex list and the face list of the three-dimensional geometry. In a preferred embodiment of the present invention, steps S102-1 to S102-3 are performed:
S102-1, obtaining a vertex list VertexList { (V) of the three-dimensional geometryi.x,Vi.y,ViZ) } (0. ltoreq. i < m); m is a positive integer, and m is the length of a vertex list of the three-dimensional geometric body; viFor the ith vertex in the VertexList, each vertex contains three-dimensional spatial coordinates (x, y, z).
S102-2, a face list FaceList { (F) of the three-dimensional geometry is obtainedj.u,Fj.v,FjW) } (0 ≦ j < n); n is a positive integer, n is the length of the face list of the three-dimensional geometry; fjIs the jth triangle face in FaceList, each triangle face being composed of a triplet (u, v, w) that is a subscript of each of the three vertices that make up the corresponding triangle face in the vertex list VertexList.
S102-3, obtaining a triangular patch vertex and bounding box information list of the three-dimensional geometry, namely a triangular patch information hexahydric group list TotalFaceInfoList, according to the vertex list VertexList and the face list FaceList of the three-dimensional geometry. In a preferred embodiment of the present invention, steps S102-31 to S102-33 are performed:
s102-31, for each triplet (u, v, w) of the triangle, searching the vertex list for the corresponding three vertices p0 ═ VertexList [ u ], p1 ═ VertexList [ v ], p2 ═ VertexList [ w ];
s102-32, obtaining a bounding box (faceMinCoord, faceMaxCoord) of the projection of the triangular surface on the XOY plane according to three vertexes p0, p1 and p2 of each triangular surface, wherein the calculation method comprises the following steps:
faceMinCoord＝(min(p0.x，p1.x，p2.x)，min(p0.y，p1.y，p2.y))
faceMaxCoord＝(max(p0.x，p1.x，p2.x)，max(p0.y，p1.y，p2.y))；
Wherein, p0, p1 and p2 are three vertexes of the triangular surface, and faceMinCoord is the coordinate of the lower left corner of the bounding box of the projection of the triangular surface on the XOY plane; faceMaxCoord is the coordinate of the upper right corner of the bounding box of the projection of the triangular plane on the XOY plane.
S102-33, combining the serial number faceId, the three vertexes p0, p1, p2 and bounding boxes (faceMinCoord, faceMaxCoord) of each triangular surface to obtain a triangular patch information hexahydric group faceInfo ═ (faceId, p0, p1, p2, faceMinCoord, faceMaxCoord); all triangle patch information six-element groups form a list TotalFaceInfoList, and the length is n.
For step S103, a triangular patch spatial index is obtained according to the triangular patch information. In a preferred embodiment of the present invention, the FaceInfo of each element in the hexatomic list TotalFaceInfoList of triangle patch information is inserted into the node of the quadtree of the triangle patch one by one to obtain the spatial index of the triangle patch with vertex data, and then the redundant node information in the quadtree index of the triangle patch with vertex data is removed and output to a file. Steps S103-1 to S103-4 are executed:
in a preferred embodiment of the present invention, the FaceInfo insertion operation involves comparison of three bounding boxes, namely the triangular bounding box (faceMaxCoord), the nodal bounding box (nodal maxcoord), and the overall bounding box information (totalMinCoord, totalMaxCoord) of all the patches, and the back root traversal of the node tree.
S103-1, calculating integral bounding box information (totalmax ) of the triangle patch information hexahydric group list totalfaceInfoList, wherein the calculating method comprises the following steps:
totalMinCoord＝(min{TotalFaceInfoList[i].faceMinCoord.x}，
min{TotalFaceInfoList[i].faceMinCoord.y})；
totalMaxCoord＝(min{TotalFaceInfoList[i].faceMaxCoord.x}，
min{TotalFaceInfoList[i].faceMaxCoord.y})；
wherein i is a positive integer, i is more than or equal to 0 and less than or equal to n, n is a positive integer, and the length of each hexagonal group list TotalFaceInfoList of all triangular patch information is n + 1; TotalFaceInfoList [ i ] is the ith triangular patch information six-tuple, and faceMinCoord is the left lower corner coordinate of a bounding box projected on an XOY plane by a triangular surface corresponding to the ith triangular patch information six-tuple; the faceMaxCoord is the coordinate of the upper right corner of a bounding box projected on an XOY plane by a triangular surface corresponding to the six-tuple of the triangular patch information.
S103-2, constructing a triangular patch quadtree index with vertex data based on all triangular patch information hexahistion lists TotalFaceInfoList, and in a preferred embodiment of the invention, executing steps S103-21-S103-22:
s103-21, establishing a root node of the spatial index tree, and taking the whole bounding box information (totalMaxCoord ) of the triangle patch information hexahydric group list totalfaceInfoList as a node bounding box of the root node;
s103-22, inserting each triangular patch information hexahydric group FaceInfo into the minimum node capable of containing the node in the subtree taking the current operation node as the root to obtain a triangular patch quadtree index with vertex data, and executing steps S103-221 to S103-222:
S103-221, setting the root node as the current operation node.
S103-222, inserting the triangular patch information hexahydric group FaceInfo into a spatial index subtree taking the current operation node as a root, in a preferred embodiment of the present invention, inserting the triangular patch information hexahydric group FaceInfo into a node which is the smallest in a spatial index tree and can surround the triangular patch information hexahydric group FaceInfo, and obtaining a triangular patch quadtree index with vertex data. Executing steps S103-2221 to S103-2224:
s103-2221, traversing all child nodes under the condition that the current operation node comprises child nodes (SubNodes); determining whether a bounding box (nodeMinCoord, nodeMaxCoord) of each child node contains a bounding box (faceMinCoord, faceMaxCoord) of a triangle patch; if finding that the bounding box of a certain child node contains the bounding box information of the triangular patch, taking the child node as the current operation node, namely, moving the operation node down by one layer, and recursively repeating the steps S103-222:
s103-2222, under the condition that the current operation node does not contain the child node, judging whether the current operation node needs to be split downwards; under the condition that the number of layers of the current operation node is less than the maximum tree depth threshold value MaxTreeDepth, the number of six-element groups of the triangular patch information contained in the current operation node is greater than the maximum node patch threshold value MaxumFacesInOneNode, and the size of the current operation node is greater than the minimum splitting threshold value MinSplitDistance, the current operation node needs to be split, and the steps S103-2223 are continuously executed downwards; otherwise, the splitting is not needed, and the step S103-2224 is continuously executed downwards; in a preferred embodiment of the present invention, the maximum tree depth threshold maxtree depth is 14 levels, the maximum node patch threshold maxnumfacesinnonenode is 1000, and the minimum split threshold minsplittistance is 0.25 m.
S103-2223, under the condition that the current operation node needs to be split, splitting the current operation node, including: according to a preset splitting coefficient SplitRatio, dividing a current operation Node into a first sub-Node 1 and a second sub-Node 2 according to the longest dimension; in a preferred embodiment of the present invention, the splitting factor splitlatio is 0.55, so that the subdivided sub-regions are slightly overlapped, rather than mutually exclusive. Steps S103-22231 to S103-22234 are executed:
s103-22231, in case that the width w of the x dimension of the current operation node is nodemaxcoord.x-nodemincoord.x is greater than the height h of the y dimension is nodemaxcoord.y-nodemincoord.y, then splitting in the x dimension is performed; the bounding box (nodeMinCoord, nodeMaxCoord) of the currently operating Node is divided into a first child Node1 and a second child Node2 according to the following bounding boxes:
Node 1：
lower left corner: (nodeMinCoord. x, nodeMinCoord. y),
the upper right corner: (nodeMinCoord.x + w Splitratio, nodeMaxCoord.y)
Node2：
Lower left corner: (nodemaxcoord. x-w Splitatio, nodeMinCoord. y),
the upper right corner: (nodeMaxCoord.x, nodeMaxCoord.y)
W is the width of the x dimension of the current operation node, the splittion is a splitting coefficient, nodeMinCoord.x is the x coordinate of the lower left corner of the bounding box of the current operation node, nodeMinCoord.y is the y coordinate of the lower left corner of the bounding box of the current operation node, nodeMaxCoord.x is the x coordinate of the upper right corner of the bounding box of the current operation node, and nodeMaxCoord.y is the y coordinate of the upper right corner of the bounding box of the current operation node.
S103-22232, in case that the width w of the x dimension of the current operation node is nodemaxcoord.x-nodemincoord.x is less than or equal to the height h of the y dimension is nodemaxcoord.y-nodemincoord.y, then splitting in the y dimension is performed; the bounding box (nodeMinCoord, nodeMaxCoord) of the currently operating Node is divided into a first child Node1 and a second child Node2 according to the following bounding boxes:
Node 1：
lower left corner: (nodeMinCoord. x, nodeMinCoord. y),
the upper right corner: (nodeMaxcoord. x, nodeMinCoord. y + h Splitratio)
Node2：
Lower left corner: (nodeMinCoord.x, nodeMaxCoord.y-h SplitRatio),
the upper right corner: (nodeMaxCoord.x, nodeMaxCoord.y)
Wherein h is the width of the y dimension of the current operation node, the splittivity is a splitting coefficient, nodeMinCoord.x is the lower left corner x coordinate of the bounding box of the current operation node, nodeMinCoord.y is the lower left corner y coordinate of the bounding box of the current operation node, nodeMaxCoord.x is the upper right corner x coordinate of the bounding box of the current operation node, and nodeMaxCoord.y is the upper right corner y coordinate of the bounding box of the current operation node.
S103-22233, the first sub-Node 1 is divided into a sub-Node SubNodeA and a sub-Node SubNodeB according to the longest dimension; the method of dividing the second sub-Node 2 into sub-nodes SubNodeC and sub-nodes SubNodeD, and dividing the current operation Node into four sub-nodes SubNodeA, SubNodeB, SubNodeC, SubNodeD.
S103-22234, traverse the newly subdivided four child nodes subnode a, subnode b, subnode c, and subnode d, if there is a bounding box of one child node in the four child nodes that can contain bounding box information (faceMinCoord, faceMaxCoord) of the triangular patch, in order to access the newly subdivided child nodes subnode a, subnode b, subnode c, and subnode d at the next recursion, keep the current operation node not moving down by one layer, and recursively repeat steps S103-222.
S103-2224, until now, the current operation node does not need to be split, and the current operation node has no child node or all the bounding boxes of the child nodes do not contain the bounding box of the triangle patch, and the current operation node is considered to be the minimum node capable of bounding the triangle patch information six-element group FaceInfo, so that the triangle patch information six-element group FaceInfo is stored in the triangle patch information six-element group list NodeFaceInfoList of the current operation node.
S103-3, removing redundant nodes in the triangular patch quad-tree index with vertex data. In a preferred embodiment of the present invention, the operation of deleting the redundant node involves traversing the back root of the node tree to perform steps S103-31 to S103-32.
S103-31, setting the root node as the current operation node.
S103-32, traversing all child nodes of the current operation node, and executing steps S103-321-S103-322 for each child node:
s103-321, if the current operation node only has one child node SubNode0 and the triangle patch information hexahydrite list NodeFaceInfoList of the current operation node is an empty set, copying the triangle patch information hexahydrite list NodeFaceInfoList of the child node SubNode0 to the current operation node to make it not be an empty set, and updating bounding box information (nodeMinCoord, nodeMaxCoord) of the current operation node, at this time, the child node SubNode0 is a redundant node, deleting the child node SubNode0, continuing traversing, and executing the step S103-32.
S103-322, if the current operation node does not contain the child node and the triangle patch information hexahydric group list NodeFaceInfoList of the current operation node is an empty set, at this moment, the current operation node is a redundant node, the current operation node is deleted, the traversal is continued, and the step S103-32 is executed.
S103-4, after the triangular patch spatial index is obtained, the method further comprises: and outputting the space index of the triangular patch into a space index file of the triangular patch. Executing steps S103-41 to S103-42:
and S103-41, outputting statistical information of the triangular patch spatial index. In a preferred embodiment of the present invention, the binary data for realizing the statistical information is outputted as a header, and steps S103-411 to S103-413 are performed.
S103-411, optionally, the output file identifier, 8 bytes, which in a preferred embodiment of the invention are two integer values, 0x4B4F4547,0x58444953, respectively, shown as "GEOK" and "SIDX" on a computer with a central processing unit that is a Little-Endian.
S103-412, counting the number of TotalNumNodes of all nodes of the triangular patch spatial index, and outputting an integer value of 4 bytes;
s103-413, counting the number TotalNumTriangles of the triangular patches of all the nodes of the triangular patch spatial index, and outputting an integer value of 4 bytes;
and S103-42, outputting the information of each node of the triangular patch spatial index, wherein in a preferred embodiment of the invention, the output operation relates to the first root traversal of the node tree. Steps S103-421 to S103-422 are performed.
S103-421, setting the root node as the current operation node.
S103-422, outputting the current operation node information. Steps S103-4221 to S103-4224 are executed:
s103-4221, calculating the byte length subNodeSize of all the child nodes of the current operation node;
s103-4222, outputting field information (nodeMinCoord, nodeMaxCoord, nodeId, nodeLevel, numSuubNodes, numRingagles, SubNodeSize) of the current operation node; the node MinCoord is a coordinate of the left lower corner of a bounding box of a current operation node, the node MaxCoord is a coordinate of the right upper corner of the bounding box of the current operation node, the node Id is a sequence number of the current operation node, the node level is the level number of the current operation node, the numubnodes are the number of child nodes of the current operation node, numtiles are the length of a triangle patch information hexahydrite list NodeFaceInfoList of the current operation node, and subNodeSize is the byte size of all child nodes of the current operation node. In a preferred embodiment of the present invention, the field information output of the currently operating node is binary data, and the node byte size is equal to the number of corresponding binary bytes.
S103-4223, outputting a triangle patch information hexahistion list nodeaceinflst of the current operation node, in a preferred embodiment of the present invention, all triangle patches of the current operation node share the (nodeMinCoord, nodeMaxCoord) of the current node, so ignoring (faceMinCoord, faceMaxCoord) in the triangle patch information hexahistion list faceinfor, only outputting triangle patch information (faceId, p0, p1, p 2). In a preferred embodiment of the present invention, the triangle patch information six-tuple list nodaceinfolist of the current operation node is output as binary data, each triangle patch information six-tuple is 40 bytes, and includes faceId of 4 bytes, vertex p0 of 12 bytes, vertex p1 of 12 bytes, and vertex p2 of 12 bytes; the aceMaixCoord ignores the output; the total byte count of the triangle patch information hexahiston list nodeficeinfList of the node is numstride 40.
S103-4224, traversing all child nodes of the current operation node, setting the child node as the current operation node for each child node, and recursively executing S103-422;
s104, performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of a sampling point, and the method comprises the following steps: establishing memory mapping for the triangular patch spatial index file; acquiring a memory mapping basic block corresponding to each node from the memory mapping; acquiring bounding boxes of corresponding nodes according to the memory mapping basic blocks; under the condition that an enclosure box of a node contains a preset sampling point and a triangular surface in a surface list contains the sampling point, acquiring a ray which takes the sampling point as an origin and is vertically upward; taking the elevation value of the intersection point of the ray and the triangular surface as the alternative elevation value of the sampling point; and acquiring the elevation value of the sampling point according to the alternative elevation value. In a preferred embodiment of the present invention, steps S104-1 to S104-2 are performed:
S104-1, establishing memory mapping for the triangular patch quadtree index file with vertex data, wherein the memory mapping comprises the following steps: establishing a file handle of a triangular patch quadtree index file with vertex data; acquiring the length of the file; establishing a read-only memory mapping handle of the file; obtaining the number of memory mapping basic blocks of the file by using the memory mapping basic blocks with the preset block size BlockSize; and establishing a file memory mapping for each memory mapping basic block. In a preferred embodiment of the present invention, steps S104-11 to S104-13 are performed.
S104-11, establishing a file handle FileHandle of a triangular patch quadtree index file with vertex data by calling CreateFile (); acquiring the file length by calling GetFileSizeEx (); the file read-only memory mapping handle FileMappingHandle is established by calling CreateFileMapping () and PAGE _ readalonly parameter.
S104-12, acquiring the number of the memory mapping basic blocks by calculating numBlocks as a last rounding (FileLength/BlockSize); in a preferred embodiment of the present invention, numBlocks is the number of basic blocks of the memory mapping, FileLength is the file length, and BlockSize is a preset block size, where BlockSize is 2 GB.
S104-13, establishing file memory mapping for each memory mapping basic block by calling MapViewOfFile () and the length parameter of the current block.
S104-2, determining the preset elevation sampling point set QueryPointList { (Q)k.x,Qk.y,QkH) } (0 ≦ k < q) performs elevation sampling. q is a positive integer and is the length of the elevation sampling point set; qkThe k-th elevation sampling point in the QueryPointList is obtained, and each elevation sampling point is composed of a triplet (x, y, h). Executing steps S104-21 to S104-25:
s104-21, sampling the elevation sample point QkElevation value Q ofkH is initialized to 0.0;
s104-22, taking the root node of the spatial index tree as the current operation node, wherein the offset of the corresponding file is 0;
s104-23, finding out the corresponding memory mapping basic block according to the offset value offset, and reading the field information (nodeMinCoord, nodeMaxCoord, nodeId, nodeLevel, numubnodes, numbrians, subNodeSize) of the current operation node from the offset value offset in the memory mapping basic block; if the content of the current operation node crosses the current memory mapping basic block, continuing to read at the beginning of the next memory mapping basic block until the content of the current operation node is read;
s104-24, if the bounding box (nodeMinCoord, nodeMaxCoord) of the currently operating node contains the sampling point (Q) k.x,QkY), continue reading and traversing the triangle patch information hexahydric group list nodecenfist of the node, and for each triangle patch information hexahydric group faceinfolist (faceId, p0, p1, p2), execute steps S104-241-S104-244;
s104-241, including a sampling point (Q) in a bounding box (node _ minCoord, node _ maxCoord) of the current operation nodek.x,QkY), further judging whether the triangular face (p0, p1, p2) contains the sampling point (Q)k.x,QkY); if so, get QkRay Q directed vertically upward D (0, 0, 1) as the origink+ tD, a vertically upward three-dimensional straight line; ray QkThe intersection H (Q) of + tD and the triangular face (p0, p1, p2)k.x,QkY, H.z) as candidate elevations for the sample point; at H.z>QkH, determining the elevation value Q of the sampling pointkH is H.z.
Optionally, whether the triangular surface (p0, p1, p2) contains the sampling point (Q) is judged by a cross product methodk.x,Qk.y)；
Optionally, calculating a cross product p0p1_ cross _ p0p2 of p0p1 and p0p1 (p2. x-p 0.x) (p2. y-p 0.y) - (p1. y-p 0.y) ((p 2. x-p 0. x));
alternatively, p0Q is calculatedkAnd p1QkCross product p0Qk _ coross _ p1Qk ═ (Q)k.x–p0.x)*(Qk.y–p1.y)-(Qk.y–p0.y)*(Qk.x–p1.x)；
Alternatively, p1Q is calculatedkAnd p2QkCross product p1Qk _ coross _ p2Qk ═ (Q)k.x–p1.x)*(Qk.y–p2.y)-(Qk.y–p1.y)*(Qk.x–p2.x)；
Alternatively, p2Q is calculated kAnd p0QkCross product p2Qk _ coross _ p0Qk ═ Q (Q)k.x–p2.x)*(Qk.y–p0.y)-(Qk.y–p2.y)*(Qk.x–p0.x)；
Alternatively, in the case where p0p1_ cross _ p0p2 is not 0, and three values of p0Qk _ coross _ p1Qk, p1Qk _ coross _ p2Qk and p2Qk _ coross _ p0Qk are simultaneously positive or simultaneously negative, then the triangular face (p0, p1, p2) contains the sampling point (Q0, p1, p2)k.x,QkY), otherwise it is not included.
S104-242, if the triangular surface does not contain the sampling point (Q)k.x,QkY), the FaceInfo of the hexa-element of triangle patch information is ignored.
S104-243, if the bounding box (nodeMinCoord, nodeMaxCoord) of the current operation node does not contain the sampling point (Q)k.x,QkY), then updating the offset value offset, and setting the offset value offset as offset + the byte number of the node plane information list + the size subNodeSize of the child node; steps S104-23 to S104-24 are repeatedly performed.
S104-244, the method for three-dimensional spatial data elevation sampling, further comprising: and outputting the elevation values of the sampling points.
Optionally, the elevation sample point set QueryPointList is output as an elevation point xyz file, an elevation point binary file, an elevation point vector point set shp, or a DSM elevation grid img format.
In a preferred embodiment of the present invention, the text file is created by outputting the batch of elevation sampling point sets as the elevation point xyz file, and the elevation sampling point sets QueryPointList are sequentially output, each sampling point (Q) k.x,Qk.y,QkH) is a row; alternatively, Qk.x,Qk.y,QkH all retain 3 decimal places, separated using commas.
In a preferred embodiment of the present invention, the batch of elevation sampling point sets are output as an elevation point binary file, and the binary file is created and sequentially outputGenerating an elevation sampling point set QueryPointList, each point (Q)k.x,Qk.y,QkH) is a fixed length; alternatively, Qk.x,Qk.y,QkH are both float four bytes or double eight bytes.
In a preferred embodiment of the present invention, the batch of elevation sample point sets is output as an elevation vector point set shp, the point set shp is established, and the elevation sample point sets QueryPointList are sequentially output, each point (Q)k.x,Qk.y,QkH) corresponds to an element Feature; alternatively, the point of the element Feature is set to (Q)k.x,QkY), optionally, an attribute height is included, having a value of Qk.h。
In a preferred embodiment of the present invention, the elevation sampling point sets are output in batch as a DSM elevation grid img format, the DSM elevation grid img format is established, the coordinates of the upper left corner of the grid and the sampling interval are set as resolutions, the elevation sampling point sets QueryPointList are sequentially output as pixel points, and each point (Q) is a pointk.x,Qk.y,QkH) corresponds to a Pixel (px, py) which, optionally, corresponds to a spatial coordinate of (Q) k.x,QkY), the value of the pixel is the normalized height, value int (Q)kH 255.0/(maxH-minH)), wherein maxH is all sampling points (Q) in the elevation sampling point set QueryPointListk.x,Qk.y,QkQ of h)kH is the maximum value; minH is all sampling points (Q) in an elevation sampling point set QueryPointListk.x,Qk.y,QkQ of h)kA minimum value of h;
in a preferred embodiment of the present invention, the real three-dimensional data volume 1GB of a certain area includes 13249289 triangles, and the sampling of 100 ten thousand elevation points by the method for sampling three-dimensional spatial data elevation provided in the embodiments of the present disclosure only requires 1.911 seconds; the efficiency of massive high-range point sampling can be effectively improved.
In a preferred embodiment of the invention, the three-dimensional spatial data of a certain area is divided into 100 sub-areas, each sub-area is about 10GB-16GB, the total data amount is 1.44TB, and the method for three-dimensional spatial data elevation sampling operates normally and can support TB-level three-dimensional spatial data elevation sampling.
In a preferred embodiment of the present invention, it is checked whether there is a triangular patch spatial index file; if yes, performing elevation sampling according to the triangular patch spatial index file to obtain an elevation value of a sampling point; if not, acquiring a three-dimensional geometric body list; obtaining triangular patch information according to the three-dimensional geometric body list; obtaining a triangular patch spatial index according to the triangular patch information; and performing elevation sampling according to the space index of the triangular patch to obtain an elevation value of the sampling point.
According to the method for sampling the three-dimensional spatial data by elevation, by means of the triangular surface patch spatial index with the vertex data, useless data for sampling by elevation such as geometric texture data, vertex colors, multiple sets of vertex texture coordinates and the like are abandoned, reading and analysis of a three-dimensional city model and oblique photography tiles are avoided, and the efficiency of sampling a large number of elevation points is effectively improved. Meanwhile, the high sampling of the three-dimensional spatial data with large data volume can be supported by the space index and memory mapping technology of the triangular patch with the vertex data.
As shown in fig. 2, an apparatus for elevation sampling of three-dimensional spatial data according to an embodiment of the present disclosure includes a processor (processor)100 and a memory (memory)101 storing program instructions. Optionally, the apparatus may also include a Communication Interface (Communication Interface)102 and a bus 103. The processor 100, the communication interface 102, and the memory 101 may communicate with each other via a bus 103. The communication interface 102 may be used for information transfer. The processor 100 may invoke program instructions in the memory 101 to perform the method for three-dimensional spatial data elevation sampling of the above-described embodiments.
Further, the program instructions in the memory 101 may be implemented in the form of software functional units and stored in a computer readable storage medium when sold or used as a stand-alone product.
The memory 101, which is a computer-readable storage medium, may be used for storing software programs, computer-executable programs, such as program instructions/modules corresponding to the methods in the embodiments of the present disclosure. The processor 100 executes the functional application and data processing, i.e., implements the method for three-dimensional spatial data elevation sampling in the above embodiments, by executing the program instructions/modules stored in the memory 101.
The memory 101 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal device, and the like. In addition, the memory 101 may include a high-speed random access memory, and may also include a nonvolatile memory.
By adopting the device for three-dimensional spatial data elevation sampling provided by the embodiment of the disclosure, the triangular patch information is acquired through the three-dimensional geometric body list, so that the triangular patch spatial index is acquired, elevation sampling is performed through the triangular patch spatial index, so that the elevation value of a sampling point is acquired, data which are useless for elevation sampling, such as geometric body texture data, vertex colors, multiple sets of vertex texture coordinates and the like, are abandoned, the efficiency of mass elevation point sampling is effectively improved, and thus the three-dimensional spatial data elevation sampling with large data volume can be supported.
The embodiment of the disclosure provides equipment comprising the device for three-dimensional spatial data elevation sampling.
Optionally, the device comprises a server, a computer.
According to the equipment, the triangular patch information is obtained through the three-dimensional geometric body list, so that the triangular patch spatial index is obtained, the elevation sampling is performed through the triangular patch spatial index, so that the elevation value of a sampling point is obtained, useless data of geometric body texture data, vertex colors, multiple sets of vertex texture coordinates and the like for the elevation sampling are abandoned, the efficiency of sampling mass elevation points is effectively improved, and the three-dimensional spatial data elevation sampling with large data volume can be supported.
Embodiments of the present disclosure provide a computer-readable storage medium having stored thereon computer-executable instructions configured to perform the above-described method for elevation sampling of three-dimensional spatial data.
Embodiments of the present disclosure provide a computer program product comprising a computer program stored on a computer readable storage medium, the computer program comprising program instructions that, when executed by a computer, cause the computer to perform the above-described method for elevation sampling of three-dimensional spatial data.
The computer-readable storage medium described above may be a transitory computer-readable storage medium or a non-transitory computer-readable storage medium.
The technical solution of the embodiments of the present disclosure may be embodied in the form of a software product, which is stored in a storage medium and includes one or more instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method of the embodiments of the present disclosure. And the aforementioned storage medium may be a non-transitory storage medium comprising: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes, and may also be a transient storage medium.
The above description and drawings sufficiently illustrate embodiments of the disclosure to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. The examples merely typify possible variations. Individual components and functions are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in or substituted for those of others. Furthermore, the words used in the specification are words of description only and are not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed. Furthermore, the terms "comprises" and/or "comprising," when used in this application, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. Without further limitation, an element defined by the phrase "comprising an …" does not exclude the presence of other like elements in a process, method or apparatus that comprises the element. In this document, each embodiment may be described with emphasis on differences from other embodiments, and the same and similar parts between the respective embodiments may be referred to each other. For methods, products, etc. of the embodiment disclosures, reference may be made to the description of the method section for relevance if it corresponds to the method section of the embodiment disclosure.
Those of skill in the art would appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software may depend upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments. It can be clearly understood by the skilled person that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the unit described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments disclosed herein, the disclosed methods, products (including but not limited to devices, apparatuses, etc.) may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units may be merely a logical division, and in actual implementation, there may be another division, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to implement the present embodiment. In addition, functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. In the description corresponding to the flowcharts and block diagrams in the figures, operations or steps corresponding to different blocks may also occur in different orders than disclosed in the description, and sometimes there is no specific order between the different operations or steps. For example, two sequential operations or steps may in fact be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. Each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Claims (9)
1. A method for elevation sampling of three-dimensional spatial data, comprising:
acquiring a three-dimensional geometric body list;
obtaining triangular patch information according to the three-dimensional geometry list;
obtaining a triangular patch spatial index according to the triangular patch information;
and performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of a sampling point.
2. The method of claim 1, wherein obtaining triangular patch information from the list of three-dimensional geometries comprises:
acquiring a vertex list and a surface list of the three-dimensional geometric body;
and obtaining the triangular patch information of the three-dimensional geometric body according to the vertex list and the face list of the three-dimensional geometric body.
3. The method of claim 1, wherein obtaining a triangular patch spatial index from the triangular patch information comprises:
and inserting the triangular patch information into a node of a spatial index tree to obtain a triangular patch spatial index.
4. The method of claim 3, wherein inserting the triangular patch information into a node of a spatial index tree comprises:
and inserting the triangular patch information into a node which can surround the triangular patch information in a spatial index tree.
5. The method of claim 3, wherein after obtaining the triangular patch spatial index, further comprising:
and outputting the space index of the triangular patch into a space index file of the triangular patch.
6. The method of claim 5, wherein performing elevation sampling according to the triangular patch spatial index to obtain an elevation value of a sampling point comprises:
establishing memory mapping for the triangular patch spatial index file;
acquiring a memory mapping basic block corresponding to each node from the memory mapping;
acquiring bounding boxes of corresponding nodes according to the memory mapping basic blocks;
under the condition that the bounding box of the node comprises a preset sampling point and the triangular surface in the surface list comprises the sampling point, acquiring a ray which takes the sampling point as an origin and is vertically upward;
taking the elevation value of the intersection point of the ray and the triangular surface as the alternative elevation value of the sampling point;
and acquiring the elevation value of the sampling point according to the alternative elevation value.
7. The method of any of claims 1 to 6, further comprising:
and outputting the elevation value of the sampling point.
8. An apparatus for elevation sampling of three dimensional spatial data, comprising a processor and a memory having stored thereon program instructions, wherein the processor is configured to, when executing the program instructions, perform a method for elevation sampling of three dimensional spatial data as recited in any one of claims 1 to 7.
9. An apparatus comprising the apparatus for elevation sampling of three dimensional spatial data according to claim 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010690291.7A CN111854683B (en) | 2020-07-17 | 2020-07-17 | Method, device and equipment for three-dimensional spatial data elevation sampling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010690291.7A CN111854683B (en) | 2020-07-17 | 2020-07-17 | Method, device and equipment for three-dimensional spatial data elevation sampling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111854683A true CN111854683A (en) | 2020-10-30 |
| CN111854683B CN111854683B (en) | 2022-06-17 |
Family
ID=72983706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010690291.7A Active CN111854683B (en) | 2020-07-17 | 2020-07-17 | Method, device and equipment for three-dimensional spatial data elevation sampling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111854683B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112802172A (en) * | 2021-02-24 | 2021-05-14 | 网易（杭州）网络有限公司 | Texture mapping method and device of three-dimensional model, storage medium and computer equipment |
| CN113034689A (en) * | 2021-04-30 | 2021-06-25 | 睿宇时空科技(重庆)有限公司 | Laser point cloud-based terrain three-dimensional model, terrain map construction method and system, and storage medium |
| CN113269860A (en) * | 2021-06-10 | 2021-08-17 | 广东奥普特科技股份有限公司 | High-precision three-dimensional data real-time progressive rendering method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101430693A (en) * | 2008-11-12 | 2009-05-13 | 山东理工大学 | Spacing query method for triangular gridding curve model |
| CN102306180A (en) * | 2011-08-29 | 2012-01-04 | 北京建筑工程学院 | Modeling method based on mass laser radar grid point cloud data |
| JP2014238714A (en) * | 2013-06-07 | 2014-12-18 | Ｎｅｃソリューションイノベータ株式会社 | Three-dimensional data generation device, three-dimensional data generation method, and program |
| CN111199086A (en) * | 2018-10-31 | 2020-05-26 | 上海索辰信息科技有限公司 | Three-dimensional geometric discretization processing system |
-
2020
- 2020-07-17 CN CN202010690291.7A patent/CN111854683B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101430693A (en) * | 2008-11-12 | 2009-05-13 | 山东理工大学 | Spacing query method for triangular gridding curve model |
| CN102306180A (en) * | 2011-08-29 | 2012-01-04 | 北京建筑工程学院 | Modeling method based on mass laser radar grid point cloud data |
| JP2014238714A (en) * | 2013-06-07 | 2014-12-18 | Ｎｅｃソリューションイノベータ株式会社 | Three-dimensional data generation device, three-dimensional data generation method, and program |
| CN111199086A (en) * | 2018-10-31 | 2020-05-26 | 上海索辰信息科技有限公司 | Three-dimensional geometric discretization processing system |
Non-Patent Citations (1)
| Title |
|---|
| 郭向坤: "大规模三维地形构建的关键技术研究", 《中国优秀博硕士学位论文全文数据库（博士）信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112802172A (en) * | 2021-02-24 | 2021-05-14 | 网易（杭州）网络有限公司 | Texture mapping method and device of three-dimensional model, storage medium and computer equipment |
| CN112802172B (en) * | 2021-02-24 | 2024-03-01 | 网易（杭州）网络有限公司 | Texture mapping method and device for three-dimensional model, storage medium and computer equipment |
| CN113034689A (en) * | 2021-04-30 | 2021-06-25 | 睿宇时空科技(重庆)有限公司 | Laser point cloud-based terrain three-dimensional model, terrain map construction method and system, and storage medium |
| CN113034689B (en) * | 2021-04-30 | 2023-09-19 | 睿宇时空科技(重庆)股份有限公司 | Laser point cloud-based terrain three-dimensional model, terrain map construction method and system, and storage medium |
| CN113269860A (en) * | 2021-06-10 | 2021-08-17 | 广东奥普特科技股份有限公司 | High-precision three-dimensional data real-time progressive rendering method and system |
| CN113269860B (en) * | 2021-06-10 | 2022-10-04 | 广东奥普特科技股份有限公司 | High-precision three-dimensional data real-time progressive rendering method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111854683B (en) | 2022-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111854683B (en) | Method, device and equipment for three-dimensional spatial data elevation sampling | |
| CN106780736B (en) | Map data processing method and device and three-dimensional map generation method and device | |
| Vanegas et al. | Procedural generation of parcels in urban modeling | |
| WO2015119325A1 (en) | Terrain rendering method | |
| CN111540051B (en) | CIM-based full-element mass data lightweight and topology analysis application platform | |
| CN114529633B (en) | Method for supporting continuous LOD (level of detail) drawing of GIS (geographic information system) line object and surface object | |
| CN111090712A (en) | Data processing method, device and equipment and computer storage medium | |
| CN111221933A (en) | Three-dimensional tile construction method for fusion of massive map data and building information model | |
| CN113112603A (en) | Method and device for optimizing three-dimensional model | |
| CN109872390B (en) | Organization method of massive three-dimensional models | |
| CN104268941A (en) | Hot spot forming method and device for simulated three-dimensional map | |
| CN116756836B (en) | Tunnel super-undermining volume calculation method, electronic equipment and storage medium | |
| Zhang et al. | A geometry and texture coupled flexible generalization of urban building models | |
| CN112328722A (en) | Method and system for rapidly loading three-dimensional GIS (geographic information System) and model data of power transformer substation | |
| CN115131526B (en) | Automatic comprehensive drawing method and system | |
| CN113936114B (en) | BIM model component class-level lightweight method and system | |
| CN107767458B (en) | Irregular triangulation network curved surface geometric topology consistency analysis method and system | |
| CN115661364A (en) | Three-dimensional simulation model reconstruction method for cultural relic and ancient building group restoration | |
| CN112700538B (en) | LOD generation method and system | |
| CN112288863B (en) | Map construction method in robot synchronous positioning and composition navigation | |
| CN115033972A (en) | Method and system for unitizing building main body structures in batches and readable storage medium | |
| CN103679806B (en) | Self adaptation visual shell generates method and device | |
| CN110866056A (en) | Method, device and equipment for processing lightweight STEP file | |
| Zlatanova et al. | Building reconstruction from aerial images and creation of 3D topologic data structure | |
| Magillo et al. | Updating visibility information on multiresolut ion terrain models |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240312 Address after: No. 6 Qingzhu East Road, Dazhulin Street, Yubei District, Chongqing, 400000 Patentee after: Chongqing Institute of Surveying and Mapping Science and Technology (Chongqing Map Compilation Center) Country or region after: China Address before: 401121 No.6, Qingzhu East Road, Dazhulin, Liangjiang New District, Chongqing Patentee before: CHONGQING SURVEY INSTITUTE Country or region before: China |
|
| TR01 | Transfer of patent right |