On Intersecting IFS Fractals with Lines

IFS fractals — the attractors of Iterated Function Systems — have motivated plenty of research to date, partly due to their simplicity and applicability in various fields, such as the modeling of plants in computer graphics, and the design of fractal antennas. The statement and resolution of the Fractal-Line Intersection Problem is imperative for a more efficient treatment of certain applications. This paper intends to take further steps towards this resolution, building on the literature. For the broad class of hyperdense fractals, a verifiable condition guaranteeing intersection with any line passing through the convex hull of a planar IFS fractal is shown, in general ℝd for hyperplanes. The condition also implies a constructive algorithm for finding the points of intersection. Under certain conditions, an infinite number of approximate intersections are guaranteed, if there is at least one. Quantification of the intersection is done via an explicit formula for the invariant measure of IFS.

[1]  Przemyslaw Prusinkiewicz,et al.  The Algorithmic Beauty of Plants , 1990, The Virtual Laboratory.

[2]  K. Falconer,et al.  Packing dimensions of projections and dimension profiles , 1997, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  M. Barnsley,et al.  Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[4]  John C. Hart,et al.  Efficient antialiased rendering of 3-D linear fractals , 1991, SIGGRAPH.

[5]  A. Besicovitch.  On the fundamental geometrical properties of linearly measurable plane sets of points (III) , 1939 .

[6]  J. Howroyd.  Box and packing dimensions of projections and dimension profiles , 2001, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  J. M. Marstrand.  Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions , 1954 .

[8]  H. Fédérer.  The (φ, k) Rectifiable Subsets of n Space , 1947 .

[9]  H. Fédérer.  The (,) rectifiable subsets of -space , 1947 .

[10]  Boris Zeide,et al.  Fractal analysis of foliage distribution in loblolly pine crowns , 1998 .

[11]  S. Krantz.  Fractal geometry , 1989 .

[12]  J. Elton.  An ergodic theorem for iterated maps , 1987, Ergodic Theory and Dynamical Systems.

[13]  Franklin Mendivil,et al.  Thin Sets with Fat Shadows: Projections of Cantor Sets , 2008, Am. Math. Mon..

[14]  Nathan Cohen,et al.  SELF-SIMILARITY AND THE GEOMETRIC REQUIREMENTS FOR FREQUENCY INDEPENDENCE IN ANTENNAE , 1999 .

[15]  R. Kaufman.  On Hausdorff dimension of projections , 1968 .

[16]  Reconstructing Geometric Objects from the Measures of Their Intersections with Test Sets , 2011, 1109.6169.

[17]  K. Falconer.  Sets with Prescribed Projections and Nikodym Sets , 1986 .

[18]  Pertti Mattila,et al.  Hausdorff dimension, orthogonal projections and intersections with planes , 1975 .

[19]  Roy Osborne. Davies,et al.  On accessibility of plane sets and differentiation of functions of two real variables , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[20]  C. Sparrow.  The Fractal Geometry of Nature , 1984 .

[21]  Pertti Mattila,et al.  Geometry of sets and measures in Euclidean spaces , 1995 .