Area requirement of visibility representations of trees

DOI10.1016/S0020-0190(97)00048-3zbMath1337.68274MaRDI QIDQ287042

Giuseppe Liotta, Roberto Tamassia, Goos Kant, Ioannis. G. Tollis

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

treescomputational geometrygraph drawingarea requirementvisibility representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Visibility representations of boxes in 2.5 dimensions, The strength of weak proximity, Special graph representation and visualization of semantic networks, Area, perimeter, height, and width of rectangle visibility graphs, Embedding-preserving rectangle visibility representations of nonplanar graphs, Ortho-polygon visibility representations of 3-connected 1-plane graphs, The partial visibility representation extension problem, Ortho-polygon visibility representations of embedded graphs, On embedding an outer-planar graph in a point set, The approximate rectangle of influence drawability problem

Cites Work

• Unnamed Item
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Area requirement and symmetry display of planar upward drawings
• Some results on visibility graphs
• Algorithms for drawing graphs: An annotated bibliography
• Can visibility graphs be represented compactly?
• Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA