Constructing the relative neighborhood graph in 3-dimensional Euclidean space

DOI10.1016/0166-218X(91)90069-9zbMath0757.05062MaRDI QIDQ1175789

Jerzy W. Jaromczyk, Mirosław Kowaluk

Publication date: 25 June 1992

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

zbMATH Keywords

Euclidean spacerelative neighborhood graphcombinatorial estimates

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Sets of lines and cutting out polyhedral objects ⋮ Relative neighborhood graphs in three dimensions ⋮ Fast algorithms for computing \(\beta\)-skeletons and their relatives. ⋮ On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces

Cites Work

• The relative neighborhood graph for mixed feature variables
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Voronoi diagrams and arrangements
• Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
• The relative neighbourhood graph of a finite planar set
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Voronoi Diagram in the Laguerre Geometry and Its Applications
• Improved algorithms for discs and balls using power diagrams
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Unnamed Item
• Unnamed Item

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