Computation of curvatures over discrete geometry using biharmonic surfaces

The computation of curvature quantities over discrete geometry is often required when processing geometry composed of meshes. Curvature information is often important for the purpose of shape analysis, feature recognition and geometry segmentation. In this paper we present a method for accurate estimation of curvature on discrete geometry especially those composed of meshes. We utilise a method based on fitting a continuous surface arising from the solution of the Biharmonic equation subject to suitable boundary conditions over a 1-ring neighbourhood of the mesh geometry model. This enables us to accurately determine the curvature distribution of the local area. We show how the curvature can be computed efficiently by means of utilising an analytic solution representation of the chosen Biharmonic equation. In order to demonstrate the method we present a series of examples whereby we show how the curvature can be efficiently computed over complex geometry which are represented discretely by means of mesh models

3D Object Segmentation of Point Clouds using Profiling Techniques

In the automatic processing of point clouds, higher level information in the form of point segments is required for classification and object detection purposes. Segmentation allows for the definition of these segments. Because of the increasing size of point clouds faster and more reliable segmentation methods are being sought. Various algorithms have been proposed for the segmentation of point clouds. In this paper, an extension of a segmentation approach based on intersecting profiles is proposed. In the presented method, surfaces are considered as a graph of intersecting planar curves. In this graph structure curves intersect at common points and terminate at surface discontinuities. This property of the curves makes it possible to determine point segments by connected components. A method for the detection of curves in the profiles is presented. The algorithm has been tested on terrestrial lidar point clouds

A Reconstruction Algorithm for Blade Surface Based on Less Measured Points

A reconstruction algorithm for blade surface from less measured points of section curves is given based on B-spline surface interpolation. The less measured points are divided into different segments by the key geometric points and throat points which are defined according to design concepts. The segmentations are performed by different fitting algorithms with consideration of curvature continuity as their boundary condition to avoid flow disturbance. Finally, a high-quality reconstruction surface model is obtained by using the B-spline curve meshes constructed by paired points. The advantage of this algorithm is the simplicity and effectivity reconstruction of blade surface to ensure the aerodynamic performance. Moreover, the obtained paired points can be regarded as measured points to measure and reconstruct the blade surface directly. Experimental results show that the reconstruction blade surface is suitable for precisely representing blade, evaluating machining accuracy, and analyzing machining allowance

How do ICP variants perform when used for scan matching terrain point clouds?

Many variants of the Iterative Closest Point (ICP) algorithm have been proposed for registering point clouds. This paper explores the performance of 20,736 ICP variants applied to the registration of point clouds for the purpose of terrain mapping, using data obtained from a mobile platform. The methodology of the study has involved taking sequences of 100 consecutive scans at three distinct scenes along the route of a mining haul truck operating in a typical surface mining environment. The scan sequences were obtained at 20 Hz from a Velodyne HDL-64E mounted on the truck. The aim is to understand how well the ICP variants perform in consolidating these scans into sub-maps. Variants are compared against three metrics: accuracy, precision, and relative computational cost. The main finding of the paper is that none of the variants is simultaneously accurate, precise, and fast to compute, across all three scenes. The best performing variants employed strategies that filtered the data sets, used local surface geometry in the form normals, and used the distance between points in one point cloud to a corresponding surface from a reference point cloud as a measure of the fit between two point clouds. The significance of this work is that it: (i) provides guidance in the construction of ICP variants for terrain mapping; and (ii) identifies the significant limitations of existing ICP variants for this application

A Hybrid Digitization Mehtod For Reverse Engineering

Master'sMASTER OF ENGINEERIN

Surface Reconstruction from Unorganized Point Cloud Data via Progressive Local Mesh Matching

This thesis presents an integrated triangle mesh processing framework for surface reconstruction based on Delaunay triangulation. It features an innovative multi-level inheritance priority queuing mechanism for seeking and updating the optimum local manifold mesh at each data point. The proposed algorithms aim at generating a watertight triangle mesh interpolating all the input points data when all the fully matched local manifold meshes (umbrellas) are found. Compared to existing reconstruction algorithms, the proposed algorithms can automatically reconstruct watertight interpolation triangle mesh without additional hole-filling or manifold post-processing. The resulting surface can effectively recover the sharp features in the scanned physical object and capture their correct topology and geometric shapes reliably. The main Umbrella Facet Matching (UFM) algorithm and its two extended algorithms are documented in detail in the thesis. The UFM algorithm accomplishes and implements the core surface reconstruction framework based on a multi-level inheritance priority queuing mechanism according to the progressive matching results of local meshes. The first extended algorithm presents a new normal vector combinatorial estimation method for point cloud data depending on local mesh matching results, which is benefit to sharp features reconstruction. The second extended algorithm addresses the sharp-feature preservation issue in surface reconstruction by the proposed normal vector cone (NVC) filtering. The effectiveness of these algorithms has been demonstrated using both simulated and real-world point cloud data sets. For each algorithm, multiple case studies are performed and analyzed to validate its performance

Adaptive slicing of cloud data for reverse engineering and direct rapid prototyping model construction

Master'sMASTER OF ENGINEERIN

Fixtureless geometric inspection of nonrigid parts using "generalized numerical inspection fixture"

