Mesh generation/refinement using fractal concepts and iterated function systems
- 30 January 1992
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 33 (2) , 287-305
- https://doi.org/10.1002/nme.1620330205
Abstract
A novel method of mesh generation is proposed which is based on the use of fractal concepts to derive contractive, affine transformations. The transformations are constructed in such a manner that the attractors of the resulting maps are a union of the points, lines and surfaces in the domain. In particular, the mesh nodes may be generated recursively as a sequence of points which are obtained by applying the transformations to a coarse background mesh constructed from the given boundary data. A Delaunay triangulation or similar edge connection approach can then be performed on the resulting set of nodes in order to generate the mesh. Local refinement of an existing mesh can also be performed using the procedure. The method is easily extended to three dimensions, in which case the Delaunay triangulation is replaced by an analogous 3‐D tesselation.Keywords
This publication has 9 references indexed in Scilit:
- An unstructured-mesh Euler method for multielement airfoil geometriesPublished by American Institute of Aeronautics and Astronautics (AIAA) ,1990
- A combined octree/delaunay method for fully automatic 3‐D mesh generationInternational Journal for Numerical Methods in Engineering, 1990
- Selective refinement/derefinement algorithms for sequences of nested triangulationsInternational Journal for Numerical Methods in Engineering, 1989
- Three-Dimensional Triangulations from Local TransformationsSIAM Journal on Scientific and Statistical Computing, 1989
- Fractal functions and interpolationConstructive Approximation, 1986
- Construction of fractal objects with iterated function systemsACM SIGGRAPH Computer Graphics, 1985
- Iterated function systems and the global construction of fractalsProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the PlaneACM Transactions on Mathematical Software, 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984