Proximity drawings in polynomial area and volume
type: Item
instance of: scholarly article
title: Proximity drawings in polynomial area and volume
zbMATH Open document ID: 1050.05039
author: Paolo Penna
author: Paola Vocca
published in: Computational Geometry
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 2105221
zbMATH Keywords: Graph drawing
zbMATH Keywords: Proximity
zbMATH Keywords: 3-dimensional drawing
zbMATH Keywords: Area-requirement
zbMATH Keywords: Gabriel drawings
zbMATH Keywords: strong proximity drawing
MaRDI profile type: Publication
full work available at URL: j.comgeo.2004.03.015
OpenAlex ID: W2045229995
cites work: Characterizing proximity trees
cites work: Q4846505
cites work: A note on optimal area algorithms for upward drawings of binary trees
cites work: Strictly-upward drawings of ordered search trees
cites work: Linear area upward drawings of AVL trees
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q3154375
cites work: Area requirement and symmetry display of planar upward drawings
cites work: TWO TREE DRAWING CONVENTIONS
cites work: The realization problem for Euclidean minimum spanning trees is NP-hard
cites work: Computing proximity drawings of trees in the 3-dimensional space
cites work: A note on parallel algorithms for optimal h-v drawings of binary trees
cites work: Transitions in geometric minimum spanning trees
cites work: On the approximability of two tree drawing conventions
cites work: The relative neighbourhood graph of a finite planar set
cites work: Graph theoretical clustering based on limited neighbourhood sets
cites work: Universality considerations in VLSI circuits
DOI: 10.1016/J.COMGEO.2004.03.015
description: scientific article; zbMATH DE number 2105221