Free-form nonrigid parts form the substance of today’s automotive and aerospace industries. These parts have different shapes in free state due to their dimensional and geometric variations, gravity and residual strains. For the geometric inspection of such compliant parts, special inspection fixtures, in combination with coordinate measuring systems (CMM) and/or optical data acquisition devices (scanners) are used. This inevitably causes additional costs and delays that result in a lack of competitiveness in the industry. The goal of this thesis is to facilitate the dimensional and geometrical inspection of flexible components from a point cloud without using a jig or secondary conformation operation. More specifically, we aim to develop a methodology to localize and quantify the profile defects in the case of thin shells which are typical to the aerospace and automotive industries. The presented methodology is based on the fact that the interpoint geodesic distance between any two points of a shape remains unchangeable during an isometric deformation. This study elaborates on the theory and general methods for the metrology of nonrigid parts. We have developed a Generalized Numerical Inspection Fixture (GNIF), a robust methodology which merges existing technologies in metric and computational geometry, nonlinear dimensionality reduction techniques, and finite element methods to introduce a general approach to the fixtureless geometrical inspection of nonrigid parts

Extraction robuste de primitives géométriques 3D dans un nuage de points et alignement basé sur les primitives

Dans ce projet, nous étudions les problèmes de rétro-ingénierie et de contrôle de la qualité qui jouent un rôle important dans la fabrication industrielle. La rétro-ingénierie tente de reconstruire un modèle 3D à partir de nuages de points, qui s’apparente au problème de la reconstruction de la surface 3D. Le contrôle de la qualité est un processus dans lequel la qualité de tous les facteurs impliqués dans la production est abordée. En fait, les systèmes ci-dessus nécessitent beaucoup d’intervention de la part d’un utilisateur expérimenté, résultat souhaité est encore loin soit une automatisation complète du processus. Par conséquent, de nombreux défis doivent encore être abordés pour atteindre ce résultat hautement souhaitable en production automatisée. La première question abordée dans la thèse consiste à extraire les primitives géométriques 3D à partir de nuages de points. Un cadre complet pour extraire plusieurs types de primitives à partir de données 3D est proposé. En particulier, une nouvelle méthode de validation est proposée pour évaluer la qualité des primitives extraites. À la fin, toutes les primitives présentes dans le nuage de points sont extraites avec les points de données associés et leurs paramètres descriptifs. Ces résultats pourraient être utilisés dans diverses applications telles que la reconstruction de scènes on d’édifices, la géométrie constructive et etc. La seconde question traiée dans ce travail porte sur l’alignement de deux ensembles de données 3D à l’aide de primitives géométriques, qui sont considérées comme un nouveau descripteur robuste. L’idée d’utiliser les primitives pour l’alignement arrive à surmonter plusieurs défis rencontrés par les méthodes d’alignement existantes. Ce problème d’alignement est une étape essentielle dans la modélisation 3D, la mise en registre, la récupération de modèles. Enfin, nous proposons également une méthode automatique pour extraire les discontinutés à partir de données 3D d’objets manufacturés. En intégrant ces discontinutés au problème d’alignement, il est possible d’établir automatiquement les correspondances entre primitives en utilisant l’appariement de graphes relationnels avec attributs. Nous avons expérimenté tous les algorithmes proposés sur différents jeux de données synthétiques et réelles. Ces algorithmes ont non seulement réussi à accomplir leur tâches avec succès mais se sont aussi avérés supérieus aux méthodes proposées dans la literature. Les résultats présentés dans le thèse pourraient s’avérér utilises à plusieurs applications.In this research project, we address reverse engineering and quality control problems that play significant roles in industrial manufacturing. Reverse engineering attempts to rebuild a 3D model from the scanned data captured from a object, which is the problem similar to 3D surface reconstruction. Quality control is a process in which the quality of all factors involved in production is monitored and revised. In fact, the above systems currently require significant intervention from experienced users, and are thus still far from being fully automated. Therefore, many challenges still need to be addressed to achieve the desired performance for automated production. The first proposition of this thesis is to extract 3D geometric primitives from point clouds for reverse engineering and surface reconstruction. A complete framework to extract multiple types of primitives from 3D data is proposed. In particular, a novel validation method is also proposed to assess the quality of the extracted primitives. At the end, all primitives present in the point cloud are extracted with their associated data points and descriptive parameters. These results could be used in various applications such as scene and building reconstruction, constructive solid geometry, etc. The second proposition of the thesis is to align two 3D datasets using the extracted geometric primitives, which is introduced as a novel and robust descriptor. The idea of using primitives for alignment is addressed several challenges faced by existing registration methods. This alignment problem is an essential step in 3D modeling, registration and model retrieval. Finally, an automatic method to extract sharp features from 3D data of man-made objects is also proposed. By integrating the extracted sharp features into the alignment framework, it is possible implement automatic assignment of primitive correspondences using attribute relational graph matching. Each primitive is considered as a node of the graph and an attribute relational graph is created to provide a structural and relational description between primitives. We have experimented all the proposed algorithms on different synthetic and real scanned datasets. Our algorithms not only are successful in completing their tasks with good results but also outperform other methods. We believe that the contribution of them could be useful in many applications