Local properties of geometric graphs
From MaRDI portal
Publication:2456666
DOI10.1016/j.comgeo.2007.05.011zbMath1124.05067MaRDI QIDQ2456666
Stefan Langerman, Jean Cardinal, Sébastien Collette
Publication date: 19 October 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.05.011
05C12: Distance in graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Cites Work
- Unnamed Item
- Ordered theta graphs
- Proximate point searching
- Empty region graphs
- Generalized Delaunay triangulation for planar graphs
- Classes of graphs which approximate the complete Euclidean graph
- On nearest-neighbor graphs
- Self-adjusting binary search trees
- Design and Analysis of a Data Structure for Representing Sorted Lists
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Proximate planar point location