Related papers: Pinwheels and bypasses

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…

We construct bypass attachments in higher dimensional contact manifolds that, when attached to a neighborhood of a Weinstein hypersurface, yield a neighborhood of a new Weinstein hypersurface, obtained via local modifications to the…

A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.

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…

We give a necessary condition on a geodesic in a Riemannian manifold that can run in some convex hypersurface. As a corollary we obtain peculiar properties that hold true for every convex set in any generic Riemannian manifold (M,g). For…

A universal tiler is a convex polyhedron whose every cross-section tiles the plane. In this paper, we introduce a certain slight-rotating operation for cross-sections of pentahedra. Based on a selected initial cross-section and by applying…

We give a sufficient condition in order that $n$ closed connected subsets in the $n$-dimensional real projective space admit a common multitangent hyperplane.

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

We establish a general criterion for the existence of convex sets of fixed shape as, e.g., balls of a given radius, of maximal probability on Banach spaces. We also provide counterexamples showing that their existence my fail even in some…

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…

Let L be a link in the 3-sphere that is in thin position but not in bridge position and let P be a thin level sphere. We generalize a result of Wu by giving a bound on the number of disjoint irreducible compressing disks that P can have,…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

Under a mild technical assumption, we prove a necessary and sufficient condition for a totally real compacdt set in $\mathbb{C}^n$ to be rationally convex. This generalizes a classical result of Duval-Sibony

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

In this paper we give a necessary and sufficient condition for local controllability around closed orbits for general smooth control systems. We also prove that any such system on a compact manifold has a closed orbit.