Object Modeling with Guaranteed Fulfillment of Geometric Constraints

Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that all geometric constraints can be absolutely satisfied. To our knowledge it seems to be the first one with guaranteed constraint fulfillment. It is realized by integrating these constraints as hard conditions into the fitting process, in contrast to their use as soft optimization criteria in earlier work. We describe the principle behind our approach and give examples to show how it can be applied to practice. Experimental results will be reported on objects with numerous complex constraints. The technique proposed in this paper is expected to have a great impact in reverse engineering applications and manufactured object modeling where the majority of parts are designed with intended feature relationships.

[1]  Robert B. Fisher,et al.  Faithful Recovering of Quadric Surfaces from 3D Range Data by Global Fitting , 2000, Int. J. Shape Model..

[2]  L. E. Scales,et al.  Introduction to Non-Linear Optimization , 1985 .

[3]  Robert B. Fisher,et al.  Faithful recovering of quadric surfaces from 3D range data , 1999, Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062).

[4]  Gilles Trombettoni,et al.  Scene modeling based on constraint system decomposition techniques , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[5]  Ralph R. Martin,et al.  Robust Segmentation of Primitives from Range Data in the Presence of Geometric Degeneracy , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Anil K. Jain,et al.  Surface classification: hypothesis testing and parameter estimation , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  Yiu-Tong Chan,et al.  A simple approach for the estimation of circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[8]  John Porrill,et al.  Optimal Combination and Constraints for Geometrical Sensor Data , 1988, Int. J. Robotics Res..

[9]  Xiaoyi Jiang A Decomposition Approach to Geometric Fitting , 2000, MVA.

[10]  Hendrik Van Brussel,et al.  A Smoothly Constrained Kalman Filter , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Vaughan R. Pratt,et al.  Direct least-squares fitting of algebraic surfaces , 1987, SIGGRAPH.

[12]  Xiaoyi Jiang,et al.  A Novel Parameter Decomposition Approach to Faithful Fitting of Quadric Surfaces , 2005, DAGM-Symposium.

[13]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Andrew W. Fitzgibbon,et al.  Direct Least Square Fitting of Ellipses , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Robert B. Fisher,et al.  Modelling Objects having Quadric Surfaces Incorporating Geometric cCnstraints , 1998, ECCV.

[16]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.