Characterizing proximity trees
type: Item
instance of: scholarly article
title: Characterizing proximity trees
zbMATH Open document ID: 0855.68068
DOI: 10.1007/BF02086609
author: William Lenhart
author: Giuseppe Liotta
author: Patrick Bosc
published in: Algorithmica
publication date: 1997-01-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 915696
zbMATH Keywords: graph drawing
zbMATH Keywords: Gabriel graph
zbMATH Keywords: real RAM model
MaRDI profile type: Publication
cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
cites work: Q3097395
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: On the shape of a set of points in the plane
cites work: Q5786239
cites work: Trees that are sphere-of-influence graphs
cites work: Transitions in geometric minimum spanning trees
cites work: Q3694703
cites work: Q4031609
cites work: The relative neighbourhood graph of a finite planar set
cites work: Some properties of the planar Euclidean relative neighbourhood graph
full work available at URL: https://doi.org/10.1007/bf02086609
OpenAlex ID: W2050602252
description: scientific article; zbMATH DE number 915696