Titlebook: Mathematical Methods for Curves and Surfaces; 9th International Co Michael Floater,Tom Lyche,Larry L. Schumaker Conference proceedings 2017

predict

Reparameterization and Adaptive Quadrature for the Isogeometric Discontinuous Galerkin Method,rms. We will use reparameterizations to perform this task. Secondly, suitable techniques for numerical integration are needed to evaluate the quantities that occur in the discretization with the required level of accuracy. We explore two possible approaches, which are based on subdivision and adaptive refinement, respectively.

載貨清單

反抗者

雪白

Adaptivity with B-spline Elements,in the basis. This completely avoids the linear dependence problem, and can also give slightly more focussed adaptivity, adding extra freedom only, and exactly, where it is needed, thus reducing the solution times.

是剝皮

乞丐

Order-Randomized Laplacian Mesh Smoothing,raph dependent and, generally, does not converge on bipartite graphs, the asynchronous converges with high probability on all graphs. The differences in the properties of these three approaches are illustrated with examples including both regular grids and irregular meshes.

木訥

大溝

allergen

Simplicial Complex Entropy,wing that it can be computed efficiently. Several examples over complices consisting of hundreds of simplices show that the proposed entropy function can be used in the analysis of large sequences of simplicial complices that often appear in computational topology applications.

deficiency

Partially Nested Hierarchical Refinement of Bivariate Tensor-Product Splines with Highest Order Smong the underlying grid. We identify assumptions that allow to define a hierarchical spline basis, to establish a truncation mechanism, and to derive a completeness result. Finally, we present an application to surface approximation that demonstrates the potential of the proposed generalization.