Related papers: On the Exact Convex Hull of IFS Fractals
We survey old and new conjectures and results on various types of spherical maximal functions, emphasizing problems with a fractal dilation set.
This work introduces a novel tool for interactive, real-time transformations of two dimensional IFS fractals. We assign barycentric coordinates (relative to an arbitrary affine basis of $\mathbb{R}^2$) to the points that constitute the…
The area of fractional calculus (FC) has been fast developing and is presently being applied in all scientific fields. Therefore, it is of key relevance to assess the present state of development and to foresee, if possible, the future…
We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…
The present work investigates the segmentation of textures by formulating it as a strongly convex optimization problem, aiming to favor piecewise constancy of fractal features (local variance and local regularity) widely used to model…
We describe the fractal solid by a special continuous medium model. We propose to describe the fractal solid by a fractional continuous model, where all characteristics and fields are defined everywhere in the volume but they follow some…
In our previous work, On the localization of Hutchinson-Barnsley fractals, Chaos Solitons Fractals, 173 (2023), 113-674, we presented a method for finding a finite family of closed balls whose union contains the attractor of a given…
Fractal structure of the six-vertex model is introduced with the use of the IFS (Iterated Function Systems). The fractal dimension satisfies an equation written by the free energy of the six-vertex model. It is pointed out that the transfer…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.
We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…
In this manuscript, fractal and fuzzy calculus are summarized. Fuzzy calculus in terms of fractal limit, continuity, its derivative, and integral are formulated. The fractal fuzzy calculus is a new framework that includes fractal fuzzy…
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
This article is concerned with the problem of placing seven or eight points on the unit sphere $\mathbb{S}^2$ in $\mathbb{R}^3$ so that the surface area of the convex hull of the points is maximized. In each case, the solution is given for…
We introduce and characterize extremal 2-cuts for good fractal necklaces. Using the characterization and the related topological properties of extremal 2-cuts, we prove that every good necklace has a unique necklace IFS in a certain sense.…
In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a…
This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…