Constructing the relative neighborhood graph in 3-dimensional Euclidean space

DOI10.1016/0166-218X(91)90069-9MaRDI QIDQ1175789zbMATH OpenFDO

Authors Jerzy W. Jaromczyk, Mirosław Kowaluk

Publication date 25 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(91)90069-9

zbMATH Keywords

combinatorial estimatesEuclidean spacerelative neighborhood graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 742948
• Relative neighborhood graphs in three dimensions
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• Computing relative neighbourhood graphs in the plane
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• A divide-and-conquer algorithm for constructing relative neighborhood graph
• The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation
• Construction of the nearest neighbor embracing graph of a point set
• Algorithm Theory - SWAT 2004

Cites work

• scientific article; zbMATH DE number 3907805 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• Improved algorithms for discs and balls using power diagrams
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
• The relative neighborhood graph for mixed feature variables
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The relative neighbourhood graph of a finite planar set
• Voronoi Diagram in the Laguerre Geometry and Its Applications
• Voronoi diagrams and arrangements

Cited in

(9)

• The relative neighborhood graph for mixed feature variables
• Relative neighborhood graphs in three dimensions
• Sets of lines and cutting out polyhedral objects
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• scientific article; zbMATH DE number 742948 (Why is no real title available?)
• Fast algorithms for computing -skeletons and their relatives.
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• A divide-and-conquer algorithm for constructing relative neighborhood graph
• The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation

This page was built for publication: Constructing the relative neighborhood graph in 3-dimensional Euclidean space

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