Pages that link to "Item:Q5891266"
From MaRDI portal
The following pages link to Computing cartograms with optimal complexity (Q5891266):
Displaying 25 items.
- Area-universal drawings of biconnected outerplane graphs (Q344510) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- Constrained floorplans in 2D and 3D (Q896113) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps (Q1681355) (← links)
- Table cartogram (Q1699289) (← links)
- On the area-universality of triangulations (Q1725766) (← links)
- A theory of L-shaped floor-plans (Q2110365) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- On orthogonally convex drawings of plane graphs (Q2360858) (← links)
- Rectilinear Duals Using Monotone Staircase Polygons (Q2942384) (← links)
- Complexity Measures for Mosaic Drawings (Q2980906) (← links)
- Drawing Planar Graphs with Prescribed Face Areas (Q3181055) (← links)
- A New Approach for Contact Graph Representations and Its Applications (Q3449814) (← links)
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY (Q5076161) (← links)
- Homothetic triangle representations of planar graphs (Q5240366) (← links)
- (Q5457097) (← links)
- On Area-Universal Quadrangulations (Q5856667) (← links)
- Proportional Contact Representations of Planar Graphs (Q5895512) (← links)
- (Q6150926) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
- A graph theoretic approach for generating \(T\)-shaped floor plans (Q6590090) (← links)
- Construction of floorplans for plane graphs over polygonal boundaries (Q6646742) (← links)
