Proximity Structures for Geometric Graphs
暂无分享,去创建一个
[1] Steven Fortune,et al. Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[2] Peng-Jun Wan,et al. Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.
[3] Rom Pinchasi,et al. On locally Delaunay geometric graphs , 2004, SCG '04.
[4] Michalis Faloutsos,et al. Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.
[5] Rom Pinchasi,et al. Topological graphs with no self-intersecting cycle of length 4 , 2003, SCG '03.
[6] R. Sokal,et al. A New Statistical Approach to Geographic Variation Analysis , 1969 .
[7] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[8] David G. Kirkpatrick,et al. On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.
[9] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[10] Godfried T. Toussaint,et al. Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.
[11] Xiang-Yang Li,et al. Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[12] Jerzy W. Jaromczyk,et al. Constructing the relative neighborhood graph in 3-dimensional Euclidean space , 1991, Discret. Appl. Math..
[13] Kenneth J. Supowit,et al. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.
[14] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .