Related papers: On the Exact Convex Hull of IFS Fractals
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
In many problems of classical analysis extremal configurations appear to exhibit complicated fractal structure. This makes it much harder to describe extremals and to attack such problems. Many of these problems are related to the…
This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…
Fractals are ubiquitous in nature, and since Mandelbrot's seminal insight into their structure, there has been growing interest in them. While the topological properties of the limit sets of IFSs have been studied -- notably in the…
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…
Fractal interpolation technique is an alternative to the classical interpolation methods especially when a chaotic signal is involved. The logic behind the formulation of an iterated function system for the construction of fractal…
Perfect fractals are mathematical objects that, because they are generated by recursive processes, have self-similarity and infinite complexity. In particular, they also have a fractional dimension. Although several proposals for the study…
In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new…
We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…
This study analyzes the problem of a constant height hydraulic fracture. It is assumed that the fracture is driven by Newtonian fluid, and the effects of fracture toughness and leak-off are included in the model as well. Analysis of the tip…
Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with…
Fractal percolation exhibits a dramatic topological phase transition, changing abruptly from a dust-like set to a system spanning cluster. The transition points are unknown and difficult to estimate. In many classical percolation models the…
We study the problem of estimating the convex hull of the image $f(X)\subset\mathbb{R}^n$ of a compact set $X\subset\mathbb{R}^m$ with smooth boundary through a smooth function $f:\mathbb{R}^m\to\mathbb{R}^n$. Assuming that $f$ is a…
This paper investigates the transformation of a convex hull, derived from a d-dimensional point cloud, into a concave surface. Our primary focus is on the development of a methodology that ensures all points in the point cloud are…
We present a numerical method for the solution of Newton's problem of least resistance in the class of convex functions using a convex hull approach. We observe that the numerically computed solutions possess some symmetry. Further, their…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…