English
Related papers

Related papers: Area-Universal Rectangular Layouts

200 papers

A rectangular dual of a plane graph $G$ is a contact representations of $G$ by interior-disjoint axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the union of all rectangles is a rectangle. A rectangular dual…

Computational Geometry · Computer Science 2022-09-02 Steven Chaplick , Philipp Kindermann , Jonathan Klawitter , Ignaz Rutter , Alexander Wolff

We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…

Numerical Analysis · Mathematics 2025-10-20 Douglas N. Arnold , Daniele Boffi , Richard S. Falk

In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…

Functional Analysis · Mathematics 2019-12-13 Anil Kumar Karn , Amit kumar

Existing graph theoretic approaches are mainly restricted to floor-plans with rectangular boundary. In this paper, we introduce floor-plans with $L$-shaped boundary (boundary with only one concave corner). To ensure the L-shaped boundary,…

Discrete Mathematics · Computer Science 2022-05-31 Raveena , Krishnendra Shekhawat

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…

Human-Computer Interaction · Computer Science 2016-06-16 Leo Bowen-Biggs , Suzanne Dazo , Yili Zhang , Alex Hubers , Matthew Rueben , Ross Sowell , William D. Smart , Cindy Grimm

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

Cartograms combine statistical and geographical information in thematic maps, where areas of geographical regions (e.g., countries, states) are scaled in proportion to some statistic (e.g., population, income). Cartograms make it possible…

Human-Computer Interaction · Computer Science 2016-09-16 Sabrina Nusrat , Stephen Kobourov

We construct, for every \(0<k<1\), a bounded globally univalent harmonic mapping \[ f=h+\overline g \colon \D\to\C \] such that \[ |g'(z)|\le k|h'(z)|,\qquad z\in\D, \] while the analytic part \(h\) is unbounded. The construction is based…

Complex Variables · Mathematics 2026-05-05 David Kalaj

We investigate the problem of assembling general shapes and patterns in a model in which particles move based on uniform external forces until they encounter an obstacle. While previous work within this model of assembly has focused on…

A plane graph is said to be a rectangular graph if each of its edges can be oriented horizontal or vertical, its internal regions are four-sided and it has a rectangular enclosure. If dual of a planar graph is a rectangular graph, then the…

Combinatorics · Mathematics 2021-01-12 Vinod Kumar , Krishnendra Shekhawat

Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…

Computational Geometry · Computer Science 2021-11-15 Michael G. Dobbins , Linda Kleist , Tillmann Miltzow , Paweł Rzążewski

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computational Geometry · Computer Science 2020-10-09 Stanislaw Ambroszkiewicz

The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…

Artificial Intelligence · Computer Science 2015-03-13 Sanjiang Li

Given a point set $S=\{s_1,\ldots , s_n\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set…

Computational Geometry · Computer Science 2018-06-26 Hugo A. Akitaya , Matthew D. Jones , David Stalfa , Csaba D. Tóth

Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…

Functional Analysis · Mathematics 2019-04-03 Eirik Berge , Franz Luef

The space-like hypersurface of the Universe at the present cosmological time is a three-dimensional manifold. A non-trivial global topology of this space-like hypersurface would imply that the apparently observable universe (the sphere of…

Astrophysics · Physics 2011-04-15 Boudewijn F. Roukema , Vincent Blanloeil

The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…

Metric Geometry · Mathematics 2026-04-02 Aahana Aggarwal , Subhojoy Gupta , Ajay K. Nair

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…

Combinatorics · Mathematics 2007-05-23 J. Richard Lundgren , Simone Severini , Dustin J. Stewart

Given a bipartite graph that has a perfect matching, a prefect proportional allocation is an assignment of positive weights to the nodes of the right partition so that every left node is fractionally assigned to its neighbors in proportion…

Data Structures and Algorithms · Computer Science 2026-05-01 Daniel Hathcock , R. Ravi