Generalized nth-Order Perturbation Method Based on Loop Subdivision Surface Boundary Element Method for Three-Dimensional Broadband Structural Acoustic Uncertainty Analysis

In this paper,a generalized nth-order perturbation method based on the isogeometric boundary element method is proposed for the uncertainty analysis of broadband structural acoustic scattering problems.The Burton-Miller method is employed to solve the problem of non-unique solutions that may be encountered in the external acoustic field,and the nth-order discretization formulation of the boundary integral equation is derived.In addition,the computation of loop subdivision surfaces and the subdivision rules are introduced.In order to confirm the effectiveness of the algorithm,the computed results are contrasted and analyzed with the results under Monte Carlo simulations(MCs)through several numerical examples.

Subdivision Surface-Based Isogeometric Boundary Element Method for Steady Heat Conduction Problems with Variable Coefficient

The present work couples isogeometric analysis(IGA)and boundary element methods(BEM)for three dimensional steady heat conduction problems with variable coefficients.The Computer-Aided Design(CAD)geometries are built by subdivision surfaces,and meantime the basis functions of subdivision surfaces are employed to discretize the boundary integral equations for heat conduction analysis.Moreover,the radial integration method is adopted to transform the additional domain integrals caused by variable coefficients to the boundary integrals.Several numerical examples are provided to demonstrate the correctness and advantages of the proposed algorithm in the integration of CAD and numerical analysis.

A Blend of Subdivision Surfaces and NURBS

In present paper, the contour deletion method is developed both to blend surfaces and to fill N-sided holes, which is used for subdividing the NURBS surface. First, according to the non-uniform Catmull-Clark subdivision principle, surfaces are blended. The non-uniform Catmull-Clark subdivision method is constructed, which build the surface through interpolating comer vertices and boundary curves. Then the contour deletion method is adapted to remove the controlling mesh boundary contour in the process of segmentation iteration. Last, N sided-hole is filled to generate a integral smooth continuous surface. This method not only guarantee that the blending surface and base surface patches have C2 continuity at the boundary, but also greatly improve the smoothness of the N-side hole filling surface. The results show that, this method simplifies the specific computer-implemented process, broads the scope of application of subdivision surfaces, and solves the incompatible problem between the subdivision surface and classical spline. The resulting surface has both advantages of the subdivision surface and classical spline, and also has better filling effect.

A Subdivision-Based Combined Shape and Topology Optimization in Acoustics

We propose a combined shape and topology optimization approach in this research for 3D acoustics by using the isogeometric boundary element method with subdivision surfaces.The existing structural optimization methods mainly contain shape and topology schemes,with the former changing the surface geometric profile of the structure and the latter changing thematerial distribution topology or hole topology of the structure.In the present acoustic performance optimization,the coordinates of the control points in the subdivision surfaces fine mesh are selected as the shape design parameters of the structure,the artificial density of the sound absorbing material covered on the structure surface is set as the topology design parameter,and the combined topology and shape optimization approach is established through the sound field analysis of the subdivision surfaces boundary element method as a bridge.The topology and shape sensitivities of the approach are calculated using the adjoint variable method,which ensures the efficiency of the optimization.The geometric jaggedness and material distribution discontinuities that appear in the optimization process are overcome to a certain degree by the multiresolution method and solid isotropic material with penalization.Numerical examples are given to validate the effectiveness of the presented optimization approach.

Loop Subdivision Surface Based Progressive Interpolation

A new method for constructing interpolating Loop subdivision surfaces is presented. The new method is an extension of the progressive interpolation technique for B-splines. Given a triangular mesh M, the idea is to iteratively upgrade the vertices of M to generate a new control mesh M such that limit surface of M would interpolate M. It can be shown that the iterative process is convergent for Loop subdivision surfaces. Hence, the method is well-defined. The new method has the advantages of both a local method and a global method, i.e., it can handle meshes of any size and any topology while generating smooth interpolating subdivision surfaces that faithfully resemble the shape of the given meshes. The meshes considered here can be open or closed.

Variational reconstruction using subdivision surfaces with continuous sharpness control

