IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0293105
(2016-10-13)
|
등록번호 |
US-10255720
(2019-04-09)
|
발명자
/ 주소 |
- Godzaridis, Elenie
- St-Pierre, Mathieu
|
출원인 / 주소 |
- Bentley Systems, Incorporated
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
0 인용 특허 :
3 |
초록
▼
In an example embodiment, a technique is provided for reconstructing and analyzing a mesh surface based on a combination of 2.5D and 3D point data that involves building a hybrid spatial index whose nodes are labeled as containing 2.5D data or 3D data, and whose branching is adapted to such types of
In an example embodiment, a technique is provided for reconstructing and analyzing a mesh surface based on a combination of 2.5D and 3D point data that involves building a hybrid spatial index whose nodes are labeled as containing 2.5D data or 3D data, and whose branching is adapted to such types of data. The hybrid spatial index is then used to reconstruct the mesh surface and analyze the mesh surface, taking advantage of more efficient algorithms adapted to specific types of data. The technique may allow for a hybrid spatial index that uses fewer nodes, and for use of 2.5D specific reconstruction and analysis algorithms for at least a part of the mesh surface.
대표청구항
▼
1. A method comprising: accessing, a plurality of data sources that collectively include 2.5D point data and 3D point data;classifying each of the data sources as being either a 2.5D data source or a 3D data source;building, by the application, a hybrid spatial index organized as a tree having nodes
1. A method comprising: accessing, a plurality of data sources that collectively include 2.5D point data and 3D point data;classifying each of the data sources as being either a 2.5D data source or a 3D data source;building, by the application, a hybrid spatial index organized as a tree having nodes associated with point data, the nodes arranged in one or more levels according to parent-child relationships, each node labeled as containing 2.5D data or 3D data;executing, by the application, a reconstruction process independently on point data associated with each node of the hybrid spatial index to reconstruct a mesh surface, wherein the reconstruction process employs a different reconstruction algorithm on nodes labeled as containing 2.5D data than on nodes labeled as containing 3D data; andstoring the reconstructed mesh surface. 2. The method of claim 1, wherein branching in the hybrid spatial index is adaptive to whether each parent node is associated with 2.5D data or 3D data, such that branching from a parent node labeled as containing 2.5D data differs from branching from a parent node labeled as containing 3D data. 3. The method of claim 2, wherein parent nodes labeled as containing 2.5D data branch to four child nodes and parent nodes labeled as containing 3D data branch to eight child nodes. 4. The method of claim 1, wherein a 2.5D specific reconstruction algorithm is employed on nodes labeled as containing 2.5D data and a 3D capable reconstruction algorithm is employed on nodes labeled as containing 3D data. 5. The method of claim 4, wherein the 2.5D specific reconstruction algorithm is a 2.5D Delaunay triangulation algorithm. 6. The method of claim 4, wherein the 3D capable reconstruction algorithm is a Poisson surface reconstruction algorithm or a 3D Delaunay triangulation algorithm. 7. The method of claim 1, further comprising: performing analysis on the mesh surface, wherein a different analysis algorithm is employed on portions of the mesh surface of nodes labeled as containing 2.5D data than on portions of the mesh surface of nodes labeled as containing 3D data;combining results of the analysis to produce unified analysis results; andreturning the unified analysis results. 8. The method of claim 7, wherein a 2.5D specific analysis algorithm is employed on the portions of the mesh surface of nodes labeled as containing 2.5D data and a 3D capable analysis algorithm is employed on the portions of the mesh surface of nodes labeled as containing 3D data. 9. The method of claim 7, wherein the analysis includes at least one of volume calculation, ray projection, vector draping or drainage computation. 10. The method of claim 1, wherein a node that is associated with a combination of 2.5D point data and 3D point data is labeled as containing 3D data. 11. A method comprising: accessing, by an application executing on an electronic device, a hybrid spatial index for a mesh surface, the hybrid spatial index organized as a tree including nodes arranged in one or more levels according to parent-child relationships, each node labeled as containing 2.5D data or 3D data;performing, by the application, analysis on the mesh surface, wherein a different analysis algorithm is employed on a portion of the mesh surface of nodes labeled as containing 2.5D data than a portion of the mesh surface of nodes labeled as containing 3D data;combining results of the analysis to produce unified analysis results; andreturning the unified analysis results. 12. The method of claim 11, wherein a 2.5D specific analysis algorithm is employed on the portions of the mesh surface of nodes labeled as containing 2.5D data and a 3D capable analysis algorithm is employed on the portions of the mesh surface of nodes labeled as containing 3D data. 13. An electronic device comprising: a display screen;a processor; anda memory coupled to the processor and configured to store a plurality of data sources that collectively include 2.5D point data and 3D point data, and to store instructions of a visualization and analysis application, the instructions executable on the processor and when executed operable to: access the plurality of data sources in the memory;classify each of the data sources as being either a 2.5D data source or a 3D data source;build a hybrid spatial index organized as a tree having nodes associated with point data arranged in one or more levels according to parent-child relationships, wherein branching from a parent node labeled as containing 2.5D data differs from branching from a parent node labeled as containing 3D data;execute a reconstruction process independently on point data associated with each node of the hybrid spatial index to reconstruct a mesh surface; anddisplay the reconstructed mesh surface on the display screen. 14. The electronic device of claim 13, wherein each node of the hybrid spatial index is labeled as containing 2.5D data or 3D data, and the reconstruction process employs a different reconstruction algorithm on nodes labeled as containing 2.5D data than on nodes labeled as containing 3D data. 15. The electronic device of claim 14, wherein a 2.5D specific reconstruction algorithm is employed on nodes labeled as containing 2.5D data and a 3D capable reconstruction algorithm is employed on nodes labeled as containing 3D data. 16. The electronic device of claim 15, wherein the 2.5D specific reconstruction algorithm is a 2.5D Delaunay triangulation algorithm and the 3D capable reconstruction algorithm is a Poisson surface reconstruction algorithm or a 3D Delaunay triangulation algorithm. 17. The electronic device of claim 13, wherein each node of the hybrid spatial index is labeled as containing 2.5D data or 3D data and the instructions when executed are further operable to: perform analysis on the mesh surface, wherein a different analysis algorithm is employed on a portion of the mesh surface of nodes labeled as containing 2.5D data than a portion of the mesh surface of nodes labeled as containing 3D data;combine results of the analysis to produce unified analysis results; andreturn the unified analysis results. 18. The electronic device of claim 17, wherein a 2.5D specific analysis algorithm is employed on the portion of the mesh surface of nodes labeled as containing 2.5D data and a 3D capable analysis algorithm is employed on the portion of the mesh surface of nodes labeled as containing 3D data. 19. The electronic device of claim 17, wherein the analysis includes at least one of volume calculation, ray projection, vector draping or drainage computation. 20. The electronic device of claim 17, wherein a node that is associated with a combination of 2.5D point data and 3D point data is labeled as containing 3D data.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.