相关论文: Hedgehog Reconstruction of Polygons: Non-Central S…

Tomography is the area of reconstructing objects from projections. Here we wish to reconstruct a set of cells in a two dimensional grid, given the number of cells in every row and column. The set is required to be an hv-convex polyomino,…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

In this work, we reconsider the study of 2D materials involving double lattice structures associated with periodic polygons. In tessellated periodic representation, it appears two periodic polygons of $k$ sides of unequal side lengths at…

We investigate a special kind of contraction of symmetric spaces (respectively, of Lie triple systems), called homotopy. In this first part of a series of two papers we construct such contractions for classical symmetric spaces in an…

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…

We propose a reconstruction of general bulk surfaces in any dimension in terms of the differential entropy in the boundary field theory. In particular, we extend the proof of Headrick et al. to calculate the area of a general class of…

The Heesch problem 'grades' polygons that fail to tile the plane in terms of the number of layers (or corollas) of copies of it that can be formed around a central unit. We study the different topology of ' walls', which we define to be…

Given a lattice polygon $P$ with $g$ interior lattice points, we associate to it the moduli space of tropical curves of genus $g$ with Newton polygon $P$. We completely classify the possible dimensions such a moduli space can have. For…

Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…

We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…

Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle…

Poisson Surface Reconstruction is a widely-used algorithm for reconstructing a surface from an oriented point cloud. To facilitate applications where only partial surface information is available, or scanning is performed sequentially, a…

We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…

Numerical homogenization, i.e. the finite-dimensional approximation of solution spaces of PDEs with arbitrary rough coefficients, requires the identification of accurate basis elements. These basis elements are oftentimes found after a…

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$,…

We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…

The period is a classical complex analytic invariant for a compact Riemann surface defined by integration of differential 1-forms. It has a strong relationship with the complex structure of the surface. In this chapter, we review another…

An almost forgotten gem of Gauss tells us how to compute the area of a pentagon by just going around it and measuring areas of each vertex triangles (i.e. triangles whose vertices are three consecutive vertices of the pentagon). We give…

Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…