We present a variational method for subdivision surface reconstruction from a noisy dense mesh. A new set of subdivision rules with continuous sharpness control is introduced into Loop subdivision for better modeling subdivision surface features such as semi-sharp creases, creases, and corners. The key idea is to assign a sharpness value to each edge of the control mesh to continuously control the surface features.Based on the new subdivision rules, a variational model with L_1 norm is formulated to find the control mesh and the corresponding sharpness values of the subdivision surface that best fits the input mesh. An iterative solver based on the augmented Lagrangian method and particle swarm optimization is used to solve the resulting non-linear, non-differentiable optimization problem. Our experimental results show that our method can handle meshes well with sharp/semi-sharp features and noise.

CORNER-CUTTING SUBDIVISION SURFACES OF GENERAL DEGREES WITH PARAMETERS

As a corner-cutting subdivision scheme,Lane-Riesefeld algorithm possesses the concise and unified form for generating uniform B-spline curves:vertex splitting plus repeated midpoint averaging.In this paper,we modify the second midpoint averaging step of the Lane-Riesefeld algorithm by introducing a parameter which controls the size of corner cutting,and generalize the strategy to arbitrary topological surfaces of general degree.By adjusting the free parameter,the proposed method can generate subdivision surfaces with flexible shapes.Experimental results demonstrate that our algorithm can produce subdivision surfaces with comparable or even better quality than the other state-of-the-art approaches by carefully choosing the free parameters.

Feature-Adaptive Rendering of Loop Subdivision Surfaces on Modern GPUs

We present a novel approach for real-time rendering Loop subdivision surfaces on modern graphics hardware. Our algorithm evaluates both positions and normals accurately, thus providing the true Loop subdivision surface. The core idea is to recursively refine irregular patches using a GPU compute kernel. All generated regular patches are then directly evaluated and rendered using tile hardware tessellation unit. Our approach handles triangular control meshes of arbitrary topologies and incorporates common subdivision surface features such as semi-sharp creases and hierarchical edits. While surface rendering is accurate up to machine precision, we also enforce a consistent bitwise evaluation of positions and normals at patch boundaries. This is particularly useful in the context of displacement mapping which strictly requires inatching surface normals. Furthermore, we incorporate efficient level-of-detail rendering where subdivision depth and tessellation density can be adjusted on-the-fly. Overall, our algorithm provides high-quality results at real-time frame rates, thus being ideally suited to interactive rendering applications such as video games or authoring tools.

Accurate Evaluation of Free-form Surface Profile Error Based on Quasi Particle Swarm Optimization Algorithm and Surface Subdivision

Although significant progress has been made in precision machining of free-form surfaces recently, inspection of such surfaces remains a difficult problem. In order to solve the problem that no specific standards for the verification of free-form surface profile are available, the profile parameters of free-form surface are proposed by referring to ISO standards regarding form tolerances and considering its complexity and non-rotational symmetry. Non-uniform rational basis spline（NURBS） for describing free-form surface is formulated. Crucial issues in surface inspection and profile error verification are localization between the design coordinate system（DCS） and measurement coordinate system（MCS） for searching the closest points on the design model corresponding to measured points. A quasi particle swarm optimization（QPSO） is proposed to search the transformation parameters to implement localization between DCS and MCS. Surface subdivide method which does the searching in a recursively reduced range of the parameters u and v of the NURBS design model is developed to find the closest points. In order to verify the effectiveness of the proposed methods, the design model is generated by NURBS and the measurement data of simulation example are generated by transforming the design model to arbitrary position and orientation, and the parts are machined based on the design model and are measured on CMM. The profile errors of simulation example and actual parts are calculated by the proposed method. The results verify that the evaluation precision of freeform surface profile error by the proposed method is higher 10%-22% than that by CMM software. The proposed method deals with the hard problem that it has a lower precision in profile error evaluation of free-form surface.

A novel method for sculptured surface subdivision

In this work, a novel method for sculptured surface subdivision to improve the machinery＇s ability and efficiency in 5-axis CNC machining complex surface is introduced. The method subdivides automatically a monolithic convex or concave or simultaneously complex sculptured surface into a number of surface patches and achieves the goal of similar normal directions and small difference between the curvatures in every patch by using weight fuzzy cluster algorithm which takes the curvatures and normal vectors of the sculptured surface into account simultaneously. The inclination angle variation between every two Cutter Contact Points （CC Points） is decreased in every patch to avoid large-angle rotation of tool to save machining time when a flat-end mill is used. This work contributes to automating 5-axis CNC tool path generation for sculptured part machining and forming a foundation for further research.

