Finding approximate shape regularities in reverse engineered solid models bounded by simple surfaces

Current reverse engineering systems are able to generate simple valid boundary representation (B-rep) models from 3D range data. Such models suffer from various inaccuracies caused by noise in the input data and algorithms. The quality of reverse engineered geometric models can potentially be improved by finding candidate shape regularities in such an initial model, and imposing a suitable subset of them on the model by using constraints, in a postprocessing step called beautification. Finding such candidate regularities is a necessary first step, and is discussed in this paper. Algorithms for analysis are presented which use feature objects to describe properties of faces, edges and vertices, and small groups of these elements in a B-rep model with only planar, spherical, cylindrical, conical and toroidal faces. The methods seek similarities between feature objects, e.g. axes which are parallel, for each property type. For each group of similar feature objects they also try to find a special feature object which might represent the group, e.g. an integer value which approximates the radius of similar cylinders. The feature objects used represent shape parameters, directions, axes and positions present in the model. Experiments show that the regularities found by these algorithms include the desired regularities. Although other spurious regularities which must be discarded in subsequent beautification steps are also produced, their number can be reduced by appropriate choice of tolerance values.

[1]  Ralph R. Martin,et al.  Algorithms for reverse engineering boundary representation models , 2001, Comput. Aided Des..

[2]  Ralph R. Martin,et al.  Constrained fitting in reverse engineering , 2002, Comput. Aided Geom. Des..

[3]  David Eppstein,et al.  Fast hierarchical clustering and other applications of dynamic closest pairs , 1999, SODA '98.

[4]  Mukarram Ahmad,et al.  Continued fractions , 2019, Quadratic Number Theory.

[5]  David H. Bailey,et al.  Recognizing Numerical Constants , 1995 .

[6]  Robert B. Fisher,et al.  Object reconstruction by incorporating geometric constraints in reverse engineering , 1999, Comput. Aided Des..

[7]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[8]  Frank C. Langbein,et al.  Estimate of frequencies of geometric regularities for use in reverse engineering of simple mechanica , 2000 .

[9]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[10]  Ralph R. Martin,et al.  Approximate symmetry detection for reverse engineering , 2001, SMA '01.

[11]  Paul Kutler,et al.  A Polynomial Time, Numerically Stable Integer Relation Algorithm , 1998 .

[12]  Ralph R. Martin,et al.  Reverse engineering of geometric models - an introduction , 1997, Comput. Aided Des..

[13]  Géza Kós An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds , 1999, Geometric Modelling.

[14]  J. Navarro-Pedreño Numerical Methods for Least Squares Problems , 1996 .

[15]  Ralph R. Martin,et al.  Faithful Least-Squares Fitting of Spheres, Cylinders, Cones and Tori for Reliable Segmentation , 1998, ECCV.

[16]  Thomas C. Henderson,et al.  Feature-based reverse engineering of mechanical parts , 1999, IEEE Trans. Robotics Autom..