Area requirement of visibility representations of trees

DOI10.1016/S0020-0190(97)00048-3MaRDI QIDQ287042zbMATH OpenFDO

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

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1016/S0020-0190(97)00048-3

zbMATH Keywords

area requirementcomputational geometrygraph drawingtreesvisibility representation

Mathematics Subject Classification ID

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

Recommendations

• Visibility drawings of plane 3-trees with minimum area
• Tree drawings revisited
• scientific article; zbMATH DE number 1974131
• Rectangle-visibility Layouts of Unions and Products of Trees
• scientific article; zbMATH DE number 1305404

Cites work

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

Cited in

(8)

• On embedding an outer-planar graph in a point set
• Special graph representation and visualization of semantic networks
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• The approximate rectangle of influence drawability problem
• Unit hypercube visibility numbers of trees
• Rectangle-visibility Layouts of Unions and Products of Trees
• Area, perimeter, height, and width of rectangle visibility graphs
• The strength of weak proximity

This page was built for publication: Area requirement of visibility representations of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287042)