On nearest-neighbor graphs

DOI10.1007/3-540-55719-9_93zbMath1425.68439OpenAlexW1545795230MaRDI QIDQ5204336

Michael S. Paterson, F. Frances Yao

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_93

zbMATH Keywords

Steiner treecombinatorial propertyDelaunay graphconvex hull algorithmlarge dilation

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On nearest-neighbor graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Two probabilistic results on rectilinear Steiner trees
• Reporting points in halfspaces
• A vectorized near neighbors algorithm of order N using a monotonic logical grid

This page was built for publication: On nearest-neighbor graphs