The following pages link to A theory of rectangular dual graphs (Q923112):
Displaying 15 items.
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- On area-efficient drawings of rectangular duals for VLSI floor-plan (Q802889) (← links)
- Simple and efficient floor-planning (Q1007584) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Heuristic method to check the realisability of a graph into a rectangular plan (Q1575024) (← links)
- A transformation algorithm to construct a rectangular floorplan (Q2031052) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Towards Characterizing Graphs with a Sliceable Rectangular Dual (Q2959780) (← links)
- Rectangular duals of planar graphs (Q3710557) (← links)
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph (Q3824326) (← links)
- Transformations among rectangular partitions (Q5046001) (← links)
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY (Q5076161) (← links)
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS (Q5470176) (← links)
- (Q6150890) (← links)
- (Q6150926) (← links)