scientific article; zbMATH DE number 742948

zbMATH Open0829.68092MaRDI QIDQ4763389FDOQ4763389

Authors: Pankaj K. Agarwal, Jiří Matoušek 

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

Recommendations

• Relative neighborhood graphs in three dimensions
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• Computing relative neighbourhood graphs in the plane
• scientific article; zbMATH DE number 4093511
• Graphical neighborhoods of spatial graphs
• scientific article; zbMATH DE number 409491
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• scientific article; zbMATH DE number 4103126
• The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation

zbMATH Keywords

Delaunay triangulationrelative neighborhood graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (8)

• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation
• Relative neighborhood graphs in three dimensions
• Algorithm Theory - SWAT 2004
• Construction of the nearest neighbor embracing graph of a point set
• An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• Minimum weight euclidean matching and weighted relative neighborhood graphs

This page was built for publication:

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