Toussaint, Godfried T.; Menard, Robert Fast algorithms for computing the planar relative neighborhood graph. (English) Zbl 0467.90028 Methods Oper. Res. 40, 425-428 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 90B05 Inventory, storage, reservoirs 51M99 Real and complex geometry 68Q25 Analysis of algorithms and problem complexity 51K05 General theory of distance geometry 05C35 Extremal problems in graph theory 05C05 Trees Keywords:polynomial algorithm; computational geometry; geometric complexity; relative neighborhood graph; planar graph; supergraph; minimal spanning tree; algorithms PDF BibTeX XML Cite \textit{G. T. Toussaint} and \textit{R. Menard}, Methods Oper. Res. 40, 425--428 (1981; Zbl 0467.90028)