On intersecting IFS fractals with lines
From MaRDI portal
Abstract: 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 R^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.
Recommendations
Cites work
- An ergodic theorem for iterated maps
- Box and packing dimensions of projections and dimension profiles
- scientific article; zbMATH DE number 3964277 (Why is no real title available?)
- scientific article; zbMATH DE number 48028 (Why is no real title available?)
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- Iterated function systems and the global construction of fractals
- On Hausdorff dimension of projections
- On the fundamental geometrical properties of linearly measurable plane sets of points. III
- Packing dimensions of projections and dimension profiles
- Sets with Prescribed Projections and Nikodym Sets
- Some Fundamental Geometrical Properties of Plane Sets of Fractional Dimensions
Cited in
(2)
This page was built for publication: On intersecting IFS fractals with lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174424)