Construction of the nearest neighbor embracing graph of a point set

DOI10.1007/S10878-006-8459-0MaRDI QIDQ2479573zbMATH OpenOpenAlexFDO

Authors Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang

Publication date 4 April 2008

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-8459-0

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Algorithm Theory - SWAT 2004
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• scientific article; zbMATH DE number 742948
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces

Cites work

• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A new graph related to the directions of nearest neighbours in a point process
• Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3363588 (Why is no real title available?)

Cited in

(5)

• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• Algorithm Theory - SWAT 2004
• Central limit theorems for the nearest neighbour embracing graph in Euclidean and hyperbolic space
• The embracing Voronoi diagram and closest embracing number

This page was built for publication: Construction of the nearest neighbor embracing graph of a point set

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