Computing the relative neighborhood graph in the L_ 1 and L//infinity metrics

DOI10.1016/0031-3203(82)90070-XMaRDI QIDQ1165014zbMATH OpenOpenAlexFDO

Authors Joseph O'Rourke

Publication date 1982

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(82)90070-x

zbMATH Keywords

computational geometryDelaunay triangulationEuclidean metrictime complexityrange queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• An Elementary Proof of Nonexistence of Isometries between ℓ_p^k and ℓ_q^k
• Efficient worst-case data structures for range searching
• Multidimensional Searching Problems
• Multidimensional divide-and-conquer
• Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The relative neighbourhood graph of a finite planar set
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications

Cited in

(6)

• \(\beta\)-skeleton depth functions and medians
• Computing relative neighbourhood graphs in the plane
• The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
• The relative neighborhood graph for mixed feature variables
• An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
• Classification by restricted random walks

This page was built for publication: Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165014)