English
Related papers

Related papers: Hinged Kite Mirror Dissection

200 papers

A $3$-Prismatoid is the convex hull of two convex polygons $A$ and $B$ which lie in parallel planes $H_A, H_B\subset\mathbb{R}^3$. Let $A'$ be the orthogonal projection of $A$ onto $H_B$. A prismatoid is called nested if $A'$ is properly…

Metric Geometry · Mathematics 2023-12-25 Manuel Radons

We study reversible polymerization of rings. In this stochastic process, two monomers bond and as a consequence, two disjoint rings may merge into a compound ring, or, a single ring may split into two fragment rings. This…

Statistical Mechanics · Physics 2011-06-03 E. Ben-Naim , P. L. Krapivsky

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.

Metric Geometry · Mathematics 2022-02-04 Dirk Frettlöh , Christian Richter

Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

Computational Geometry · Computer Science 2021-09-03 Rain Jiang , Kai Jiang , Minghui Jiang

In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation and rotation). Four weeks later, Dudeney…

Computational Geometry · Computer Science 2025-08-04 Erik D. Demaine , Tonan Kamata , Ryuhei Uehara

Given a trapezoid dissected into triangles, the area of any triangle determined by either diagonal of the trapezoid is integral over the ring generated by the areas of the triangles in the dissection. Given a parallelogram dissected into…

Commutative Algebra · Mathematics 2024-09-18 Aaron Abrams , Jamie Pommersheim

Motivated by the problem of redistricting, we study area-preserving reconfigurations of connected subdivisions of a simple polygon. A connected subdivision of a polygon $\mathcal{R}$, called a district map, is a set of interior disjoint…

Computational Geometry · Computer Science 2023-07-04 Hugo A. Akitaya , Andrei Gonczi , Diane L. Souvaine , Csaba D. Tóth , Thomas Weighill

An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…

Metric Geometry · Mathematics 2022-05-05 Teruhisa Sugimoto

Following on Part I of this work series on local kirigami mechanics, we present a study of a discretely creased mechanism as a model to investigate the mechanics of the basic geometric building block of kirigami--the e-cone. We consider an…

Soft Condensed Matter · Physics 2022-03-14 Souhayl Sadik , Martin G. Walker , Marcelo A. Dias

Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic…

Computational Geometry · Computer Science 2017-06-29 Anna Lubiw , Debajyoti Mondal

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…

Metric Geometry · Mathematics 2015-02-16 R. Nandakumar

In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the…

Discrete Mathematics · Computer Science 2011-02-08 Ajit Arvind Diwan , Subir Kumar Ghosh , Partha Pratim Goswami , Andrzej Lingas

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

Computational Geometry · Computer Science 2025-07-15 Mirela Damian , Henk Meijer

In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore,…

Computational Geometry · Computer Science 2025-03-14 Bahram Sadeghi Bigham

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

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

Classical Analysis and ODEs · Mathematics 2011-10-07 Laura Poggiolini , Marco Spadini

The pentagram map has been studied in a series of papers by Schwartz and others. Schwartz showed that an axis-aligned polygon collapses to a point under a predictable number of iterations of the pentagram map. Glick gave a different proof…

Metric Geometry · Mathematics 2014-10-30 Zijian Yao

Suppose T is a Heegaard splitting surface for a compact orientable 3-manifold M, and S is a reducing sphere for M. In 1968 Haken showed that there is then also a reducing sphere S* for the Heegaard splitting. That is, S* is a reducing…

Geometric Topology · Mathematics 2024-04-24 Martin Scharlemann

Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if…

Geometric Topology · Mathematics 2009-07-06 David Cimasoni
‹ Prev 1 4 5 6 7 8 10 Next ›