Structured orthogonal near-boundary Voronoi mesh layers for planar domains
From MaRDI portal
Publication:5114886
Abstract: We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and Voronoi vertices are placed near summits of sharp boundary corners. We suggest self-organization meshing algorithm which covers the boundary of domain by a almost-structured band of non-simplicial Delaunay cells. This band consists of quadrangles on the smooth boundary segment and convex polygons around sharp corners. Dual Voronoi mesh is double layered orthogonal structure where central line of the layer approximates the boundary. Overall Voronoi mesh has a hybrid structure and consists of high quality convex polygons in the core of the domain and orthogonal layered structure near boundaries.
Recommendations
Cites work
Cited in
(7)- Boundary layer mesh generation on arbitrary geometries
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Hybrid Voronoi mesh generation: algorithms and unsolved problems
- A Laguerre Voronoi based scheme for meshing particle systems
- On the construction of the Voronoi mesh on a sphere
- Why do we need Voronoi cells and Delaunay meshes?
- Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method
This page was built for publication: Structured orthogonal near-boundary Voronoi mesh layers for planar domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114886)