Author(s):  
Z. Lari ◽  
K. Al-Durgham ◽  
A. Habib

Terrestrial laser scanning (TLS) systems have been established as a leading tool for the acquisition of high density three-dimensional point clouds from physical objects. The collected point clouds by these systems can be utilized for a wide spectrum of object extraction, modelling, and monitoring applications. Pole-like features are among the most important objects that can be extracted from TLS data especially those acquired in urban areas and industrial sites. However, these features cannot be completely extracted and modelled using a single TLS scan due to significant local point density variations and occlusions caused by the other objects. Therefore, multiple TLS scans from different perspectives should be integrated through a registration procedure to provide a complete coverage of the pole-like features in a scene. To date, different segmentation approaches have been proposed for the extraction of pole-like features from either single or multiple-registered TLS scans. These approaches do not consider the internal characteristics of a TLS point cloud (local point density variations and noise level in data) and usually suffer from computational inefficiency. To overcome these problems, two recently-developed PCA-based parameter-domain and spatial-domain approaches for the segmentation of pole-like features are introduced, in this paper. Moreover, the performance of the proposed segmentation approaches for the extraction of pole-like features from a single or multiple-registered TLS scans is investigated in this paper. The alignment of the utilized TLS scans is implemented using an Iterative Closest Projected Point (ICPP) registration procedure. Qualitative and quantitative evaluation of the extracted pole-like features from single and multiple-registered TLS scans, using both of the proposed segmentation approaches, is conducted to verify the extraction of more complete pole-like features using multipleregistered TLS scans.


2013 ◽  
Vol 36 (5) ◽  
pp. 550-551 ◽  
Author(s):  
Kevin J. Holmes ◽  
Phillip Wolff

AbstractRecent research investigating the language–thought interface in the spatial domain points to representations of the horizontal and vertical dimensions that closely resemble those posited by Jeffery et al. However, the findings suggest that such representations, rather than being tied to navigation, may instead reflect more general properties of the perception of space.


2017 ◽  
Vol 31 (19-21) ◽  
pp. 1740077 ◽  
Author(s):  
Yaolin Zhu ◽  
Li Tian ◽  
Taoruan Wan

We present a new approach to repair degenerated and self-intersected mesh of digitized human models, which automatically transforms a raw digitized mesh into a single manifold and closed triangle mesh. The algorithm interactively removes growing neighborhoods of undesired elements and fills resulted surface gaps to yield meshes which subject to user-specified quality criteria. We demonstrate our experimental results by multiple sets of low-quality original models with qualitative measurements compared with a number of existing methods. The results show that the proposed method produces high visual quality meshes with minimal changes of the original mesh appearances.


2014 ◽  
Vol 41 (7) ◽  
pp. 0701001
Author(s):  
董建文 Dong Jianwen ◽  
陈定尘 Chen Dingchen ◽  
庞晓宁 Pang Xiaoning ◽  
刘远致 Liu Yuanzhi ◽  
许宗玺 Xu Zongxi

Author(s):  
Mingdong Zhou ◽  
Michael Yu Wang ◽  
Li Li

A novel structural optimization method that utilizes both explicit and implicit geometric representations is presented. In this method, an octree grid is adopted to accommodate the free structural interface of an implicit level set model and a corresponding 2-manifold triangle mesh model. Within each iteration of optimization, the interface is evolved implicitly by using a semi-Lagrange level set method, during which the signed distance field is evaluated directly and accurately from the current surface model other than interpolation. After that, another mesh model is extracted from the updated field and serves as the input of subsequent design process. This hybrid and adaptive representation scheme not only achieves “narrow band computation”, but also facilitates the structural analysis by using a geometry-aware mesh-free approach. Moreover, a feature preserving and topological errorless mesh simplification algorithm can also be leveraged to enhance the computational efficiency. A three dimensional benchmark example is provided to demonstrate the capability and potential of this method.


Author(s):  
Xiaodong Lu ◽  
Pei-Feng Hsu

Parallel computing of the transient radiative transfer process in the three-dimensional homogeneous and nonhomogeneous participating media is studied with an integral equation model. The model can be used for analyzing the ultra-short light pulse propagation within the highly scattering media. Two numerical quadratures are used: the discrete rectangular volume (DRV) method and YIX method. The parallel versions of both methods are developed for one-dimensional and three-dimensional geometries, respectively. Both quadratures achieve good speedup in parallel performance. Because the integral equation model uses very small amount of memory, the parallel computing can take advantage of having each compute node or processor store the full spatial domain information without using the typical domain decomposition parallelism, which will be necessary in other solution methods, e.g., discrete ordinates and finite volume methods, for large scale simulations. The parallel computation is conducted by assigning different portion of the quadrature to different compute node. In DRV method, a variation of the spatial domain decomposition is used. In the case of YIX scheme, the angular quadrature is divided up according to the number of compute nodes, instead of the spatial domain being divided. This parallel scheme minimizes the communications overhead. The only communication needed is at the end of each time step when each node shares the partial integrated result of the current time step with all other compute nodes. The angular quadrature decomposition approach leads to very good parallel efficiency. Two new discrete ordinate sets are used in the YIX angular quadrature and their parallel performances are discussed. One of the discrete ordinates sets, called spherical ring set, is also suitable for use in the conventional discrete ordinates method.


Sign in / Sign up

Export Citation Format

Share Document