On recursive refinement of convex polygons

DOI10.1016/j.cagd.2016.04.002zbMath1418.65024OpenAlexW2336341992MaRDI QIDQ1632483

George Slavov, Ming-Jun Lai

Publication date: 14 December 2018

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2016.04.002

zbMATH Keywords

Euler's characteristicspolygonal refinementpolygonal splines

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Multidimensional problems (41A63) Spline approximation (41A15) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (7)

Discontinuous Galerkin solutions for elliptic problems on polygonal grids using arbitrary-order Bernstein-Bézier functions ⋮ Refinement of polygonal grids using convolutional neural networks with applications to polygonal discontinuous Galerkin and virtual element methods ⋮ Functional data approximation on bounded domains using polygonal finite elements ⋮ Machine learning based refinement strategies for polyhedral grids with applications to virtual element and polyhedral discontinuous Galerkin methods ⋮ Polygonal Spline Spaces and the Numerical Solution of the Poisson Equation ⋮ Weak Galerkin based a posteriori error estimates for second order elliptic interface problems on polygonal meshes ⋮ A priori and a posterior error estimate of new weak Galerkin finite element methods for second order elliptic interface problems on polygonal meshes

Uses Software

• PolyMesher

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \texttt{PolyMesher}: a general-purpose mesh generator for polygonal elements written in Matlab
• An efficient numerical scheme for the biharmonic equation by weak Galerkin finite element methods on polygonal or polyhedral meshes
• Polygonal Spline Spaces and the Numerical Solution of the Poisson Equation
• Box Spline Wavelet Frames for Image Edge Analysis
• Arbitrary-Order Nodal Mimetic Discretizations of Elliptic Problems on Polygonal Meshes
• Quadratic serendipity finite elements on polygons using generalized barycentric coordinates
• Spline Functions on Triangulations
• BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
• New perspectives on polygonal and polyhedral finite element methods
• Generalized barycentric coordinates and applications

This page was built for publication: On recursive refinement of convex polygons