A more compact visibility representation
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)
Recommendations
- Compact visibility representation of plane graphs
- Improved visibility representation of plane graphs
- scientific article; zbMATH DE number 1161868
- Variants of Visibility and their Complexity
- A framework for n-dimensional visibility computations
- A succinct 3D visibility skeleton
- The visibility function revisited
Cites work
- A unified approach to visibility representations of planar graphs
- Algorithms for drawing graphs: An annotated bibliography
- Arboricity and Subgraph Listing Algorithms
- Area requirement and symmetry display of planar upward drawings
- Constrained visibility representations of graphs
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs
- Dividing a Graph into Triconnected Components
- Finding short cycles in planar graphs using separators
- How to draw a planar graph on a grid
- How to draw a series-parallel digraph
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- scientific article; zbMATH DE number 1256645 (Why is no real title available?)
- Rectilinear planar layouts and bipolar orientations of planar graphs
- The Two-Triangle Case of the Acquaintance Graph
This page was built for publication: A more compact visibility representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143992)
