On Finding the Rectangular Duals of Planar Triangular Graphs
From MaRDI portal
Recommendations
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Rectangular duals of planar graphs
- A theory of rectangular dual graphs
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
Cited in
(53)- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Planar L-Drawings of Bimodal Graphs
- scientific article; zbMATH DE number 1420915 (Why is no real title available?)
- Grand-Schnyder woods
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- On the enumeration of plane bipolar posets and transversal structures
- On Planar Polyline Drawings
- Linear-time algorithm for generating \(L\)-shaped floorplans using canonical ordering technique
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
- On \(k\)-greedy routing algorithms
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- Planar confluent orthogonal drawings of 4-modal digraphs
- Planar L-drawings of bimodal graphs
- Improved floor-planning of graphs via adjacency-preserving transformations
- Rectangular grid drawings of plane graphs
- Closed rectangle-of-influence drawings for irreducible triangulations
- Existence and construction of a C-shaped module within a floorplan
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- A census of graph-drawing algorithms based on generalized transversal structures
- Rectangular drawings of plane graphs without designated corners
- A graph theoretic approach for generating \(T\)-shaped floor plans
- Star-shaped and \(L\)-shaped orthogonal drawings
- All separating triangles in a plane graph can be optimally ``broken in polynomial time
- Planar bus graphs
- Morphing rectangular duals
- Rectangular grid drawings of plane graphs
- A transformation algorithm to construct a rectangular floorplan
- Uniqueness of rectangularly dualizable graphs
- Linear-time construction of floor plans for plane triangulations
- Realization and connectivity of the graphs of origami flat foldings
- A Schnyder-type drawing algorithm for 5-connected triangulations
- Aspect ratio universal rectangular layouts
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- NP-completeness of st-orientations for plane graphs
- Planar polyline drawings via graph transformations
- Aspect ratio universal rectangular layouts
- Rectangular duals of planar graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Drawing planar graphs using the canonical ordering
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- New bijective links on planar maps via orientations
- RECTANGULARLY DUALIZABLE GRAPHS: AREA-UNIVERSALITY
- Construction of floorplans for plane graphs over polygonal boundaries
- Transformations among rectangular partitions
- Efficient enumeration of transversal edge-partitions
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- Star shaped orthogonal drawing
- ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS
- Two algorithms for finding rectangular duals of planar graphs
- An $O(n)$ Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection
- A theory of L-shaped floor-plans
- The Duals of Upward Planar Graphs on Cylinders
- Graph Drawing
This page was built for publication: On Finding the Rectangular Duals of Planar Triangular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277538)
