The approximate rectangle of influence drawability problem
DOI10.1007/s00453-013-9866-0zbMath1325.68168OpenAlexW2007280403WikidataQ62042382 ScholiaQ62042382MaRDI QIDQ2354030
Giuseppe Liotta, Emilio Di Giacomo, Henk G. Meijer
Publication date: 10 July 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_11
graph drawingapproximate proximity drawingspolynomial area approximation schemeproximity drawingsrectangle of influence drawings
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Area requirement of visibility representations of trees
- Drawing a tree as a minimum spanning tree approximation
- Polynomial area bounds for MST embeddings of trees
- Closed rectangle-of-influence drawings for irreducible triangulations
- How to draw a planar graph on a grid
- The strength of weak proximity
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- The relative neighborhood graph for mixed feature variables
- The relative neighbourhood graph of a finite planar set
- The rectangle of influence drawability problem
- Characterizing proximity trees
- Approximate proximity drawings
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
- ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS
- On rectangular visibility
- A general approach to dominance in the plane
- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs
- On the Area Requirements of Euclidean Minimum Spanning Trees
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time
This page was built for publication: The approximate rectangle of influence drawability problem
