The rectangle of influence drawability problem

DOI10.1016/S0925-7721(97)00018-7zbMath0896.68139MaRDI QIDQ1388129

Anna Lubiw, Henk G. Meijer, Giuseppe Liotta, S. H. Whitesides

Publication date: 8 June 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

drawing algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames ⋮ 4-labelings and grid embeddings of plane quadrangulations ⋮ Non-aligned Drawings of Planar Graphs ⋮ Optimal polygonal representation of planar graphs ⋮ Polynomial area bounds for MST embeddings of trees ⋮ Witness (Delaunay) graphs ⋮ Closed rectangle-of-influence drawings for irreducible triangulations ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Witness rectangle graphs ⋮ Open rectangle-of-influence drawings of inner triangulated plane graphs ⋮ The approximate rectangle of influence drawability problem ⋮ Voronoi drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The relative neighborhood graph for mixed feature variables
• The relative neighbourhood graph of a finite planar set
• Algorithms for drawing graphs: An annotated bibliography
• Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
• On nearest-neighbor graphs
• Graph-theoretical conditions for inscribability and Delaunay realizability
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Characterizing proximity trees
• On rectangular visibility
• A general approach to dominance in the plane
• Angles of Planar Triangular Graphs
• Computing proximity drawings of trees in the 3-dimensional space
• Nearest neighbour graph realizability is NP-hard