The approximate rectangle of influence drawability problem
From MaRDI portal
approximate proximity drawingsgraph drawingpolynomial area approximation schemeproximity drawingsrectangle of influence drawings
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cites work
- A general approach to dominance in the plane
- Approximate proximity drawings
- Area requirement of visibility representations of trees
- Characterizing proximity trees
- Closed rectangle-of-influence drawings for irreducible triangulations
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
- Drawing a tree as a minimum spanning tree approximation
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 2080251 (Why is no real title available?)
- scientific article; zbMATH DE number 1500691 (Why is no real title available?)
- ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS
- On rectangular visibility
- On the area requirements of Euclidean minimum spanning trees
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Open rectangle-of-influence drawings of non-triangulated planar graphs
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
- Polynomial area bounds for MST embeddings of trees
- The rectangle of influence drawability problem
- The relative neighborhood graph for mixed feature variables
- The relative neighbourhood graph of a finite planar set
- The strength of weak proximity
Cited in
(4)
This page was built for publication: The approximate rectangle of influence drawability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354030)