Related papers: Line-Constrained $k$-Semi-Obnoxious Facility Locat…
This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…
Unmovable nodal points (UNP) and lines (UNL) are band crossings which positions in the Brillouin zone are unaltered by symmetry preserving perturbations. Not only positions but also the band structure in the vicinity is determined by the…
A system of identical disks is confined to a narrow channel, closed off at one end by a stopper and at the other end by a piston. All surfaces are hard and frictionless. A uniform gravitational field is directed parallel to the plane of the…
We construct a sequence of embedded minimal disks in a ball where the curvatures blow up only at the center. The sequence converges to a limit which is not smooth and not proper.
Hard disks systems are often considered as prototypes for simple fluids. In a statistical mechanics context, the hard disk configuration space is generally quotiented by the action of various symmetry groups. The changes in the topological…
In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. In…
We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…
The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
We investigate a real-life air cargo loading problem which is a variant of the three-dimensional Variable Size Bin Packing Problem with special bin forms of cuboid and non-cuboid unit load devices (ULDs). Packing is constrained by…
Clumsy packing is considered an inefficient packing, meaning we find the minimum number of objects we can pack into a space so that we can not pack any more object. Thus we are effectively spacing out the objects as far apart as possible so…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
In this work, we introduce the geometric concept of one-sided weakly porous sets in the real line and show that a set $E\subset\mathbb{R}$ satisfies $d(\cdot,E)^{-\alpha}\in A_1^+(\mathbb{R})\cap L^1_\textrm{loc}(\mathbb{R})$ for some…
We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…
In the online non-metric variant of the facility location problem, there is a given graph consisting of a set $F$ of facilities (each with a certain opening cost), a set $C$ of potential clients, and weighted connections between them. The…
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists no path between any pair of these points that is not…