A matrix-based approach to properness and inversion problems for rational surfaces

We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.Comment: 12 pages, latex, revised version accepted for publication in the Journal AAEC

Mini-Workshop: Surface Modeling and Syzygies

The problem of determining the implicit equation of the image of a rational map φ : P2 99K P3 is of theoretical interest in algebraic geometry, and of practical importance in geometric modeling. There are essentially three methods which can be applied to the problem: Gröbner bases, resultants, and syzygies. Elimination via Gröbner basis methods tends to be computationally intensive and, being a general tool, is not adapted to the geometry of specific problems. Thus, it is primarily the latter two techniques which are used in practice. This is an extremely active area of research where many different perspectives come into play. The mini-workshop brought together a diverse group of researchers with different areas of expertise

A survey of the representations of rational ruled surfaces

The rational ruled surface is a typical modeling surface in computer aided geometric design. A rational ruled surface may have different representations with respective advantages and disadvantages. In this paper, the authors revisit the representations of ruled surfaces including the parametric form, algebraic form, homogenous form and Pl¨ucker form. Moreover, the transformations between these representations are proposed such as parametrization for an algebraic form, implicitization for a parametric form, proper reparametrization of an improper one and standardized reparametrization for a general parametrization. Based on these transformation algorithms, one can give a complete interchange graph for the different representations of a rational ruled surface. For rational surfaces given in algebraic form or parametric form not in the standard form of ruled surfaces, the characterization methods are recalled to identify the ruled surfaces from them.Agencia Estatal de Investigació

Algebraic level sets for CAD/CAE integration and moving boundary problems

Boundary representation (B-rep) of CAD models obtained from solid modeling kernels are commonly used in design, and analysis applications outside the CAD systems. Boolean operations between interacting B-rep CAD models as well as analysis of such multi-body systems are fundamental operations on B-rep geometries in CAD/CAE applications. However, the boundary representation of B-rep solids is, in general, not a suitable representation for analysis operations which lead to CAD/CAE integration challenges due to the need for conversion from B-rep to volumetric approximations. The major challenges include intermediate mesh generation step, capturing CAD features and associated behavior exactly and recurring point containment queries for point classification as inside/outside the solid. Thus, an ideal analysis technique for CAD/CAE integration that can enable direct analysis operations on B-rep CAD models while overcoming the associated challenges is desirable. ^ Further, numerical surface intersection operations are typically necessary for boolean operations on B-rep geometries during the CAD and CAE phases. However, for non-linear geometries, surface intersection operations are non-trivial and face the challenge of simultaneously satisfying the three goals of accuracy, efficiency and robustness. In the class of problems involving multi-body interactions, often an implicit knowledge of the boolean operation is sufficient and explicit intersection computation may not be needed. Such implicit boolean operations can be performed by point containment queries on B-rep CAD models. However, for complex non-linear B-rep geometries, the point containment queries may involve numerical iterative point projection operations which are expensive. Thus, there is a need for inexpensive, non-iterative techniques to enable such implicit boolean operations on B-rep geometries. ^ Moreover, in analysis problems with evolving boundaries (ormoving boundary problems), interfaces or cracks, blending functions are used to enrich the underlying domain with the known behavior on the enriching entity. The blending functions are typically dependent on the distance from the evolving boundaries. For boundaries defined by free form curves or surfaces, the distance fields have to be constructed numerically. This may require either a polytope approximation to the boundary and/or an iterative solution to determine the exact distance to the boundary. ^ In this work a purely algebraic, and computationally efficient technique is described for constructing signed distance measures from Non-Uniform Rational B-Splines (NURBS) boundaries that retain the geometric exactness of the boundaries while eliminating the need for iterative and non-robust distance calculation. The proposed technique exploits the NURBS geometry and algebraic tools of implicitization. Such a signed distance measure, also referred to as the Algebraic Level Sets, gives a volumetric representation of the B-rep geometry constructed by purely non-iterative algebraic operations on the geometry. This in turn enables both the implicit boolean operations and analysis operations on B-rep geometries in CAD/CAE applications. Algebraic level sets ensure exactness of geometry while eliminating iterative numerical computations. Further, a geometry-based analysis technique that relies on hierarchical partition of unity field compositions (HPFC) theory and its extension to enriched field modeling is presented. The proposed technique enables direct analysis of complex physical problems without meshing, thus, integrating CAD and CAE. The developed techniques are demonstrated by constructing algebraic level sets for complex geometries, geometry-based analysis of B-rep CAD models and a variety of fracture examples culminating in the analysis of steady state heat conduction in a solid with arbitrary shaped three-dimensional cracks. ^ The proposed techniques are lastly applied to investigate the risk of fracture in the ultra low-k (ULK) dies due to copper (Cu) wirebonding process. Maximum damage induced in the interlayer dielectric (ILD) stack during the process steps is proposed as an indicator of the reliability risk. Numerical techniques based on enriched isogeometric approximations are adopted to model damage in the ULK stacks using a cohesive damage description. A damage analysis procedure is proposed to conduct damage accumulation studies during Cu wirebonding process. Analysis is carried out to identify weak interfaces and potential sites for crack nucleation as well as damage nucleation patterns. Further, the critical process condition is identified by analyzing the damage induced during the impact and ultrasonic excitation stages. Also, representative ILD stack designs with varying Cu percentage are compared for risk of fracture

Interpolation of syzygies for implicit matrix representations

We examine matrix representations of curves and surfaces based on syzygies and constructed by interpolation through points. They are implicit representations of objects given as point clouds. The corresponding theory, including moving lines, curves and surfaces, has been developed for parametric models. Our contribution is to show how to compute the required syzygies by interpolation, when the geometric object is given by a point cloud whose sampling satisfies mild assumptions. We focus on planar and space curves, where the theory of syzygies allows us to design an exact algorithm yielding the optimal implicit expression. The method extends readily to surfaces without base points defined over triangular patches. Our Maple implementation has served to produce the examples in this paper and is available upon demand by the authors

The intersection problems of parametric curve and surfaces by means of matrix based implicit representations

In this paper, we introduce and study a new implicit representation of parametric curves and parametric surfaces . We show how these representations which we will call the matrix implied, establish a bridge between geometry and linear algebra, thus opening the possibility of a more robust digital processing. The contribution of this approach is discussed and illustrated on important issues of geometric modeling and Computer Aided Geometric Design (CAGD) : The curve/curve, urve/surface and surface/surface intersection problems, the point-on-curve and inversion problems, the computation of singularities points

A sharp interface isogeometric strategy for moving boundary problems

The proposed methodology is first utilized to model stationary and propagating cracks. The crack face is enriched with the Heaviside function which captures the displacement discontinuity. Meanwhile, the crack tips are enriched with asymptotic displacement functions to reproduce the tip singularity. The enriching degrees of freedom associated with the crack tips are chosen as stress intensity factors (SIFs) such that these quantities can be directly extracted from the solution without a-posteriori integral calculation. As a second application, the Stefan problem is modeled with a hybrid function/derivative enriched interface. Since the interface geometry is explicitly defined, normals and curvatures can be analytically obtained at any point on the interface, allowing for complex boundary conditions dependent on curvature or normal to be naturally imposed. Thus, the enriched approximation naturally captures the interfacial discontinuity in temperature gradient and enables the imposition of Gibbs-Thomson condition during solidification simulation. The shape optimization through configuration of finite-sized heterogeneities is lastly studied. The optimization relies on the recently derived configurational derivative that describes the sensitivity of an arbitrary objective with respect to arbitrary design modifications of a heterogeneity inserted into a domain. The THB-splines, which serve as the underlying approximation, produce sufficiently smooth solution near the boundaries of the heterogeneity for accurate calculation of the configurational derivatives. (Abstract shortened by ProQuest.

Using μ-bases to reduce the degree in the computation of projective equivalences between rational curves in n-space

We study how projective equivalences between rational curves in Rn are transferred to the elements of smallest degree of the μ-bases of the curves. We show how to compute these elements of smallest degree without computing the whole μ-basis, and prove some results on the degrees of μ-bases of curves in Rn. As a result, we provide a way to reduce the cost of computing the projective equivalences between rational curves in Rn by replacing the given curves for the curves represented by the elements of smallest degree of the μ-bases of the curves, which have a much smaller degree compared to the original degree of the curves.Agencia Estatal de Investigació