Current reverse engineering systems can generate boundary representation (B-rep) models from 3D range data. Such models suffer from inaccuracies caused by noise in the input data and algorithms. The quality of reverse engineered geometric models can be improved by finding candidate shape regularities in such a model, and constraining the model to meet a suitable subset of them, in a post-processing step called beautification. This paper discusses algorithms to detect such approximate regularities in terms of similarities between feature objects describing 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. For each group of similar feature objects they also seek special feature objects which may represent the group, e.g. an integer value which approximates the radius of similar cylinders. Experiments show that the regularities found by the algorithms include the desired regularities as well as spurious regularities, which can be limited by an appropriate choice of tolerances.

1.
Benko˝
,
P.
,
Martin
,
R. R.
, and,
Va´rady
,
T.
,
2001
, “
Algorithms for Reverse Engineering Boundary Representation Models
,”
Comput.-Aided Des.
,
22
, No.
11
, pp.
839
851
.
2.
Va´rady
,
T.
,
Martin
,
R. R.
, and
Cox
,
J.
,
1997
, “
Reverse Engineering of Geometric Models—An Introduction
,”
Comp.-Aided Des.
,
29
, No.
4
, pp.
255
268
.
3.
Ko´s, G., 2001, “An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds,” Computing, Suppl. 14, pp. 219–232.
4.
Luka´cs, G., Martin, R. R., and Marshall, A. D., 1998, “Faithful Least-Squares Fitting of Spheres, Cylinders, Cones and Tori for Reliable Segmentation,” Proceedings, 5th European Conf. Computer Vision, Budkhadj, H., and Neumann, B., eds., Springer, New York, NY, 1, pp. 671–686.
5.
Mills, B. I., Langbein, F. C., Marshall, A. D., and Martin, R. R., 2001, “Estimate of Frequencies of Geometric Regularities for Use in Reverse Engineering of Simple Mechanical Components,” Technical Report GVG 2001–1, Geometry and Vision Group, Dept. of Computer Science, Cardiff University, <uri: http://ralph.cs.cf.ac.uk/papers/Geometry/survey.pdf>.
6.
Benko˝, P., Ko´s, G., Va´rady, T., Andor, L., and Martin, R. R., 2001, “Constrained Fitting in Reverse Engineering,” Computer-Aided Geometric Design, to appear.
7.
Werghi
,
N.
,
Fisher
,
R.
,
Robertson
,
C.
, and
Ashbrook
,
A.
,
1999
, “
Object Reconstruction by Incorporating Geometric Constraints in Reverse Engineering
,”
Comp.-Aided Des.
,
31
, No.
6
, pp.
363
399
.
8.
Thompson
,
W. B.
,
Owen
,
J. C.
,
de St. Germain
,
J.
,
Stark
,
S. R.
, and
Henderson
,
T. C.
,
1999
, “
Feature-Based Reverse Engineering of Mechanical Parts
,”
IEEE Trans. Rob. Autom.
,
15
, No.
1
, pp.
57
66
.
9.
Mills, B. I., Langbein, F. C., Marshall, A. D., and Martin, R. R., 2001, “Approximate Symmetry Detection for Reverse Engineering,” Proceedings, 6th ACM Symp. Solid Modelling and Applications, Anderson, D. C., and Lee, K., eds., ACM Press, New York, NY, pp. 241–248.
10.
Hartigan, J. A., 1975, “Clustering Algorithms,” John Wiley & Sons, New York, NY.
11.
Eppstein, D., 1998, “Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs,” Proceedings, 9th ACM-SIAM Symp. Discrete Algorithms, pp. 619–628.
12.
Ferguson, H. R. P., and Bailey, D. H., 1991, “A Polynomial Time, Numerically Stable Integer Relation Algorithm,” NASA Technical Report, RNR–91–032.
13.
Bailey, D. H., and Plouffe, S., 1997, “Recognizing Numerical Constants,” Proceedings, Organic Mathematics Workshop, Canadian Mathematical Society, 20, pp. 73–88.
14.
Khinchin, A. Y., 1997, “Continued Fractions,” Dover Publications.
15.
Bjo¨rk, Å., 1996, “Numerical Methods for Least Squares Problems,” SIAM, Philadelphia, PA.
16.
National Design Repository, Drexel University, <uri: http://edge.mcs.drexel.edu/repository/>.
You do not currently have access to this content.