Related papers: Dimension preserving set-valued approximation and …
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an…
A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…
Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…
This paper presents a novel set-based computing method, called interval superposition arithmetic, for enclosing the image set of multivariate factorable functions on a given domain. In order to construct such enclosures, the proposed…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
Under what circumstances does the ``closeness" of two functions imply the ``closeness" of their respective sublevel sets? In this paper, we answer this question by showing that if a sequence of functions converges strictly from above/below…
We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. Its efficiency stems in part from a property for Minkowski sums of polygons…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
We survey recent developments in fractal analysis of regular and slow-fast dynamical systems using Minkowski dimension. Our focus is on spiral trajectories near monodromic limit periodic sets in regular systems and entry-exit sequences in…
This article introduces the novel notion of dimension preserving approximation for continuous functions defined on $[0,1]$ and initiates the study of it. Restrictions and extensions of continuous functions in regards to fractal dimensions…
Let us define for a compact set $A \subset \mathbb{R}^n$ the sequence $$ A(k) = \left\{\frac{a_1+\cdots +a_k}{k}: a_1, \ldots, a_k\in A\right\}=\frac{1}{k}\Big(\underset{k\ {\rm times}}{\underbrace{A + \cdots + A}}\Big). $$ It was…
We determine the extent to which certain classes of fractionally `smooth' continuous mappings between metric spaces distort various dimensions, including the Hausdorff, upper Minkowski (box-counting), and upper intermediate dimensions. Our…
It is shown in the present article that the Minkowski function does not preserve the Hausdorff-Besicovitch dimension. Results of this article were presented by the author of this article on the Second Interuniversity Scientific Conference…
In this paper we propose an approach to approximate a truncated singular value decomposition of a large structured matrix. By first decomposing the matrix into a sum of Kronecker products, our approach can be used to approximate a large…
We discuss a method to estimate the measure of a compact set which is approximated using the Hausdorff distance by a sequence of compact sets. We do this by considering corresponding fattenings of the sequence of compact sets and showing…
Fractal geometry deals mainly with irregularity and captures the complexity of a structure or phenomenon. In this article, we focus on the approximation of set-valued functions using modern machinery on the subject of fractal geometry. We…
This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…