Proximity drawings in polynomial area and volume

DOI10.1016/j.comgeo.2004.03.015zbMath1050.05039OpenAlexW2045229995MaRDI QIDQ1882852

Paolo Penna, Paola Vocca

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.03.015

zbMATH Keywords

Graph drawingProximity3-dimensional drawingArea-requirementGabriel drawingsstrong proximity drawing

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) 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)

Related Items (2)

Succinct greedy drawings do not always exist ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES

Cites Work

• On the approximability of two tree drawing conventions
• The relative neighbourhood graph of a finite planar set
• Graph theoretical clustering based on limited neighbourhood sets
• Area requirement and symmetry display of planar upward drawings
• Transitions in geometric minimum spanning trees
• A note on optimal area algorithms for upward drawings of binary trees
• Strictly-upward drawings of ordered search trees
• Algorithms for drawing graphs: An annotated bibliography
• Linear area upward drawings of AVL trees
• A note on parallel algorithms for optimal h-v drawings of binary trees
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Characterizing proximity trees
• TWO TREE DRAWING CONVENTIONS
• Universality considerations in VLSI circuits
• Computing proximity drawings of trees in the 3-dimensional space
• Unnamed Item
• Unnamed Item

This page was built for publication: Proximity drawings in polynomial area and volume