Deformable curve and surface finite-elements for free-form shape design
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
On Characterizations of P- and P0-Properties in Nonsmooth Functions
Mathematics of Operations Research
Generating strictly non-self-overlapping structured quadrilateral grids
Computer-Aided Design
Volumetric parameterization and trivariate B-spline fitting using harmonic functions
Computer Aided Geometric Design
Swept Volume Parameterization for Isogeometric Analysis
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Applied Numerical Mathematics - Applied scientific computing: Recent approaches to grid generation, approximation and numerical modelling
Reconstruction of convergent G1 smooth B-spline surfaces
Computer Aided Geometric Design
Approximate swept volumes of NURBS surfaces or solids
Computer Aided Geometric Design
Block aggregation of stress constraints in topology optimization of structures
Advances in Engineering Software
Converting an unstructured quadrilateral/hexahedral mesh to a rational T-spline
Computational Mechanics
| Hi-index | 0.00 |
In this paper, we present an approach that automatically constructs a trivariate tensor-product B-spline solid via a gradient-based optimization approach. Given six boundary B-spline surfaces for a solid, this approach finds the internal control points so that the resulting trivariate B-spline solid is valid in the sense the minimal Jacobian of the solid is positive. It further minimizes a volumetric functional to improve resulting parametrization quality. For a trivariate B-spline solid even with moderate shape complexity, direct optimization of the Jacobian of the B-spline solid is computationally prohibitive since it would involve thousands of design variables and hundreds of thousands of constraints. We developed several techniques to address this challenge. First, we develop initialization methods that can rapidly generate initial parametrization that are valid or near-valid. We then use a divide-and-conquer approach to partition the large optimization problem into a set of separable sub-problems. For each sub-problem, we group the B-spline coefficients of the Jacobian determinant into different blocks and make one constraint for each block of coefficients. This is achieved by taking an aggregate function, the Kreisselmeier-Steinhauser function value of the elements in each block. With block aggregation, it reduces the dimension of the problem dramatically. In order to further reduce the computing time at each iteration, a hierarchical optimization approach is used where the input boundary surfaces are coarsened to difference levels. We optimize the distribution of internal control points for the coarse representation first, then use the result as initial parametrization for optimization at the next level. The resulting parametrization can then be further optimized to improve the mesh quality. Optimized trivariate parametrization from various boundary surfaces and the corresponding parametrization metric are given to illustrate the effectiveness of the approach.