GPU-based composite subdivision

This paper proposes a novel strategy based on fragment meshes of Shiue et al. for GPU rendering of compos- ite subdivision surfaces. Two enumeration systems are established to label the primitives of each fragment mesh. A sector-layer-index enumeration system is responsible for retrieving proximities for subdivision masks while a sec- tor-index enumeration system designates a 2D texture buffer in GPU. Recurring to the free conversion between them, our approach may get rid of lookup tables that are designed to record subdivision masks. In addition, relatively small composite subdivision masks make it easy to develop automatically retrieving techniques. Finally, as center vertices are often irregular, their computation is related to an average with alterable number of items. Considering that variable loop is not efficient in GPU, we evaluate the center vertex of each fragment mesh using the linear combination of its level 0, level 1 and limit positions instead of averaging schemes. Experiments demonstrate that our approach generally outper- forms that of Shiue et al. in FPS by a long way.

Improved non-uniform subdivision scheme with modified Eigen-polyhedron

In this study,a systematic refinement method was developed for non-uniform Catmull-Clark subdivision surfaces to improve the quality of the surface at extraordinary points(EPs).The developed method modifies the eigenpolyhedron by designing the angles between two adjacent edges that contain an EP.Refinement rules are then formulated with the help of the modified eigenpolyhedron.Numerical experiments show that the method significantly improves the performance of the subdivision surface for non-uniform parameterization.

Noise Pollution Reduction through a Novel Optimization Procedure in Passive Control Methods

This paper proposes a novel optimization framework in passive control techniques to reduce noise pollution.The geometries of the structures are represented by Catmull-Clark subdivision surfaces,which are able to build gap-free Computer-Aided Design models and meanwhile tackle the extraordinary points that are commonly encountered in geometricmodelling.The acoustic fields are simulated using the isogeometric boundary elementmethod,and a density-based topology optimization is conducted to optimize distribution of sound-absorbing materials adhered to structural surfaces.The approach enables one to perform acoustic optimization from Computer-Aided Design models directly without needingmeshing and volume parameterization,thereby avoiding the geometric errors and time-consuming preprocessing steps in conventional simulation and optimization methods.The effectiveness of the present method is demonstrated by three dimensional numerical examples.

ESTIMATING ERROR BOUNDS FOR TERNARY SUBDIVISION CURVES/SURFACES

We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametrization therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and so on.

Hydrodynamic Interaction of Elastic Capsules in Bounded Shear Flow

This paper presents a modified Loop’s subdivision algorithm for studying the deformation of a single capsule,the hydrodynamic interaction between two capsules and the hydrodynamic diffusion of a suspension of capsules in bounded shear flow.A subdivision thin-shell model is employed to compute the forces generated on the surface of the elastic capsule during deformation.The capsule surface is approximated using the modified Loop’s subdivision scheme which guarantees bounded curvature and C1 continuity everywhere on the limit surface.The present numerical technique has been validated by studying the deformation of a spherical capsule in shear flow.Computations are also performed for a biconcave capsule over a wide range of shear rates and viscosity ratios to investigate its dynamics.In addition,the hydrodynamic interaction between two elastic capsules in bounded shear flow is studied.Depending on the wall separation distance,the trajectory-bifurcation points that separate reversing and crossing motions for both spherical and biconcave capsules can be found.Compared to the spherical capsules,the biconcave capsules exhibit additional types of interaction such as rotation and head-on collision.The head-on collision results in a large trajectory shift which contribute to the hydrodynamic diffusion of a suspension.A suspension of a large number of biconcave capsules in shear flow is also simulated to show the ability of the modified scheme in running a large-scale simulation over a long period of time.

Adaptive triangular mesh coarsening with centroidal Voronoi tessellations

We present a novel algorithm for adaptive triangular mesh coarsening. The algorithm has two stages. First, the input triangular mesh is refined by iteratively applying the adaptive subdivision operator that performs a so-called red-green split. Second, the refined mesh is simplified by a clustering algorithm based on centroidal Voronoi tessellations (CVTs). The accuracy and good quality of the output triangular mesh are achieved by combining adaptive subdivision and the CVTs technique. Test results showed the mesh coarsening scheme to be robust and effective. Examples are shown that validate the method.