Mesh generation/refinement using fractal concepts and iterated function systems

DOI10.1002/nme.1620330205zbMath0756.65132OpenAlexW2056715752MaRDI QIDQ4020671

Graham F. Carey, S. W. Bova

Publication date: 17 January 1993

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620330205

zbMATH Keywords

attractorsmesh generationDelaunay triangulationiterated function systemsfractalLocal refinement

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items

USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS ⋮ Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems ⋮ Mesh quality improvement and other properties in the four-triangles longest-edge partition ⋮ Adaptive techniques for unstructured nested meshes ⋮ 2D and 3D finite element meshing and remeshing ⋮ Geometrically based, automatic generator for irregular triangular networks ⋮ The fractal behaviour of triangular refined/derefined meshes

Cites Work

• Iterated function systems and the global construction of fractals