Proximity structures for geometric graphs

DOI10.1142/S0218195910003360MaRDI QIDQ4931730zbMATH OpenOpenAlexFDO

Authors Sanjiv Kapoor, Xiangyang Li

Publication date 30 September 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195910003360

zbMATH Keywords

Delaunay triangulationGabriel graphgeometric graphproximity structurerelative neighbourhood graphVoronoi diagramwireless communicationswireless networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Proximity structures for geometric graphs.
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• On locally Delaunay geometric graphs
• Some properties of k-Delaunay and k-Gabriel graphs
• Witness (Delaunay) graphs

Cites work

• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons

Cited in

(10)

• The \(\gamma\)-neighborhood graph
• Hardness results for computing optimal locally Gabriel graphs
• On locally Gabriel geometric graphs
• Proximity in triangulations and quadrangulations
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• Proximity graphs inside large weighted graphs
• On locally Delaunay geometric graphs
• Witness (Delaunay) graphs
• Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks
• Proximity structures for geometric graphs.

This page was built for publication: Proximity structures for geometric graphs

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