Related papers: Random covering by rectangles on self-similar carp…
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…
This paper develops an efficient numerical method for the inverse scattering problem of a time-harmonic plane wave incident on a perfectly reflecting random periodic structure. The method is based on a novel combination of the Monte Carlo…
We generalize the recent study of random space-filling bearings to a more realistic situation, where the spacing offset varies randomly during the space-filling procedure, and show that it reproduces well the size-distributions observed in…
We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision with a set of bounded (rectilinear) faces. We are interested…
We propose the {\alpha}-suboptimal covering number to characterize multi-task control problems where the set of dynamical systems and/or cost functions is infinite, analogous to the cardinality of finite task sets. This notion may help…
Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…
Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set $A \subset [0, 1]^n$. Specifically, they gave a randomized algorithm such that if $A$'s surface area is less than $S$ then the algorithm will…
We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We…
The kernel trick concept, formulated as an inner product in a feature space, facilitates powerful extensions to many well-known algorithms. While the kernel matrix involves inner products in the feature space, the sample covariance matrix…
We consider the problem of clustering a sample of probability distributions from a random distribution on $\mathbb R^p$. Our proposed partitioning method makes use of a symmetric, positive-definite kernel $k$ and its associated reproducing…
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every…
We study a shrinking target problem on square-tiled surfaces. We show that the action of a subgroup of the Veech group of a regular square-tiled surface exhibits Diophantine properties. This generalizes the work of Finkelshtein, who studied…
We study the $k$-Submodular Cover ($kSC$) problem, a natural generalization of the classical Submodular Cover problem that arises in artificial intelligence and combinatorial optimization tasks such as influence maximization, resource…
The diffraction spectrum of coherent waves scattered from fractal supports is calculated exactly. The fractals considered are of the class generated iteratively by successive dilations and translations, and include generalizations of the…
In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
Optical metasurfaces (subwavelength-patterned surfaces typically described by variable effective surface impedances) are typically modeled by an approximation akin to ray optics: the reflection or transmission of an incident wave at each…
For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…
We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a given set of $n$ planar points, a rectangle with minimum area that encloses at least $(n-t)$ points. The uncovered points are regarded as outliers.…
We provide an explicit geometric algorithm involving only ruler and compass constructions in order to specify the specular reflection point on the surface of a reflecting sphere of radius $r$ given two focal points $A$ and $B$ lying outside…