CN114065354A - Fusion system based on BIM and GIS - Google Patents
Fusion system based on BIM and GIS Download PDFInfo
- Publication number
- CN114065354A CN114065354A CN202111382992.5A CN202111382992A CN114065354A CN 114065354 A CN114065354 A CN 114065354A CN 202111382992 A CN202111382992 A CN 202111382992A CN 114065354 A CN114065354 A CN 114065354A
- Authority
- CN
- China
- Prior art keywords
- max
- patch
- dis
- bim
- patches
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
A fusion system based on BIM and GIS comprises a server and a memory, wherein a tile level list T of the GIS and a lightweight model B of the BIM are stored in the memory, and a mapping relation exists between the tile level list T and the lightweight model B. The server is used for: tile level T for obtaining GISiAccording to TiIndex to Bj(ii) a Tile level T for presenting GISiAnd Bj. When the weight-reducing model of BIM is specifically generated, one weight-reducing model may be generated first, and then the next weight-reducing model may be generated on the generated weight-reducing model. The invention can reduce the loading amount of BIM.
Description
Technical Field
The application relates to the high-speed field of wisdom, concretely relates to integration system based on BIM and GIS.
Background
At present, a highway coverage area is a long and narrow area, an unmanned aerial vehicle oblique photography is adopted to be matched with automatic three-dimensional modeling software to establish a three-dimensional live-action model, and a BIM modeling technology is adopted to establish a fine three-dimensional model for main road facilities such as a main road, an interchange, a ramp, a toll station, a service area and the like, road accessory facilities such as a guardrail, a vertical rod, an anti-glare plate and a crossing span, and equipment such as an information plate, a monitor, a bayonet and a broadcast. By combining three-dimensional oblique photography and BIM, an integrated basic three-dimensional scene with wide coverage and high granularity from a whole line to a road section lane and from a main facility to single equipment is constructed.
When the expressway is overlooked at high altitude, zooming can be carried out, maps with different zooming degrees can be seen, tiles can be used by the GIS to reduce the loading amount, but the BIM needs to be completely loaded. The BIM model loading needs to consume a large amount of buffer memories, and does not bring a better visual presentation effect, and in order to solve the problem, the lightweight of the BIM is provided, and in the prior art, the following lightweight method is often adopted: acquiring surface geometric data of a BIM model body; deriving BIM model data into IFC format data by using a data derivation function of BIM software, and acquiring material information and surface geometric data of the BIM model; judging whether a certain grid surface of the BIM model is a triangular surface or not according to the number of vertexes of a certain grid of the BIM model; when the number of the vertexes is 3, the triangular patch is formed; otherwise, not; when the polygon is a triangular surface, triangular surface patches are merged and simplified, and then a three-point method is adopted for boundary line simplification of the merged polygon; when the polygon is not a triangular surface, the boundary line simplification is directly carried out on the polygonal surface by adopting a three-point method; and simplifying the polygon boundary line and then removing the deleted point according to the short edge principle, and moving the point to another vertex of the short edge in the adjacent edge.
Disclosure of Invention
To the above technical problem, the technical scheme adopted by the application is as follows:
the application provides a BIM and GIS-based fusion system, which comprises a server and a memory which are in communication connection, wherein the server comprises one or more processors and a storage medium which stores a computer program; tile level list T = (T) with GIS stored in the memory1，T2，...Ti...，Tn) N is the number of tile levels, TiFor the ith in the tile level listTile level, any tile level i having a unique identification TIDiI is 1 to n, and a lightweight model B = (B) storing any BIM1，B2，......，Bm) M is the number of lightweight models, wherein B1，B2，......，BmThe lightweight degree of the tile is sequentially increased, and a mapping relation exists between the tile level list T and the lightweight model B;
the processor is used for realizing the following steps when executing the computer program:
step S100, obtaining tile level T of GISiAccording to TiIndex to Bj，BjTile level T corresponding to BIM modeliJ takes a value of 1 to m;
step S200, presenting tile level T of GISiAnd Bj；
The lightweight model for any BIM can be realized by the following steps:
s300, generating a lightweight model B1The method specifically comprises the following steps:
s310, obtaining the number VN of the vertexes of the BIM, and if the VN is larger than a preset threshold, executing S320;
s320, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x axis, the y axis and the z axismin，ymin，zmin) And maximum value (x)max，ymax，zmax) And acquiring a bounding box formed by the minimum value and the maximum value;
s330, traversing the BIM patches, initializing the deletion flag of the patch as 'delete', and obtaining Dis = min { (x-x) for each vertex V = (x, y, z) in each patchmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}；
S340, if Diskp<D1, setting the deletion flag of the current patch as 'no deletion', and traversing the next patch of the BIM; until all the patches are traversed; dis (disease)kpThe value of k is 1 to N, N is the number of patches of BIM, the value of p is 1 to H, and H is the p-th vertex of the k-th patch in BIMThe number of vertices of k patches; otherwise, executing S350;
s350, traversing the next vertex of the patch k; returning to S340;
s360, after traversing all patches of the BIM, extracting patches with deletion marks of 'no deletion' as patches of the lightweight model of B1;
s400, generating a lightweight model BsAnd s is more than or equal to 2 and less than or equal to m, and the method specifically comprises the following steps:
s410, obtaining Bs-1VN, if VN is greater than a preset threshold, then S420 is performed;
s420, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x, y and z axesmin，ymin，zmin) And maximum value (x)max，ymax，zmax）；
S430, traverse Bs-1The patch of (1), the delete flag of the initialized patch is "delete", and for each vertex V = (x, y, z) within each patch, Dis = min { (x-x) is obtainedmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}；
S440, if Diskp<Ds, setting the deletion mark of the current patch as 'no deletion', and traversing Bs-1The next patch of (a); until all the patches are traversed; dis (disease)kpIs Bs-1The value of k is 1 to N, and N is Bs-1The number of patches, p is 1 to H, H is Bs-1The number of vertices of the kth patch; otherwise, executing S450;
s450, go through Bs-1The next vertex of the kth panel; returning to S440;
s460, traversing Bs-1After all the patches, extracting the patch with the deletion flag of 'no deletion' as BsThe surface patch of the lightweight model of (1).
The application has at least the following technical effects: in the highway roaming scene, the viewpoint has regular movement, so the parallel processing condition is considered, and the hardware resource requirement is reduced.
Detailed Description
The technical solutions in the embodiments of the present application are clearly and completely described below, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
An embodiment of the application provides a fusion system based on BIM and GIS. The system includes a communicatively connected server including one or more processors and a storage medium storing a computer program and a memory. Tile level list T = (T) with GIS stored in the memory1，T2，...Ti...，Tn) N is the number of tile levels, TiFor the ith tile level in the tile level list, any tile level i has a unique identification TIDiI is 1 to n, and a lightweight model B = (B) storing any BIM1，B2，......，Bm) M is the number of lightweight models, wherein B1，B2，......，BmThe degree of weight reduction of (a) is gradually increased. Preferably, m =1 or m = 2. And the tile level list T and the lightweight model B have a mapping relation. Those skilled in the art will appreciate that the mapping relationship between T and B is any one or more in the prior art, and for example, may be a one-to-one mapping relationship, or may be a one-to-many mapping relationship.
The processor is used for realizing the following steps when executing the computer program:
step S100, obtaining tile level T of GISiAccording to TiIndex to Bj，BjTile level T corresponding to BIM modeliThe value of j is 1 to m. Specifically, T can be found according to the mapping relation between T and BiCorresponding to Bj。
Step S200, presenting tile level T of GISiAnd Bj。
In the present embodiment, of BIMWhen the lightweight model is specifically generated, a lightweight model can be generated firstly, and then the next lightweight model, namely the lightweight model B, can be generated on the generated lightweight modeljCan be used in the lightweight model Bj-1And (4) generating the product.
Specifically, for any BIM, its lightweight model can be achieved by:
s300, generating a lightweight model B1The method specifically comprises the following steps:
s310, obtaining the number VN of the vertexes of the BIM, and if the VN is larger than a preset threshold, executing S320;
in the embodiment of the present application, the number of vertices of the BIM can be obtained in an existing manner. The preset threshold is a preset empirical parameter. In this step, if the number of vertices of the acquired BIM is smaller than the preset threshold, that is, the number of vertices is small, it means that the BIM model is not complex and the weight reduction process is not required.
S320, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x axis, the y axis and the z axismin，ymin，zmin) And maximum value (x)max，ymax，zmax）；
S330, traverse the patches of the BIM, initialize the deletion flag of the patch as "delete", and for each vertex V = (x, y, z) in each patch, obtain Dis. In the specific implementation, "deletion" may be represented by "1" or "0". S340 is performed.
In general, a BIM includes a plurality of patches, each of which may include a plurality of vertices. For example, when the number of vertices of a patch is 3, the patch is a triangle patch.
In one exemplary embodiment of the present invention,
Dis=min{(x-xmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}。
in a further exemplary embodiment of the present invention,
Dis=min{(x-xmin),(xmax-x),(y-ymin),(ymax-y),(zmax-z). Compared with the previous embodiment, because GIS + BIM is substantially2.5 dimensions, the minimum value in the Z direction is negligible, and the calculation amount of 1/6 can be reduced.
S340, if Diskp<D1, which shows that the corresponding patch k is located on the outline of BIM, the delete flag of the current patch is set as "no delete", and the next patch of BIM is traversed. Until all patches are traversed. Dis (disease)kpThe peak of the kth patch in the BIM is the p peak, the value of k is 1 to N, N is the number of patches of the BIM, the value of p is 1 to H, and H is the number of peaks of the kth patch; otherwise, executing S350;
correspondingly, "not delete" may be represented by "0" or "1" in specific implementations. D1 is a preset threshold, in a preferred example, D1= k1 { (x)max-xmin)2+(ymax-ymin)2+(zmax-zmin)2}1/2. k1 is a predetermined empirical parameter with a value of 0.05 k1 0.2, preferably k1= 0.1.
S350, traverse the next vertex of patch k. Returning to S340;
and S360, after traversing all patches of the BIM, extracting the patch with the deletion mark of 'not deleting' as the patch of the lightweight model of B1.
S400, generating a lightweight model BsAnd s is more than or equal to 2 and less than or equal to m, and the method specifically comprises the following steps:
s410, obtaining Bs-1VN, if VN is greater than a preset threshold, then S420 is performed;
s420, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x, y and z axesmin，ymin，zmin) And maximum value (x)max，ymax，zmax）；
S430, traverse Bs-1The deletion flag of the initialized patch is "delete", and Dis is obtained for each vertex V = (x, y, z) within each patch.
In one exemplary embodiment of the present invention,
Dis=min{(x-xmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}。
in a further exemplary embodiment of the present invention,
Dis=min{(x-xmin),(xmax-x),(y-ymin),(ymax-y),(zmax-z). Compared with the previous embodiment, since GIS + BIM is substantially 2.5-dimensional, the minimum value in the Z direction is negligible, and the calculation amount of 1/6 can be reduced.
S440, if Diskp<Ds, indicating that the corresponding patch k is located at Bs-1Then set the delete flag of the current patch as "no delete", go through Bs-1The next patch of (a). Until all patches are traversed. Dis (disease)kpIs Bs-1The value of k is 1 to N, and N is Bs-1The number of patches, p is 1 to H, H is Bs-1The number of vertices of the kth patch; otherwise, executing S450;
ds is a preset threshold, in a preferred example Ds = ks { (x)max-xmin)2+(ymax-ymin)2+(zmax-zmin)2}1/2. ks is a preset empirical parameter, and the value of ks is more than or equal to 0.05 and less than or equal to 0.2, wherein ks is determined according to actual needs as long as the model precision can be ensured, and preferably k iss-ks-1<0, e.g., k2=0.05, k3=0.025 ….
S450, go through Bs-1The next vertex of the k-th patch. Returning to S440;
s460, traversing Bs-1After all the patches, extracting the patch with the deletion flag of 'no deletion' as BsThe surface patch of the lightweight model of (1).
In the embodiment of the present application, when generating the lightweight model of BIM, the lightweight model is generated by setting each vertex in each patch of the base model to the minimum value (x) in the X, Y, Z-axis direction from all vertices of BIMmin，ymin，zmin) And maximum value (x)max，ymax，zmax) Minimum distance of each face of the formed bounding box and (x)min，ymin，zmin) And (x)max，ymax，zmax) And comparing the distance ks times of the two points to estimate whether the vertex is on the outer surface of the basic model, if so, identifying most points in the outer contour, and keeping the corresponding patch as a part of the lightweight model. The lightweight model is formed in the mode, and only a simple addition and subtraction method is used, so that the calculation time and resources of the computer can be saved, and the hardware configuration requirement of the computer is reduced. And when displaying, the corresponding lightweight model is led out through a tile level cable of the GIS to display. By adopting the method, for example, when the surface patch of the outer surface of the object is displayed in the scene of the expressway, only the lightweight models of the trees, buildings and other objects at the two sides of the expressway need to be displayed, and all BIM models do not need to be loaded, so that the loading amount can be reduced, and the loading speed can be increased.
Further, in another embodiment of the present application, step S330 may be replaced with:
s332, traversing the BIM patch, initializing a patch deletion flag to be 'deleted', and acquiring V = (x, y, z) for each vertex in the patch
DisX=min{(x-xmin),(xmax-x)}
DisY=min{(y-ymin),(ymax-y)}
DisZ=(zmax-z)
Dis=min(DisX, DisY, DisZ)。
Accordingly, step S340 may be replaced;
s342, if Diskp= DisX, and Diskp<k1*(xmax-xmin) (ii) a Or if Diskp= DisY, and Diskp<k1*(ymax-ymin) (ii) a Or if Diskp= DisZ, and Diskp<k1*(zmax-zmin) (ii) a Then the delete flag of the patch is set to "not deleted" and the next patch of the BIM is traversed.
Accordingly, in the embodiment of the present application, step S430 may be replaced with:
s432, go through Bs-1The deletion flag of the initialized patch is "delete", for each patch within the patchEach vertex V = (x, y, z), and obtain
DisX=min{(x-xmin),(xmax-x)}
DisY=min{(y-ymin),(ymax-y)}
DisZ=(zmax-z)
Dis=min(DisX, DisY, DisZ)。
Accordingly, step S440 may be replaced with;
s442, if Diskp= DisX, and Diskp<ks*(xmax-xmin) (ii) a Or if Diskp= DisY, and Diskp<ks*(ymax-ymin) (ii) a Or if Diskp= DisZ, and Diskp<ks*(zmax-zmin) (ii) a Then set the delete flag of the patch to "no delete", traverse Bs-1The next patch of (a).
Compared with the previous embodiment, the present embodiment provides a different lightweight generative model, and can achieve the same technical effect without loading all BIM models.
Although some specific embodiments of the present application have been described in detail by way of illustration, it should be understood by those skilled in the art that the above illustration is only for purposes of illustration and is not intended to limit the scope of the present application. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present application. The scope of the present application is defined by the appended claims.
Claims (8)
1. A BIM and GIS based convergence system comprising a communicatively connected server and memory, the server comprising one or more processors and a storage medium storing a computer program; tile level list T = (T) with GIS stored in the memory1，T2，...Ti...，Tn) N is the number of tile levels, TiFor the ith tile level in the tile level list, any tile level i has a unique identification TIDiI takes on values from 1 to n, and any BI is storedWeight reduction model of M B = (B)1，B2，......，Bm) M is the number of lightweight models, wherein B1，B2，......，BmThe lightweight degree of the tile is sequentially increased, and a mapping relation exists between the tile level list T and the lightweight model B;
the processor is used for realizing the following steps when executing the computer program:
step S100, obtaining tile level T of GISiAccording to TiIndex to Bj，BjTile level T corresponding to BIM modeliJ takes a value of 1 to m;
step S200, presenting tile level T of GISiAnd Bj；
The lightweight model for any BIM can be realized by the following steps:
s300, generating a lightweight model B1The method specifically comprises the following steps:
s310, obtaining the number VN of the vertexes of the BIM, and if the VN is larger than a preset threshold, executing S320;
s320, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x axis, the y axis and the z axismin，ymin，zmin) And maximum value (x)max，ymax，zmax) And acquiring a bounding box formed by the minimum value and the maximum value;
s330, traversing the BIM patches, initializing the deletion flag of the patch as 'delete', and obtaining Dis = min { (x-x) for each vertex V = (x, y, z) in each patchmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}；
S340, if Diskp<D1, setting the deletion flag of the current patch as 'no deletion', and traversing the next patch of the BIM; until all the patches are traversed; dis (disease)kpThe peak of the kth patch in the BIM is the p peak, the value of k is 1 to N, N is the number of patches of the BIM, the value of p is 1 to H, and H is the number of peaks of the kth patch; otherwise, executing S350;
s350, traversing the next vertex of the patch k; returning to S340;
s360, after traversing all patches of the BIM, extracting patches with deletion marks of 'no deletion' as patches of the lightweight model of B1;
s400, generating a lightweight model BsAnd s is more than or equal to 2 and less than or equal to m, and the method specifically comprises the following steps:
s410, obtaining Bs-1VN, if VN is greater than a preset threshold, then S420 is performed;
s420, acquiring the minimum value (x) of all vertexes in the BIM in the directions of the x, y and z axesmin，ymin，zmin) And maximum value (x)max，ymax，zmax）；
S430, traverse Bs-1The patch of (1), the delete flag of the initialized patch is "delete", and for each vertex V = (x, y, z) within each patch, Dis = min { (x-x) is obtainedmin),(xmax-x),(y-ymin),(ymax-y),(z-zmin),(zmax-z)}；
S440, if Diskp<Ds, setting the deletion mark of the current patch as 'no deletion', and traversing Bs-1The next patch of (a); until all the patches are traversed; dis (disease)kpIs Bs-1The value of k is 1 to N, and N is Bs-1The number of patches, p is 1 to H, H is Bs-1The number of vertices of the kth patch; otherwise, executing S450;
s450, go through Bs-1The next vertex of the kth panel; returning to S440;
s460, traversing Bs-1After all the patches, extracting the patch with the deletion flag of 'no deletion' as BsThe surface patch of the lightweight model of (1).
2. The system of claim 1, wherein Dis in S330 and S440 is replaced with Dis = min { (x-x)min),(xmax-x),(y-ymin),(ymax-y),(zmax-z)}。
3. The system of claim 1, wherein D1= k1 { (x)max-xmin)2+(ymax-ymin)2+(zmax-zmin)2}1/2K1 is a preset empirical parameter.
4. The system of claim 1, wherein Ds = ks { (x)max-xmin)2+(ymax-ymin)2+(zmax-zmin)2}1/2Ks is a predetermined empirical parameter, ks-ks-1<0。
5. The system of claim 4, wherein step S330 is replaced with:
s332, traversing the BIM patch, initializing a patch deletion flag to be 'deleted', and acquiring V = (x, y, z) for each vertex in the patch
DisX=min{(x-xmin),(xmax-x)}
DisY=min{(y-ymin),(ymax-y)}
DisZ=(zmax-z)
Dis=min(DisX, DisY, DisZ)；
Step S340 is replaced with:
s342, if Diskp= DisX, and Diskp<k1*(xmax-xmin) (ii) a Or if Diskp= DisY, and Diskp<k1*(ymax-ymin) (ii) a Or if Diskp= DisZ, and Diskp<k1*(zmax-zmin) (ii) a Then the delete flag of the patch is set to "not deleted" and the next patch of the BIM is traversed.
6. The system of claim 4, wherein step S430 is replaced with:
s432, go through Bs-1The delete flag of the initialized patch is "delete", for each vertex V within the patch= (x, y, z), acquisition
DisX=min{(x-xmin),(xmax-x)}
DisY=min{(y-ymin),(ymax-y)}
DisZ=(zmax-z)
Dis=min(DisX, DisY, DisZ)；
Step S440 is replaced with:
s442, if Diskp= DisX, and Dis<ks*(xmax-xmin) (ii) a Or if Diskp= DisY, and Diskp<ks*(ymax-ymin) (ii) a Or if Diskp= DisZ, and Diskp<ks*(zmax-zmin) (ii) a Then set the delete flag of the patch to "no delete", traverse Bs-1The next patch of (a).
7. The system of claim 1, wherein m =1 or m = 2.
8. The system of claim 3, wherein 0.05 ≦ k1 ≦ 0.2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111382992.5A CN114065354B (en) | 2021-11-22 | 2021-11-22 | Fusion system based on BIM and GIS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111382992.5A CN114065354B (en) | 2021-11-22 | 2021-11-22 | Fusion system based on BIM and GIS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114065354A true CN114065354A (en) | 2022-02-18 |
| CN114065354B CN114065354B (en) | 2022-06-17 |
Family
ID=80278748
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111382992.5A Active CN114065354B (en) | 2021-11-22 | 2021-11-22 | Fusion system based on BIM and GIS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114065354B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117113478A (en) * | 2023-07-28 | 2023-11-24 | 中水淮河规划设计研究有限公司 | BIM model light weight method |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106844977A (en) * | 2017-01-23 | 2017-06-13 | 重庆市勘测院 | A kind of town road BIM designs a model and GIS data integrated approach |
| CN107330078A (en) * | 2017-07-02 | 2017-11-07 | 四川藏区高速公路有限责任公司 | A kind of road network operation electromechanical equipment interactive controlling platform and method based on 3DGIS+BIM |
| CN107895031A (en) * | 2017-11-22 | 2018-04-10 | 重庆市勘测院 | BIM adaptive dynamic dispatching method in the scene of three-dimensional digital city |
| CN109885626A (en) * | 2019-01-30 | 2019-06-14 | 北京筑业志远软件开发有限公司 | Urban construction digital archives intelligent management system based on structural data and BIM model |
| CN110704928A (en) * | 2019-09-29 | 2020-01-17 | 长江航道规划设计研究院 | Method for converting BIM model into GIS model |
| US20200134560A1 (en) * | 2018-10-29 | 2020-04-30 | DIGIBILT, Inc. | Method and system for automatically creating a bill of materials |
| CN111597605A (en) * | 2020-04-02 | 2020-08-28 | 中国国家铁路集团有限公司 | Railway dynamic simulation cockpit system |
| CN111914329A (en) * | 2020-08-06 | 2020-11-10 | 中铁二院工程集团有限责任公司 | Method for automatically fusing roadbed BIM model and three-dimensional terrain |
| CN112035433A (en) * | 2020-08-12 | 2020-12-04 | 华设设计集团股份有限公司 | Method for converting BIM model into GIS model supporting large-volume grading loading |
| CN112287057A (en) * | 2020-11-05 | 2021-01-29 | 江苏燕宁工程科技集团有限公司 | BIM and GIS based engineering project information query processing method and system |
| CN112347212A (en) * | 2020-11-06 | 2021-02-09 | 中铁第一勘察设计院集团有限公司 | Railway cloud GIS platform for BIM application and building method thereof |
| CN112613087A (en) * | 2020-12-17 | 2021-04-06 | 重庆市筑云科技有限责任公司 | Three-engine platform based on BIM, GIS and VR |
| CN112765720A (en) * | 2021-02-26 | 2021-05-07 | 黄河勘测规划设计研究院有限公司 | Water conservancy and hydropower engineering multi-source data fusion method based on BIM + GIS |
| WO2021184689A1 (en) * | 2020-03-16 | 2021-09-23 | 平安科技（深圳）有限公司 | Model data processing method, apparatus and device, and computer-readable storage medium |
-
2021
- 2021-11-22 CN CN202111382992.5A patent/CN114065354B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106844977A (en) * | 2017-01-23 | 2017-06-13 | 重庆市勘测院 | A kind of town road BIM designs a model and GIS data integrated approach |
| CN107330078A (en) * | 2017-07-02 | 2017-11-07 | 四川藏区高速公路有限责任公司 | A kind of road network operation electromechanical equipment interactive controlling platform and method based on 3DGIS+BIM |
| CN107895031A (en) * | 2017-11-22 | 2018-04-10 | 重庆市勘测院 | BIM adaptive dynamic dispatching method in the scene of three-dimensional digital city |
| US20200134560A1 (en) * | 2018-10-29 | 2020-04-30 | DIGIBILT, Inc. | Method and system for automatically creating a bill of materials |
| CN109885626A (en) * | 2019-01-30 | 2019-06-14 | 北京筑业志远软件开发有限公司 | Urban construction digital archives intelligent management system based on structural data and BIM model |
| CN110704928A (en) * | 2019-09-29 | 2020-01-17 | 长江航道规划设计研究院 | Method for converting BIM model into GIS model |
| WO2021184689A1 (en) * | 2020-03-16 | 2021-09-23 | 平安科技（深圳）有限公司 | Model data processing method, apparatus and device, and computer-readable storage medium |
| CN111597605A (en) * | 2020-04-02 | 2020-08-28 | 中国国家铁路集团有限公司 | Railway dynamic simulation cockpit system |
| CN111914329A (en) * | 2020-08-06 | 2020-11-10 | 中铁二院工程集团有限责任公司 | Method for automatically fusing roadbed BIM model and three-dimensional terrain |
| CN112035433A (en) * | 2020-08-12 | 2020-12-04 | 华设设计集团股份有限公司 | Method for converting BIM model into GIS model supporting large-volume grading loading |
| CN112287057A (en) * | 2020-11-05 | 2021-01-29 | 江苏燕宁工程科技集团有限公司 | BIM and GIS based engineering project information query processing method and system |
| CN112347212A (en) * | 2020-11-06 | 2021-02-09 | 中铁第一勘察设计院集团有限公司 | Railway cloud GIS platform for BIM application and building method thereof |
| CN112613087A (en) * | 2020-12-17 | 2021-04-06 | 重庆市筑云科技有限责任公司 | Three-engine platform based on BIM, GIS and VR |
| CN112765720A (en) * | 2021-02-26 | 2021-05-07 | 黄河勘测规划设计研究院有限公司 | Water conservancy and hydropower engineering multi-source data fusion method based on BIM + GIS |
Non-Patent Citations (2)
| Title |
|---|
| WEIGUO XIANG等: "Research on Integration of Multi-source BIM Models Based on GIS Platform", 《THE 5TH INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT》 * |
| 何刚等: "高速公路BIM+GIS多源数据集成与融合探析", 《科学技术创新》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117113478A (en) * | 2023-07-28 | 2023-11-24 | 中水淮河规划设计研究有限公司 | BIM model light weight method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114065354B (en) | 2022-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108763287B (en) | Construction method of large-scale passable regional driving map and unmanned application method thereof | |
| CN113009506B (en) | Virtual-real combined real-time laser radar data generation method, system and equipment | |
| US6208997B1 (en) | Rapid production of optimal-quality reduced-resolution representations of very large databases | |
| CN113761999B (en) | Target detection method and device, electronic equipment and storage medium | |
| CN112132929B (en) | Grid map marking method based on depth vision and single-line laser radar | |
| CN108564650B (en) | Lane tree target identification method based on vehicle-mounted 2D LiDAR point cloud data | |
| CN111640180B (en) | Three-dimensional reconstruction method and device and terminal equipment | |
| CN111402414A (en) | Point cloud map construction method, device, equipment and storage medium | |
| CN111105495A (en) | Laser radar mapping method and system fusing visual semantic information | |
| CN114386293B (en) | Virtual-real synthesized laser radar point cloud generation method and device | |
| CN112652065A (en) | Three-dimensional community modeling method and device, computer equipment and storage medium | |
| CN112305559A (en) | Power transmission line distance measuring method, device and system based on ground fixed-point laser radar scanning and electronic equipment | |
| CN114065354B (en) | Fusion system based on BIM and GIS | |
| WO2023060632A1 (en) | Street view ground object multi-dimensional extraction method and system based on point cloud data | |
| WO2023124676A1 (en) | 3d model construction method, apparatus, and electronic device | |
| JP4619504B2 (en) | 3D digital map generator | |
| CN114202622A (en) | Virtual building generation method, device, equipment and computer readable storage medium | |
| CN112507891B (en) | Method and device for automatically identifying high-speed intersection and constructing intersection vector | |
| CN109785421B (en) | Texture mapping method and system based on air-ground image combination | |
| CN115375857B (en) | Three-dimensional scene reconstruction method, device, equipment and storage medium | |
| CN115164919B (en) | Method and device for constructing spatial travelable area map based on binocular camera | |
| CN116580168A (en) | Building white mould construction method, device, equipment and storage medium | |
| CN112084854B (en) | Obstacle detection method, obstacle detection device and robot | |
| JP2006172099A (en) | Changed region recognition device and change recognition system | |
| CN111221998B (en) | Multi-view operation checking method and device based on point cloud track picture linkage |
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 |