Related papers: Visibility-Monotonic Polygon Deflation
Many problems in Discrete and Computational Geometry deal with simple polygons or polygonal regions. Many algorithms and data-structures perform considerably faster, if the underlying polygonal region has low local complexity. One obstacle…
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.
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…
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…
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…
Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the…
The combinatorial mutation of polygons, which transforms a given lattice polygon into another one, is an important operation to understand mirror partners for two-dimensional Fano manifolds, and the mutation-equivalent polygons give…
For given finite system of convex polygons in the plane which have no transversal, find such homothety transformations of polygons (having fixed centres inside given polygons) with minimal similarity ratio c>1 that the transformed system…
The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…
It is shown, that extended particle-like objects should infinitely long collapse into some discontinuous configurations of the same topology, but vanishing mass. Analytic results concerning the general properties and asymptotic rates of…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
A bi-Hamiltonian structure is a pair of Poisson structures $\mathcal P$, $\mathcal Q$ which are compatible, meaning that any linear combination $\alpha \mathcal P + \beta \mathcal Q$ is again a Poisson structure. A bi-Hamiltonian structure…
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…
The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…
Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…
In order to meet the requirements of practical applications, a model of deforming manifold in the embedded space is proposed. The deforming vector and deforming field are presented to precisely describe the deforming process, which have…
We consider the problem of distortion minimal morphing of $n$-dimensional compact connected oriented smooth manifolds without boundary embedded in $\R^{n+1}$. Distortion involves bending and stretching. In this paper, minimal distortion…
We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$…
The geometrical description of deformation quantization based on quantum duality principle makes it possible to introduce deformed Lie-Poisson structure. It serves as a natural analogue of classical Lie bialgebra for the case when the…