Related papers: Area-universality in Outerplanar Graphs

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

This paper addresses the challenge of object-centric layout generation under spatial constraints, seen in multiple domains including floorplan design process. The design process typically involves specifying a set of spatial constraints…

We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal we…

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…

We survey algorithms and bounds for constructing planar drawings of graphs in small area.

We show that if there exists a topologically expansive homeomorphism on a uniform space, then the space is always a regular space. Through examples we show that in general composition of topologically expansive homeomorphisms need not be…

We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining…

A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…

We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is \emph{universal} for a class…

Various non-trivial spaces are becoming popular for embedding structured data such as graphs, texts, or images. Following spherical and hyperbolic spaces, more general product spaces have been proposed. However, searching for the best…

This work formalizes the differential topology of redundancy resolution for systems governed by signed-quadratic actuation maps. By analyzing the minimally redundant case, the global topology of the continuous fiber bundle defining the…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

We construct a moduli space for Riemann surfaces that is universal in the sense that it represents compact Riemann surfaces of any finite genus. This moduli space is stratifed according to genus, and it carries a metric and a measure that…

This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…

In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

We introduce a learning framework for automated floorplan generation which combines generative modeling using deep neural networks and user-in-the-loop designs to enable human users to provide sparse design constraints. Such constraints are…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

We consider the general setting for partial matching of two or multiple graphs, in the sense that not necessarily all the nodes in one graph can find their correspondences in another graph and vice versa. We take a universe matching…

A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…