Related papers: Area-universality in Outerplanar Graphs

Maps --- specifically floor plans --- are useful for a variety of tasks from arranging furniture to designating conceptual or functional spaces (e.g., kitchen, walkway). We present a simple algorithm for quickly laying a floor plan (or…

Let $m, n > 1$ be two integers, and $\mathbb{Z}_n$ be a $\mathbb{Z}_m$-module. Let $I(\mathbb{Z}_m)^*$ be the set of all non- zero proper ideals of $\mathbb{Z}_m$. The $\mathbb{Z}_n$-intersection graph of $\mathbb{Z}_m$, denoted by…

We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We…

In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…

In this paper we show that a nonlocal minimal surface which is a graph outside a cylinder is in fact a graph in the whole of the space. As a consequence, in dimension~$3$, we show that the graph is smooth. The proofs rely on convolution…

Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…

We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…

We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the…

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

The limit of energies of a sequence of harmonic maps as their annular domains approach the boundary of moduli space depends upon the boundary point approached. The infinite energy case is associated with limits of images containing ruled…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

We prove that every set $\mathcal S$ of $\Delta$ slopes containing the horizontal slope is universal for $1$-bend upward planar drawings of bitonic $st$-graphs with maximum vertex degree $\Delta$, i.e., every such digraph admits a $1$-bend…

A "floorplan" is a rectangle subdivided into smaller rectangular sections by horizontal and vertical line segments. Each section in the floorplan is called a "block". Two floorplans are considered equivalent if and only if there is a…

A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…

In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…

In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…

We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect…

In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…

This paper presents a unified view of manifolds and fiber bundles, which, while superficially different, have strong parallels. It introduces the notions of an m-atlas and of a local coordinate space, and shows that special cases are…

We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…