Add to ORKGIn this note we describe some recent algorithms for the computation of rectangular and rectilinear cartograms
Abstract A rectangular cartogram is a type of map where every region is a rectangle. The size of the...
Abstract. In a rectilinear dual of a planar graph vertices are represented by simple rectilinear pol...
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangl...
In this note we describe some recent algorithms for the computation of rectangular and rectilinear c...
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangl...
AbstractA rectangular cartogram is a type of map where every region is a rectangle. The size of the ...
In [26], the first two authors of this paper presented the first algorithms to construct rectangular...
Abstract A rectangular cartogram is a type of map where every region is a rectangle. The size of the...
Abstract. In a rectilinear dual of a planar graph vertices are represented by simple rectilinear pol...
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangl...
In this note we describe some recent algorithms for the computation of rectangular and rectilinear c...
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangl...
AbstractA rectangular cartogram is a type of map where every region is a rectangle. The size of the ...
In [26], the first two authors of this paper presented the first algorithms to construct rectangular...
Abstract A rectangular cartogram is a type of map where every region is a rectangle. The size of the...
Abstract. In a rectilinear dual of a planar graph vertices are represented by simple rectilinear pol...
A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangl...