The rectangle of influence drawability problem
type: Item
instance of: scholarly article
title: The rectangle of influence drawability problem
zbMATH Open document ID: 0896.68139
DOI: 10.1016/S0925-7721(97)00018-7
published in: Computational Geometry
publication date: 1998-06-08T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1161188
zbMATH Keywords: drawing algorithms
author: Giuseppe Liotta
author: Anna Lubiw
author: Henk Meijer
author: Sue Whitesides
MaRDI profile type: Publication
cites work: Q5422499
cites work: Characterizing proximity trees
cites work: Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
cites work: A general approach to dominance in the plane
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Angles of Planar Triangular Graphs
cites work: Graph-theoretical conditions for inscribability and Delaunay realizability
cites work: The realization problem for Euclidean minimum spanning trees is NP-hard
cites work: Nearest neighbour graph realizability is NP-hard
cites work: Q5759552
cites work: The relative neighborhood graph for mixed feature variables
cites work: Computing proximity drawings of trees in the 3-dimensional space
cites work: On rectangular visibility
cites work: On nearest-neighbor graphs
cites work: Q3992847
cites work: The relative neighbourhood graph of a finite planar set
description: scientific article; zbMATH DE number 1161188