Geometric constraint solver using multivariate rational spline functions

We present a new approach to building a solver for a set of geometric constraints represented by multivariate rational functions. The constraints are formulated using inequalities as well as equalities. When the solution set has dimension larger than zero, we approximate it by fitting a hypersurface to discrete solution points. We also consider a variety of constraint solving problems common in geometric modeling. These include computing ray-traps, bisectors, sweep envelopes, and regions accessible during 5-axis machining.

[1]  Thomas W. Sederberg,et al.  Loop detection in surface patch intersections , 1988, Comput. Aided Geom. Des..

[2]  Kenneth I. Joy,et al.  Boundary determination for trivariate solids , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[3]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[4]  Tomoyuki Nishita,et al.  Ray tracing trimmed rational surface patches , 1990, SIGGRAPH.

[5]  Gershon Elber,et al.  The bisector surface of rational space curves , 1998, TOGS.

[6]  Myung Soo Kim.  Gershon Elber , 2000 .

[7]  I. Faux,et al.  Computational Geometry for Design and Manufacture , 1979 .

[8]  David Wells,et al.  The Penguin Dictionary of Curious and Interesting Geometry , 1992 .

[9]  Gershon Elber,et al.  A unified approach to verification in 5-axis freeform milling environments , 1999, Comput. Aided Des..

[10]  Rida T. Farouki,et al.  On the numerical condition of polynomials in Bernstein form , 1987, Comput. Aided Geom. Des..

[11]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[12]  Gershon Elber,et al.  Problem Reduction to Parameter Space , 2000, IMA Conference on the Mathematics of Surfaces.

[13]  R. Riesenfeld,et al.  Bounds on a polynomial , 1981 .

[14]  Gershon Elber,et al.  A computational model for nonrational bisector surfaces: curve-surface and surface-surface bisectors , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[15]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[16]  Ralph R. Martin,et al.  Sweeping of three-dimensional objects , 1990, Comput. Aided Des..

[17]  Thomas W. Sederberg,et al.  Pyramids That Bound Surface Patches , 1996, CVGIP Graph. Model. Image Process..

[18]  Gershon Elber,et al.  Computing Rational Bisectors , 1999, IEEE Computer Graphics and Applications.

[19]  Gershon Elber,et al.  The bisector surface of freeform rational space curves , 1997, SCG '97.

[20]  Gene H. Golub,et al.  Matrix computations , 1983 .

[21]  Gershon Elber,et al.  The intersection of two ruled surfaces , 1999, Comput. Aided Des..

[22]  M. Artin,et al.  Société Mathématique de France , 1994 .

[23]  Karim Abdel-Malek,et al.  Geometric representation of the swept volume using Jacobian rank-deficiency conditions , 1997, Comput. Aided Des..

[24]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[25]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .