Tor Dokken

Tor Dokken, Vibeke Skytt, Oliver Barrowclough

Digital representations targeting design and simulation for Additive Manufacturing (AM) are addressed from the perspective of Computer Aided Geometric Design. We discuss the feasibility for multi-material AM for B-rep based CAD, STL, sculptured triangles as well as trimmed and block-structured trivariate locally refined spline representations. The trivariate spline representations support Isogeometric Analysis (IGA), and topology structures supporting these for CAD, IGA and AM are outlined. The ideas of (Truncated) Hierarchical B-splines, T-splines and LR B-splines are outlined and the approaches are compared. An example from the EC H2020 Factories of the Future Research and Innovation Actions CAxMan illustrates both trimmed and block-structured spline representations for IGA and AM.

Oliver J. D. Barrowclough, Tor Dokken

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating point implementation in computer aided geometric design (CAGD) systems. We unify the approaches under the names of commonly known polynomial basis functions, and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.

Vibeke Skytt, Quillon Harpham, Tor Dokken et al.

A set of bathymetry point clouds acquired by different measurement techniques at different times, having different accuracy and varying patterns of points, are approximated by an LR B-spline surface. The aim is to represent the sea bottom with good accuracy and at the same time reduce the data size considerably. In this process the point clouds must be cleaned by selecting the "best" points for surface generation. This cleaning process is called deconfliction, and we use a rough approximation of the combined point clouds as a reference surface to select a consistent set of points. The reference surface is updated with the selected points to create an accurate approximation. LR B-splines is the selected surface format due to its suitability for adaptive refinement and approximation, and its ability to represent local detail without a global increase in the data size of the surface

Francesco Patrizi, Tor Dokken

The focus on locally refined spline spaces has grown rapidly in recent years due to the need in Isogeoemtric analysis (IgA) of spline spaces with local adaptivity: a property not offered by the strict regular structure of tensor product B-spline spaces. However, this flexibility sometimes results in collections of B-splines spanning the space that are not linearly independent. In this paper we address the minimal number of B-splines that can form a linear dependence relation for Minimal Support B-splines (MS B-splines) and for Locally Refinable B-splines (LR B-splines) on LR-meshes. We show that the minimal number is six for MS B-splines, and eight for LR B-splines. The risk of linear dependency is consequently significantly higher for MS B-splines than for LR B-splines. Further results are established to help detecting collections of B-splines that are linearly independent.

Oliver J. D. Barrowclough, Tor Dokken

We discuss how Dokken's methods of approximate implicitization can be applied to triangular Bézier surfaces in both the original and weak forms. The matrices $\mathbf{D}$ and $\mathbf{M}$ that are fundamental to the respective forms of approximate implicitization are shown to be constructed essentially by repeated multiplication of polynomials and by matrix multiplication. A numerical approach to weak approximate implicitization is also considered and we show that symmetries within this algorithm can be exploited to reduce the computation time of $\mathbf{M}.$ Explicit examples are presented to compare the methods and to demonstrate properties of the approximations.