The relative neighbourhood graph of a finite planar set
暂无分享,去创建一个
[1] John F. O'Callaghan,et al. An Alternative Definition for "Neighborhood of a Point" , 1975, IEEE Transactions on Computers.
[2] B. A. Lewis,et al. Triangulation of Planar Regions with Applications , 1978, Comput. J..
[3] W. Mauch,et al. Contents , 2007, European Neuropsychopharmacology.
[4] F. Roberts. Random minimal trees , 1968 .
[5] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..
[6] D. J. Langridge,et al. A Computational View of Perception , 1973, Perception.
[7] Michael Ian Shamos,et al. Divide and Conquer for Linear Expected Time , 1978, Information Processing Letters.
[8] Charles T. Zahn,et al. Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.
[9] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[10] Frank Harary,et al. Graph Theory , 2016 .
[11] Robin Sibson,et al. Locally Equiangular Triangulations , 1978, Comput. J..
[12] B. Weide. Statistical methods in algorithm design and analysis. , 1978 .
[13] Luc Devroye. A Note on Finding Convex Hulls Via Maximal Vectors , 1980, Inf. Process. Lett..