On bend-minimized orthogonal drawings of planar 3-graphs
From MaRDI portal
Publication:4580103
DOI10.4230/LIPICS.SOCG.2017.29zbMATH Open1432.68345MaRDI QIDQ4580103FDOQ4580103
Authors: Yi-Jun Chang, Hsu-Chun Yen 
Publication date: 13 August 2018
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (19)
- Bend-minimum orthogonal drawings in quadratic time
- Orthogonal planarity testing of bounded treewidth graphs
- An annotated review on graph drawing and its applications
- Accelerated bend minimization
- Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
- Accelerated bend minimization
- HV-planarity: algorithms and complexity
- Complexity results for three-dimensional orthogonal graph drawing
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Sliding column model for t-unit bar visibility representations of graphs
- Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
- Unit-length rectangular drawings of graphs
- 1-bend 3-D orthogonal box-drawings: Two open problems solved
- Extending orthogonal planar graph drawings is fixed-parameter tractable
- Unit-length rectangular drawings of graphs
- A topology-shape-metrics framework for ortho-radial graph drawing
- Title not available (Why is that?)
- Planar rectilinear drawings of outerplanar graphs in linear time
- Sketched representations and orthogonal planarity of bounded treewidth graphs
This page was built for publication: On bend-minimized orthogonal drawings of planar 3-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580103)
