A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Registering range views of multipart objects
Computer Vision and Image Understanding
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Partitioning 3D Surface Meshes Using Watershed Segmentation
IEEE Transactions on Visualization and Computer Graphics
A Fast and Efficient Projection-Based Approach for Surface Reconstruction
SIBGRAPI '02 Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing
Geometric matching of 3D objects: assessing the range of successful initial configurations
NRC '97 Proceedings of the International Conference on Recent Advances in 3-D Digital Imaging and Modeling
Surface registration by matching oriented points
NRC '97 Proceedings of the International Conference on Recent Advances in 3-D Digital Imaging and Modeling
Estimating the tensor of curvature of a surface from a polyhedral approximation
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Hierarchical mesh decomposition using fuzzy clustering and cuts
ACM SIGGRAPH 2003 Papers
Algorithm Design
Hi-index | 0.00 |
Engineering Inspection (EI) requires automated verification of freeform parts. Currently, parts are verified by using alignment techniques on the inspected part and a CAD model. Applying the alignment on points or meshes is demanding and time-consuming. This work proposes a new alignment method to be applied on segments rather than on mesh elements. First, a discrete curvature analysis is applied on the meshes, and segments are extracted. Then, the inspected and CAD models are represented by segment graphs. Finally, a bipartite graph matching process is applied on the segment graphs, which are combined to be the two sides of a bipartite graph. As a result, a Combinatorial Matching Tree (CMT) is defined, and potential alignments are determined. The feasibility of the proposed segments alignment is demonstrated on real scanned engineering parts.