A rectangular cartogram is a type of map where every region is a rectangle. The size of the
rectangles is chosen such that their areas represent a geographic variable (eg, population) …

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles.
These layouts are used as rectangular cartograms in cartography, as floorplans in building …

In a rectilinear dual of a planar graph vertices are represented by simple rectilinear
polygons, while edges are represented by side-contact between the corresponding …

Abstract In [26], the first two authors of this paper presented the first algorithms to construct
rectangular cartograms. The first step is to determine a representation of all regions by …

Let G=(V, E) be a plane triangulated graph where each vertex is assigned a positive weight.
A rectilinear dual of G is a partition of a rectangle into| V| simple rectilinear regions, one for …

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles.
They are used as rectangular cartograms in cartography, as floorplans in building …

In this paper, we address the problem of visualizing a frequency distribution and an
adjacency relation attached to a set of individuals. We represent this information using a …

Abstract Let \mathcalG=(V, E) be a plane triangulated graph where each vertex is assigned
a positive weight. A rectilinear dual of \mathcalG is a partition of a rectangle into| V| simple …

In 3D contact representations, the vertices of a graph are represented by 3D polyhedra and
the edges are realized by non-zero-area common boundaries between corresponding …

We study contact representations of edge-weighted planar graphs, where vertices are
rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent …