Piecewise-circular curves for geometric modeling

Modern solid modelers must be able to represent a wide class of objects, and must support Boolean operations on solids. These operations are very useful for defining solids, detecting interferences, and modeling fabrication processes. Computing the boundaries of solids defined through Boolean operations requires algorithms for surface/surface and curve/surface intersection. Many of the currently available modelers use closed-form parametric expressions for the curves of intersection of quadric surfaces, and compute intersections of these curves with other surfaces by finding the roots of low-degree polynomials. Because the curves that result from intersections involving tori or more complex surfaces generally cannot be expressed in closed form, modelers typically approximate these curves by cubic splines that interpolate points lying on the true intersections. Cubic splines exhibit second-degree continuity, but they are expensive to process in solid modeling computations. In this paper, we trade second-degree continuity for computational simplicity, and present a method for interpolating three-dimensional points and associated unit tangent vectors by smooth space curves composed of straight line segments and circular arcs. These curves are designated as PCCs (for piecewise-circular curves) and have continuous unit tangents. PCCs can be used in efficient algorithms for performing fundamental geometric computations, such as the evaluation of the minimal distance from a point to a curve or the intersection of a curve and a surface. Formulae and algorithms are presented for generating and processing PCCs in solid modelers. We also show that PCCs are useful for incorporating toroidal primitives, as well as sweeping, growing, shrinking, and blending operations in systems that model solids bounded by the natural quadric surfaces—planes, cylinders, cones, and spheres.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  M. Sabin The use of piecewise forms for the numerical representation of shape , 1976 .

[3]  A solution to the surface intersection problem. [Boolean functions in geometric modeling] , 1977 .

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

[5]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[6]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[7]  Hillyard The Build Group of Solid Modelers , 1982, IEEE Computer Graphics and Applications.

[8]  E. Nakamae,et al.  Application of the Bézier curve to data interpolation , 1982 .

[9]  Brown,et al.  PADL-2: A Technical Summary , 1982, IEEE Computer Graphics and Applications.

[10]  Wayne E. Carlson An algorithm and data structure for 3D object synthesis using surface patch intersections , 1982, SIGGRAPH.

[11]  Wayne Tiller,et al.  Rational B-Splines for Curve and Surface Representation , 1983, IEEE Computer Graphics and Applications.

[12]  A. Requicha,et al.  CONSTANT-RADIUS BLENDING IN SOLID MODELLING , 1984 .

[13]  Sudhir P. Mudur,et al.  Computational techniques for processing parametric surfaces , 1984, Comput. Vis. Graph. Image Process..

[14]  T. Varady,et al.  Synthesis of volume modelling and sculptured surfaces in BUILD , 1984 .

[15]  A.A.G. Requicha,et al.  Boolean operations in solid modeling: Boundary evaluation and merging algorithms , 1985, Proceedings of the IEEE.

[16]  Jaroslaw Roman Rossignac Blending and offsetting solid models (cad/cam, computational geometry, representations, curves, surfaces, approximation) , 1985 .

[17]  Aristides A. G. Requicha,et al.  Offsetting operations in solid modelling , 1986, Comput. Aided Geom. Des..

[18]  William Joseph Fitzgerald,et al.  Solid modeling for production design , 1987 .

[19]  Jarek Rossignac,et al.  Constraints in constructive solid geometry , 1987, I3D '86.