Some properties of the planar Euclidean relative neighbourhood graph

DOI10.1016/0167-8655(83)90070-3zbMath0514.68081OpenAlexW2033520438MaRDI QIDQ3660948

Roderick Urquhart

Publication date: 1983

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(83)90070-3

zbMATH Keywords

pattern recognitionGabriel graphrelative neighbourhood graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (6)

On certain Hamiltonian inner triangulations ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ PROXIMITY GRAPHS: E, δ, Δ, χ AND ω ⋮ Characterizing proximity trees ⋮ Finding Hamiltonian cycles in certain planar graphs ⋮ Relative neighborhood graphs in three dimensions

This page was built for publication: Some properties of the planar Euclidean relative neighbourhood graph