Index model based on top-down greedy splitting R-tree and three-dimensional quadtree for massive point cloud management

2019 ◽  
Vol 13 (02) ◽  
pp. 1 ◽  
Author(s):  
Anbin Yu ◽  
Wensheng Mei
Keyword(s):  
Point Cloud ◽  
Three Dimensional ◽  
Top Down ◽  
Index Model ◽  
Massive Point ◽  
Model Based ◽  
Cloud Management

scholarly journals A Parallel N-Dimensional Space-Filling Curve Library and Its Application in Massive Point Cloud Management

2018 ◽  
Vol 7 (8) ◽  
pp. 327 ◽  
Author(s):  
Xuefeng Guan ◽  
Peter van Oosterom ◽  
Bo Cheng
Keyword(s):  
Point Cloud ◽  
Parallel Implementation ◽  
Dimensional Space ◽  
Space Filling ◽  
Oracle Database ◽  
Space Filling Curve ◽  
Object Oriented Design ◽  
Massive Point ◽  
Locality Preservation ◽  
Cloud Management

Because of their locality preservation properties, Space-Filling Curves (SFC) have been widely used in massive point dataset management. However, the completeness, universality, and scalability of current SFC implementations are still not well resolved. To address this problem, a generic n-dimensional (nD) SFC library is proposed and validated in massive multiscale nD points management. The library supports two well-known types of SFCs (Morton and Hilbert) with an object-oriented design, and provides common interfaces for encoding, decoding, and nD box query. Parallel implementation permits effective exploitation of underlying multicore resources. During massive point cloud management, all xyz points are attached an additional random level of detail (LOD) value l. A unique 4D SFC key is generated from each xyzl with this library, and then only the keys are stored as flat records in an Oracle Index Organized Table (IOT). The key-only schema benefits both data compression and multiscale clustering. Experiments show that the proposed nD SFC library provides complete functions and robust scalability for massive points management. When loading 23 billion Light Detection and Ranging (LiDAR) points into an Oracle database, the parallel mode takes about 10 h and the loading speed is estimated four times faster than sequential loading. Furthermore, 4D queries using the Hilbert keys take about 1~5 s and scale well with the dataset size.

Handheld Laser Scanner Research

2019 ◽  
Vol 952 (10) ◽  
pp. 47-54
Author(s):  
A.V. Komissarov ◽  
A.V. Remizov ◽  
M.M. Shlyakhova ◽  
K.K. Yambaev
Keyword(s):  
Point Cloud ◽  
Three Dimensional ◽  
Laser Scanner ◽  
Test Site ◽  
Optical Systems ◽  
Advantages And Disadvantages ◽  
Site Survey ◽  
Laser Scanners ◽  
Three Dimensional Models ◽  
The Stability

The authors consider hand-held laser scanners, as a new photogrammetric tool for obtaining three-dimensional models of objects. The principle of their work and the newest optical systems based on various sensors measuring the depth of space are described in detail. The method of simultaneous navigation and mapping (SLAM) used for combining single scans into point cloud is outlined. The formulated tasks and methods for performing studies of the DotProduct (USA) hand-held laser scanner DPI?8X based on a test site survey are presented. The accuracy requirements for determining the coordinates of polygon points are given. The essence of the performed experimental research of the DPI?8X scanner is described, including scanning of a test object at various scanner distances, shooting a test polygon from various scanner positions and building point cloud, repeatedly shooting the same area of the polygon to check the stability of the scanner. The data on the assessment of accuracy and analysis of research results are given. Fields of applying hand-held laser scanners, their advantages and disadvantages are identified.

scholarly journals Automatic Reconstruction of Multi-Level Indoor Spaces from Point Cloud and Trajectory

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3493
Author(s):  
Gahyeon Lim ◽  
Nakju Doh
Keyword(s):  
Point Cloud ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Reconstruction Method ◽  
Complex Environments ◽  
Indoor Space ◽  
Multi Level ◽  
Level Building ◽  
Indoor Spaces ◽  
Data Term

Remarkable progress in the development of modeling methods for indoor spaces has been made in recent years with a focus on the reconstruction of complex environments, such as multi-room and multi-level buildings. Existing methods represent indoor structure models as a combination of several sub-spaces, which are constructed by room segmentation or horizontal slicing approach that divide the multi-room or multi-level building environments into several segments. In this study, we propose an automatic reconstruction method of multi-level indoor spaces with unique models, including inter-room and inter-floor connections from point cloud and trajectory. We construct structural points from registered point cloud and extract piece-wise planar segments from the structural points. Then, a three-dimensional space decomposition is conducted and water-tight meshes are generated with energy minimization using graph cut algorithm. The data term of the energy function is expressed as a difference in visibility between each decomposed space and trajectory. The proposed method allows modeling of indoor spaces in complex environments, such as multi-room, room-less, and multi-level buildings. The performance of the proposed approach is evaluated for seven indoor space datasets.

Sign in / Sign up

Export Citation Format

Share Document