- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 958101, 21 pages
Simplicial Approach to Fractal Structures
Department of Mathematics, University of Salerno, Via Ponte don Melillo, 84084 Fisciano, Italy
Received 28 July 2011; Accepted 16 November 2011
Academic Editor: Cristian Toma
Copyright © 2012 Carlo Cattani et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A fractal lattice is defined by iterative maps on a simplex. In particular, Sierpinski gasket and von Koch flake are explicitly obtained by simplex transformations.
Simplicial calculus [1–3] has been since the beginning a suitable tool for investigating discrete models in many physical problems such as discrete models in space-time [4–9] complex networks [10–13], molecular crystals, aggregates and diamond lattices [14–17], computer graphics [18, 19], and more recently signal processing and computer vision, such as stereo matching and image segmentation [20, 21].
In some recent papers [22–25], fractals [26–29] generated by simplexes, also called fractal lattices, were proposed for the analysis of nonconventional materials as some kind of polymers [24, 25] or nanocomposites [22, 23, 30, 31] having extreme physical and chemical properties. Moreover, the analysis of complex traffic on networks [32, 33] and image analysis [20, 21] based on fractal geometry and simplicial lattices has focussed on the importance of these methods in handling modern challenging problems.
However, only a few attempts were made in order to define the fractal lattice (structure) by an iterated system of functions on simplexes [34, 35]. The main scheme for affine contraction has been given in , whereas some generation of fractals by simplicial maps can be found in .
In this paper, we define a method based on simple algorithms for the generation of fractal-like structures by continuously deforming a simplex. This algorithm is based on a well-defined analytical map, which can be used to finitely describe fractals. Instead of recursive law, or nested maps (see, e.g., [1, 2, 15]), we propose a method which can be more easily implemented.
In the following, we will study an -dimensional fractal structure defined by the transformation group of a simplicial complex. Starting from a simplex, it will define the group of transformation on it, so that the intrinsic (affine) metric remains scale invariant. The group of transformations (isometries and homotheties) will be characterized by matrices acting on the skeleton of the simplex. We will derive the basic properties of the fractal lattice and give a suitable definition of self-similarity on lattices. The concept of self-similarity is shown to be fulfilled by some classical transformation on simplices (homothety) and, simplicial based, fractals as the Sierpinski tessellations and the von Koch flake.
2. Euclidean Simplexes
In the ordinary Euclidean space , we assume that there exists a triangulation of , in the sense that there is at least a finite set of points geometrically independent (simplexes). A simplex will be considered both as a set of points and as the convex subspace of , defined by the geometrical support of the simplex. Union of -adjacent simplexes is an -polyhedron [4, 18, 19].
The euclidean -simplex , of independent vertices , is defined [1–3] as the subset of , Let us denote with the set of points which form the skeleton of , and let be the cardinality of the set of points. The -face of , with , is any simplex such that , and we write .
The number of -faces of is .
The -dimensional simplicial complex is defined as the finite set of simplexes () such that
(1) for all if , then ,
(2) for all , then either or with .
The set of points such that , , and is the geometric support of also called -polyhedron . The -skeleton of is . The boundary of is the complex such that each is face of only one -simplex of . A finite set of simplexes is also called lattice (or tessellation).
2.1. Barycentric Coordinates and Barycentric Bases
In each simplex, it is possible to define the barycentric basis as follows: given the -simplex with vertices , the barycentric basis is the set of vectors based on the barycenter
These vectors belong to the -dimensional vector space isomorphic to . Moreover, they are linearly dependent, since according to their definition, it is
Each point can be characterized by a set of barycentric coordinates such that and . Therefore, each point of can be formally expressed as a linear combination of the skeleton .
In addition, the metric tensor in is defined as  being .
2.2. Measures of the -Simplex
by using the ordinary wedge product of the vectors , we can define the -form ,
whose affine components are .
The euclidean measure of the -simplex (volume) is 
from where, it follows that being according to the even/odd permutation of the indices .
In particular, the volume of each -face (see also ) is where .
3. -Dimensional Homothety
Let be the subspace of to which belongs; it can be easily proved that  where the normal vector is defined as
The above definition of vector orthogonal to a -face allows us to characterize the -parallelism of simplexes as follows. Let be two simplexes in ; let be the th -faces of and , respectively, and let be their normal vectors, then we say that is -parallel to ( ) if and if only .
Let be a map such that
(1) is a bijective simplicial map on ,
(2) the -adjacent faces of correspond (under the map ) to -adjacent faces of ,
(3) and are -parallel.
We also assume that this transformation depends on the edge vectors and in particular on the edge lengths, so that any quantity, defined on the simplex, transforming under the action of , is a function of the edge lengths. Furthermore, we assume the following conditions:
(4) there exists a fixed point under the action of :
(5) each -face translates of an amount .
Let us choose as a fixed point one of the vertices, for example, . We define this bijective simplicial map applying any into () as in particular, this function acts on any vertex as so that we can easily prove that all the previous conditions are easily satisfied . According to the above equations, each edge transforms as where .
3.1. Variation Law of the -Faces of
The variation law of the edge lengths, resulting from (3.7), is given by the formula where is the length of the edge , and is the length of the edge .
According to (2.13), the volume is a homogeneous function of degree of the variable , so that its variation law is and for any -face, analogously, taking into account the definition (5.5)2, we have the transformation law of : There follows, for the fundamental vectors of , that
4. Self-Similar Structure
Let be the complete metric space with the standard Euclidean metric , and let be the set
The iterated function system (IFS)
is the finite set of contractions on the complete metric space , being the contraction defined as
with contraction coefficient.
For each , the (IFS) contracting mapping is
with contraction coefficient . Each function usually is linear, or more generally an affine transformation, but sometimes it can be nonlinear, including projective and Möbius transformations .
According to the Banach fixed-point theorem (see, e.g., ), every contraction mapping on a nonempty complete metric space has a unique fixed point, so that there exists a unique compact (i.e., closed and bounded) fixed set such that . The set is also known as the fixed set of the Hutchinson operator .
One way of constructing such fixed set is to start with an initial set and by iterating the actions of . Hence,
so that is a self-similar set, expressed as the finite union of its conformal copies, each one reduced by a factor .
The attractor of IFS is characterized by a similarity dimension as follows.
Definition 4.1. Given an IFS of contraction mappings with the same contraction coefficient , the similarity dimension is defined as
Sets having noninteger similarity dimensions are called fractal sets, or simply fractals. There follows that the iterated function systems are a method of constructing fractals; the resulting constructions are always self-similar such that . Hence, each map is also called a self-similar map .
5. Fractal Structures from Simplicial Maps
In this section, some examples of self-similar (scale invariant) structures obtained by IFS on simplexes are given in . In particular, the IFS will be defined by affine transformations, as conformal maps of the affine metrics.
In the following, we will introduce some self-similar maps defined both on 2-simplexes and 1-simplexes, so that, from (4.1),
In particular, let be the simplex , then it is
so that a map on could be the more general function defined on any face of .
Examples 5. If the skeleton of is the set of vertices with ,, and , the affine map is defined by the matrix and the constant vector The function maps a 2-simplex into a 2-simplex whereas, by a matrix product, the vector is mapped into the vector so that the skeleton of is given by the vector . For instance, a rotation with fixed point is given by the matrix with and the vector .
Some more special maps will be given in the following where, in particular, we consider, without restriction, some special maps on the 1-faces of such that In this case, the matrix , acting on , follows from the direct sum of lower-order matrices acting on simplexes, as follows:
(a) the first vertex remains fixed, and the map on is a consequence of the transformation of the simplex , that is, by defining it is
(b) the second vertex remains fixed, and the map on is a consequence of the transformation of the simplex , so that
(c) the third vertex remains fixed, and the map on is a consequence of the transformation of the simplex , that is, being
In the following, we will characterize the transformation on a 2-simplex as a result of iterative maps on its boundary 1-simplexes. These maps on 1-simplexes are defined by the matrices , applied to the vectors of coordinates of , , and , respectively.
Let us consider the 2-simplex and the map (Figure 1)
such that . This map, according to (5.9), is obtained as a combination of 3 maps acting on the faces of , since This map is a scale invariant, since there results , as well.
So that when , we have a contraction and a dilation when .
Moreover, according to (2.9), the metric of the transformed simplex is given by a conformal transformation .
5.2. Sierpinski Gasket
As a first example of fractal defined by IFS on simplexes, we will consider the Sierpinski gasket. To this end, let us introduce an orthogonal coordinate system in and three homothety maps , , and . Each is uniquely and completely determined once we know as it acts on the paired points , and , vertices of the 2-simplex .
In order to define the Sierpinski gasket by IFS of maps, we consider a sequence of maps that, at each step, shrink the area of by a factor 0.25 and move the edges by a suitable homothety (Figure 2). In particular, the 3 maps are explicitly defined as follows: where is the matrix
Once we get the vertices of , we can easily define the map for each point of the convex domain.
In fact, let , , and be the barycentric coordinates of a given point inside , as given by (2.1), then we can write the barycentric expansion of in terms of the coordinates of vertices as
Substituting into the above and rearranging, this linear transformation can be written as
where is the vector of barycentric coordinates, and is the matrix
Since is invertible, we can easily obtain the barycentric coordinates of :
According to (5.9) each map is a contraction (dilation) of the faces, such that the union gives rise to a 2-simplex (Figure 2). Any is mapped into as Moreover, each vertex in the can be expressed as in (3.6) so that
Reiterating this process for each remaining triangle, at the step , we will obtain the compact set given by triangles whose edges are contracted by . In other words,
Finally, we note that through the three simplicial maps in , provided with the natural metric , we are able to construct the IFS () that has the well-known Sierpinski gasket as fractal attractor. So, we have obtained the Sierpinski gasket, as the combination of homothety maps (Figure 2). The iterating function will generate the known fractal-shaped curve (Figure 3).
The Sierpinski gasket supplies one of the most simple cases of construction of fractals through simplicial maps. In fact, the fractal structure is obtained acting on the 2-simplex only with homothetic transformations. Sometimes a fractal object can be constructed not only acting on simplexes with one map, but considering the compositions of different suitable transformations. Hereafter, in order to obtain another fractal object, we will consider, in details, some more elementary maps: the translation and the rotation (which are special cases of the matrix ).
6. Von Koch Curve
Let the translation operator be defined as the operator
where is a given vector of , then the image of a simplex under the function is the translation of by so that any vertex is transformed into Since in a Euclidean space, any translation is an isometry, we have no variation of the edge lengths of .
being the zero matrix.
Rotation is characterized by having a fixed point, however, like the translation which is an isometry. This is like the previous maps on simplexes that can be defined by a suitable matrix (5.3). rotation is defined by (5.7), which however can be expressed by a single parameter (rotation angle). Hence, in two dimensions, a rotation with fixed point is the operator
where is the matrix so that (5.7), when applied to the simplex with one fixed vertex, becomes
With respect to an orthogonal coordinate system with origin , for any , we define the rotation as the bijective simplicial map which applies into , where ; in particular, the vertices are transformed into
6.3. Von Koch Snowflake
Let be an orthogonal coordinate system for , and let be a two simplex under the homothety map. According to (5.16), this map can be realized by a composition of maps on the 1-simplexes , , and . The coordinates of vertices are , , and , respectively. In the following we will give both the construction of the Koch curve as IFS on and the construction of the Koch snowflake as IFS on .
6.3.1. Von Koch Curve
Koch curve can be classically constructed by starting with a line segment, then recursively altering the shape as follows: divide the line segment into three segments of equal length; draw an equilateral triangle that has the middle segment from step 1 as its base and points outward; remove the line segment that is the base of the triangle from step 2 (see Figure 5).
Following the classical construction, we consider the following maps on 1-simplexes: where is the matrix Hence, is a factor of the homothety having as a fixed vertex, while leaves unchanged:
Moreover, each vertex in the , can be expressed as in(3.6)
Let us now consider the transformation, on two steps, which first rotates of an angle around the fixed point , and then it translates the rotated simplex by a vector .
So that we obtain where is the matrix
Finally, let us apply the transformation which first rotates of an angle around the fixed point , and then it translates the rotated simplex by the vector . Accordingly, it is where is the matrix
Since, as previously shown, rotation and translation are isometries, for each , we obtain
In order to visualize the von Koch pattern, let us consider the 1-simplex ; since the point has been chosen as the origin of the reference system, and and are obtained as rotation leaving fixed the origin, the transformed instances can be easily computed so that, at the first step, the IFS maps on 1-simplexes can be drawn (Figure 4).
Reiterating this process for each remaining segment, at the step we will obtain the compact set made of segments whose sides are contracted by a factor . The IFS map () gives us the Koch curve with similarity dimension equal to
6.3.2. Koch Flake
According to (5.16) and to the examples previously given, Koch flake (snowflake) can be constructed in a non-classical approach as IFS of maps on a 2-simplex. Koch snowflake can be seen as the image of a suitable system of iterated homotheties acting on a 2-simplex, given by suitable translations of the boundary 1-simplexes.
In this process, the total length of each side of a triangle increases by one-third, and thus, the total length at the th step will be of the original triangle perimeter.
In this paper, a nonclassical approach to fractal generation based on IFS of maps on simplexes has been given. Some of the most popular fractals, as the Sierpinski gasket and the von Koch flake, were obtained by iterative maps on simplexes. All maps were also intrinsically defined by using the affine (barycentric) coordinates and some basic measures on simplexes. The method proposed in this paper could be used to generate some new classes of fractals in any dimension, by simply defining suitable IFS on simplexes, thus opening new perspectives in fractal lattice geometry.
- A. T. Fomenko, Differential Geometry and Topology, Contemporary Soviet Mathematics, Consultants Bureau, New York, NY, USA, 1987.
- G. L. Naber, Topological Methods in Euclidean Spaces, Cambridge University Press, Cambridge, UK, 1980.
- I. M. Singer and J. A. Thorpe, Lecture notes on elementary topology and geometry, Scott, Foresman and Co., Glenview, Ill, USA, 1967.
- C. Cattani, “Variational method and Regge equations,” in Proceedings of the 8th Marcel Grossmann Meeting, Gerusalem, Palestine, June 1997.
- C. Cattani and E. Laserra, “Discrete electromagnetic action on a gravitational simplicial net,” Journal of Interdisciplinary Mathematics, vol. 3, no. 2-3, pp. 123–132, 2000.
- I. T. Drummond, “Regge-Palatini calculus,” Nuclear Physics. B, vol. 273, no. 1, pp. 125–136, 1986.
- C. W. Misner, K. S. Thorne, and J. A. Wheeler, “Regge Calculus,” in Gravitation, p. ii+xxvi+1279+iipp, W. H. Freeman and Co., San Francisco, Calif, USA, 1973.
- T. Regge, “General relativity without coordinates,” Il Nuovo Cimento Series 10, vol. 19, no. 3, pp. 558–571, 1961.
- R. Sorkin, “The electromagnetic field on a simplicial net,” Journal of Mathematical Physics, vol. 16, no. 12, pp. 2432–2440, 1975.
- A. L. Barabasi, Linked: How Everything is Connected to Everything Else and What It Means for Business, Science and Everyday Life, Plume Books, 2003.
- A. L. Barabási, E. Ravasz, and T. Vicsek, “Deterministic scale-free networks,” Physica A, vol. 299, no. 3-4, pp. 559–564, 2001.
- S. H. Strogatz, “Exploring complex networks,” Nature, vol. 410, no. 6825, pp. 268–276, 2001.
- D. J. Watts and S. H. Strogatz, “Collective dynamics of 'small-world9 networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
- C. Cattani and E. Laserra, “Simplicial geometry of crystals,” Journal of Interdisciplinary Mathematics, vol. 2, no. 2-3, pp. 143–151, 1999.
- N. Goldenfeld, Lectures on Phase Transitions and the Renormalization Group, Addison-Wesley, Reading, Mass, USA, 1992.
- V. M. Kenkre and P. Reineker, Exciton Dynamics in Molecular Crystals and Aggregates, Springer, Berlin, Germany, 1982.
- F. Vögtle, Ed., Dendrimers, Springer, Berlin, Germany, 1998.
- C. Cattani and A. Paoluzzi, “Boundary integration over linear polyhedra,” Computer-Aided Design, vol. 22, no. 2, pp. 130–135, 1990.
- C. Cattani and A. Paoluzzi, “Symbolic analysis of linear polyhedra,” Engineering with Computers, vol. 6, no. 1, pp. 17–29, 1990.
- S. Y. Chen, H. Tong, and C. Cattani, “Markov models for image labeling,” Mathematical Problems in Engineering, vol. 2012, Article ID 814356, 18 pages, 2012.
- S. Y. Chen, H. Tong, Z. Wang, S. Liu, M. Li, and B. Zhang, “Improved generalized belief propagation for vision processing,” Mathematical Problems in Engineering, vol. 2011, Article ID 416963, 12 pages, 2011.
- J. P. Blondeau, C. Orieux, and L. Allam, “Morphological and fractal studies of silicon nanoaggregates structures prepared by thermal activated reaction,” Materials Science and Engineering B, vol. 122, no. 1, pp. 41–48, 2005.
- C. C. Doumanidis, “Nanomanufacturing of random branching material architectures,” Microelectronic Engineering, vol. 86, no. 4-6, pp. 467–478, 2009.
- D. Lekić and S. Elezovic-Hadizic, “Semi-flexible compact polymers on fractal lattices,” Physica A, vol. 390, no. 11, pp. 1941–1952, 2011.
- R. Lua, A. L. Borovinskiy, and A. Y. Grosberg, “Fractal and statistical properties of large compact polymers: a computational study,” Polymer, vol. 45, no. 2, pp. 717–731, 2004.
- M. F. Barnsley, Fractal Everywhere, Academic Press, 1988.
- K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, John Wiley & Sons, Chichester, UK, 1990.
- J. E. Hutchinson, “Fractals and self-similarity,” Indiana University Mathematics Journal, vol. 30, no. 5, pp. 713–747, 1981.
- B. B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman and Co., San Francisco, Calif, USA, 1982.
- C. Cattani and J. Rushchitsky, Wavelet and Wave Analysis as Applied to Materials with Micro or Nanostructure, vol. 74 of Series on Advances in Mathematics for Applied Sciences, World Scientific, Hackensack, NJ, USA, 2007.
- E. V. Pashkova, E. D. Solovyova, I. E. Kotenko, T. V. Kolodiazhnyi, and A. G. Belous, “Effect of preparation conditions on fractal structure and phase transformations in the synthesis of nanoscale M-type barium hexaferrite,” Journal of Magnetism and Magnetic Materials, vol. 323, no. 20, pp. 2497–2503, 2011.
- M. Li, “Fractal time series—a tutorial review,” Mathematical Problems in Engineering, vol. 2010, Article ID 157264, 26 pages, 2010.
- M. Li, S. C. Lim, and S. Chen, “Exact solution of impulse response to a class of fractional oscillators and its stability,” Mathematical Problems in Engineering, vol. 2011, Article ID 657839, 9 pages, 2011.
- C. Cattani and E. Laserra, “Self-similar hierarchical regular lattices,” in the International Conference on Computational Science and Its Applications (ICCSA '10), D. Taniar, et al., Ed., vol. 6017 of Lecture Notes in Computer Science, pp. 225–240, 2010.
- L. Kocić, S. Gegovska-Zajkova, and L. Stefanovska, “Affine invariant contractions of simplices,” Kragujevac Journal of Mathematics, vol. 30, pp. 171–179, 2007.
- M. A. Khamsi and W. A. Kirk, An Introduction to Metric Spaces and Fixed Point Theory, Pure and Applied Mathematics, Wiley-Interscience, New York, NY, USA, 2001.