Proximity structures for geometric graphs.

DOI10.1007/B11837MaRDI QIDQ5900768zbMATH OpenFDO

Authors Sanjiv Kapoor, Xiangyang Li

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Proximity structures for geometric graphs
• Hardness results for computing optimal locally Gabriel graphs
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• On locally Delaunay geometric graphs
• Witness (Delaunay) graphs

Cited in

(8)

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

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 Q5900768)