Proximity drawability: A survey extended abstract
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 328-339
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The realization problem for Euclidean minimum spanning trees is NP-hard1994
- Angles of planar triangular graphs1993
- Relative neighborhood graphs in three dimensionsComputational Geometry, 1992
- A general approach to dominance in the planeJournal of Algorithms, 1992
- Properties of some Euclidean proximity graphsPattern Recognition Letters, 1992
- Toughness and Delaunay triangulationsDiscrete & Computational Geometry, 1990
- Realizability of delaunay triangulationsInformation Processing Letters, 1990
- Fast algorithms for direct enclosures and direct dominancesJournal of Algorithms, 1989
- GRAPH THEORY1969
- A New Statistical Approach to Geographic Variation AnalysisSystematic Zoology, 1969