Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
type: Item
instance of: scholarly article
title: Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics
zbMATH Open document ID: 0486.68063
DOI: 10.1016/0031-3203(82)90070-X
author: Joseph O'Rourke
published in: Pattern Recognition
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3765163
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: range queries
zbMATH Keywords: computational geometry
zbMATH Keywords: time complexity
zbMATH Keywords: Euclidean metric
MaRDI profile type: Publication
cites work: The relative neighbourhood graph of a finite planar set
cites work: Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
cites work: Efficient worst-case data structures for range searching
cites work: Multidimensional Searching Problems
cites work: Multidimensional divide-and-conquer
cites work: An Elementary Proof of Nonexistence of Isometries between ℓpk and ℓqk
cites work: Q3992847
cites work: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
cites work: Two-Dimensional Voronoi Diagrams in the L p -Metric
cites work: The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
full work available at URL: 0031-3203(82)90070-x
OpenAlex ID: W1972165561
description: scientific article; zbMATH DE number 3765163