Variational quadratic shape functions for polygons and polyhedra
نویسندگان
چکیده
Solving partial differential equations (PDEs) on geometric domains is an important component of computer graphics, geometry processing, and many other fields. Typically, the given discrete mesh representation should not be altered for simulation purposes. Hence, accurately solving PDEs general meshes a central goal has been considered various operators over last years. While it known that using higher-order basis functions simplicial can substantially improve accuracy convergence, extending these benefits to surface or volume tessellations in efficient fashion remains open problem. Our work proposes variationally optimized piecewise quadratic shape polygons polyhedra, which generalize P 2 elements, exactly reproduce them simplices, inherit their beneficial numerical properties. To mitigate associated cost increased computation time, particularly volumetric meshes, we introduce custom two-level multigrid solver significantly improves computational performance.
منابع مشابه
Quadratic maximum-entropy serendipity shape functions for arbitrary planar polygons
In this paper, we present the development of quadratic serendipity shape functions on planar convex and nonconvex polygons. Drawing on the work of Bompadre et al. [1] and Hormann and Sukumar [2], we adopt a relative entropy measure for signed (positive or negative) shape functions, with nodal prior weight functions that have the appropriate zero-set on the boundary of the polygon. We maximize t...
متن کاملAngle counts for isothetic polygons and polyhedra
In the case of isothetic simple polyhedra there are only six different types of 3D angles. This article states and proofs a formula about counts of these angles. This complements formulas in combinatorial topology such as Euler's polyhedron formula, or the previously known formula on angle counts for isothetic polygons. The latter formula and the shown equality for angle counts of isothetic sim...
متن کاملComputing nice sweeps for polyhedra and polygons
The plane sweep technique is one of the best known paradigms for the design of geometric algorithms [2]. Here an imaginary line sweeps over the plane while computing the property of interest at the moment the sweep line passes the required information needed to compute that property. There are also three-dimensional problems that are solved by space sweep, where a plane sweeps the space. This p...
متن کاملApproximation by Polygons and Polyhedra
In order to investigate as to what order of magnitude a plane (or a skew) curve can be approximated by w-sided polygons, we have to start from a definition of the deviation. One of the usual definitions is as follows: the deviation ij(H, K) of two curves H and K is the smallest number rj for which H is contained in the neighbourhood of K with radius v\ and conversely K is contained in the neigh...
متن کاملInterpolants within Convex Polygons: Wachspress’ Shape Functions
During the 1970s, Wachspress developed shape functions for convex n-gons as polynomials of n!2 degree divided by the one of n!3. Originated from projective geometry these interpolants are linear on the sides and can exactly reproduce arbitrary linear fields. Here an alternative derivation is presented. The wide availability of computer algebra programs makes these high accuracy elements accessi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2022
ISSN: ['0730-0301', '1557-7368']
DOI: https://doi.org/10.1145/3528223.3530137