Related papers: Visibility-preserving convexifications using singl…
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…
We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…
We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction? We prove that for any dimension $d…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
It is shown that, under suitable conditions, involving in particular the existence of analytic constants of motion, the presence of Lie point symmetries can ensure the convergence of the transformation taking a vector field (or dynamical…
The purpose of this note is to give a simple proof for a necessary and sufficient condition for visibility paths in simple polygons. A visibility path is a curve such that every point inside a simple polygon is visible from at least one…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider…
It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…
In the present article we provide a sufficient condition for a closed set F in R^d to have the following property which we call c-removability: Whenever a function f:R^d->R is locally convex on the complement of F, it is convex on the whole…
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
We investigate the presence of vortices in generalized Maxwell-Higgs models with a hidden sector. The model engenders $U(1)\times U(1)$ symmetry, in a manner that the sectors are coupled via the visible magnetic permeability depending only…
We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…
We study the motion of surfaces in an intrinsic formulation in which the surface is described by its metric and curvature tensors. The evolution equations for the six quantities contained in these tensors are reduced in number in two cases:…
This work deals with planar dynamical systems with and without noise. In the first part, we seek to gain a refined understanding of such systems by studying their differential-geometric transformation properties under an arbitrary smooth…
If one is given a rigid triangle in the plane or space, we show that the only motion possible, where each vertex of the triangle moves along a straight line, is given by a hypocycloid line drawer in the plane, and a natural extension in…
For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G of P's vertices such that every point in P is seen by at least one point in G. This problem is NP-complete and APX-hard. The first approximation…
The theory of linear transports along paths in vector bundles, generalizing the parallel transports generated by linear connections, is developed. The normal frames for them are defined as ones in which their matrices are the identity…
We give a simplified account of the properties of the transfer matrix for a complex one-dimensional potential, paying special attention to the particular instance of unidirectional invisibility. In appropriate variables, invisible…