English
Related papers

Related papers: Indecomposable coverings with homothetic polygons

200 papers

It is known that the space of convex polygons in the Euclidean plane with fixed normals, up to homotheties and translations, endowed with the area form, is isometric to a hyperbolic polyhedron. In this note we show a class of convex…

Differential Geometry · Mathematics 2013-04-05 François Fillastre

We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…

Combinatorics · Mathematics 2017-06-13 Eyal Ackerman , Balázs Keszegh , Máté Vizer

We explore the problem of $M$-guarding polygons with holes using $k$-visibility guards, where a set of guards is said to $M$-guard a polygon if every point in the polygon is visible to at least $M$ guards, with the constraint that there may…

Computational Geometry · Computer Science 2025-10-30 Yeganeh Bahoo , Ahmad Kamaludeen

We find conditions under which a non-orientable closed surface S embedded into an orientable closed 4-manifold X can be represented by a connected sum of an embedded closed surface in X and an unknotted projective plane in a 4-sphere. This…

Geometric Topology · Mathematics 2021-09-17 David Auckly , Rustam Sadykov

An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…

Computational Geometry · Computer Science 2018-02-07 Joseph O'Rourke

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

Algebraic Geometry · Mathematics 2024-10-16 Ivan Soprunov , Jenya Soprunova

A foliation $(M,\mathcal{F})$ is said to be $2$--calibrated if it admits a closed 2-form $\omega$ making each leaf symplectic. By using approximately holomorphic techniques, a sequence $W_k$ of $2$--calibrated submanifolds of…

Differential Geometry · Mathematics 2018-07-31 David Martínez Torres , Álvaro del Pino , Francisco Presas

Let M be a compact connected orientable 3-manifold, with non-empty boundary that contains no 2-spheres. We investigate the existence of two properly embedded disjoint surfaces S_1 and S_2 such that M - (S_1 \cup S_2) is connected. We show…

Geometric Topology · Mathematics 2012-09-17 Marc Lackenby

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

Metric Geometry · Mathematics 2009-08-05 Christian Huck

This paper shows that there are symplectic four-manifolds M with the following property: a single isotopy class of smooth embedded two-spheres in M contains infinitely many Lagrangian submanifolds, no two of which are isotopic as Lagrangian…

Differential Geometry · Mathematics 2016-09-07 Paul Seidel

For any irreducible representation of a surface group into $\mathrm{SL}_2(\mathbb{C})$, we show that there exists a pants decomposition where the restriction to any pair of pants is irreducible and where no curve of the decomposition is…

Geometric Topology · Mathematics 2022-10-19 Renaud Detcherry , Thomas Le Fils , Ramanujan Santharoubane

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Metric Geometry · Mathematics 2021-10-05 Sergii Myroshnychenko

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

Computational Geometry · Computer Science 2025-06-23 Guilherme D. da Fonseca

Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with…

Computational Geometry · Computer Science 2018-07-27 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

In this article we show that every closed oriented smooth 4-manifold can be decomposed into two codimension zero submanifolds (one with reversed orientation) so that both pieces are exact Kahler manifolds with strictly pseudoconvex…

Geometric Topology · Mathematics 2009-04-22 R Inanc Baykur

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.

Combinatorics · Mathematics 2020-03-03 Yaroslav Shitov

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.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

We prove that, for any two polyhedral manifolds $\mathcal P, \mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P, \mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Computational Geometry · Computer Science 2025-10-08 Lily Chung , Erik D. Demaine , Jenny Diomidova , Tonan Kamata , Jayson Lynch , Ryuhei Uehara , Hanyu Alice Zhang

Any two homologous surfaces of the same genus embedded in a smooth 4-manifold X with simply-connected complements are shown to be smoothly isotopic in the connected sum of X and the product of a 2-sphere with itself, if the surfaces are…

Geometric Topology · Mathematics 2017-08-11 Dave Auckly , Hee Jung Kim , Paul Melvin , Daniel Ruberman , Hannah Schwartz

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke
‹ Prev 1 4 5 6 7 8 10 Next ›