Related papers: Visibility-preserving convexifications using singl…
Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear…
We introduce two new moves on graphs of groups with cyclic edge groups that preserve the fundamental group. These moves allow us to address the isomorphism problem without the use of expansions, therefore keeping the number of vertices and…
Visibility plays an important role for decision making in cluttered, uncertain environments. This paper considers the problem of identifying optimal hiding spots for an agent against line-of-sight detection by an adversary whose location is…
A method is presented which allows the exact construction of conserved (i.e. divergence-free) current vectors from appropriate sets of multipole moments. Physically, such objects may be taken to represent the flux of particles or electric…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
We consider the motion of the interface separating two domains of the same fluid that moves with different velocity along the tangential direction of the interface. We assume that the fluids occupying the two domains are of constant…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
The purpose of this note is to present two elementary, but useful, facts concerning actions on uniformly convex spaces. We demonstrate how each of them can be used in an alternative proof of the triviality of the first $L_p$-cohomology of…
In this paper, we show that if we decompose a polygon into two smaller polygons, then by comparing the number of extremal vertices in the original polygon versus the sum of the two smaller polygons, we can gain at most two globally extremal…
An ant-like observer confined to a two-dimensional surface traversed by stripes would wonder whether this striped landscape could be devised in such a way as to appear to be the same wherever they go. Differently stated, this is the problem…
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge…
Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be…
In ["Illumination of convex bodies with many symmetries", Mathematika 63 (2017)], Tikhomirov verified the Hadwiger-Boltyanski Illumination Conjecture for the class of 1-symmetric convex bodies of sufficiently large dimension. We propose an…
There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…
A classical result in Differential Geometry states that the flows of two smooth vector fields commute if and only if their Lie Bracket vanishes. In this work, we extend this result to a more general setting where one of the vector fields is…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…