Extension of one-dimensional proximity regions to higher dimensions

Ceyhan, 2008 Ceyhan E. Ceyhan, Spatial clustering tests based on domination number of a new random digraph family, Communications in Statistics – Theory and Methods (2010), in press Ceyhan, 2003, Central similarity proximity maps in Delaunay tessellations Ceyhan, 2005, The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association, Statistics & Probability Letters, 73, 37, 10.1016/j.spl.2005.02.012 Ceyhan, 2007, On the distribution of the domination number of a new family of parametrized random digraphs, Model Assisted Statistics and Applications, 1, 231, 10.3233/MAS-2006-1404 Ceyhan, 2007, A new family of random graphs for testing spatial segregation, Canadian Journal of Statistics, 35, 27, 10.1002/cjs.5550350106 Ceyhan, 2006, Relative density of the random r-factor proximity catch digraphs for testing spatial patterns of segregation and association, Computational Statistics & Data Analysis, 50, 1925, 10.1016/j.csda.2005.03.002 Chartrand, 1996 J. DeVinney, The class cover problem and its applications in pattern recognition, PhD thesis, The Johns Hopkins University, Baltimore, MD 21218, 2003 DeVinney, 2006, A new family of proximity graphs: Class cover catch digraphs, Discrete Applied Mathematics, 154, 1975, 10.1016/j.dam.2006.04.004 DeVinney, 2002, Random walks and catch digraphs in classification, vol. 34 Janson, 2000, Random Graphs, 10.1002/9781118032718 Jaromczyk, 1992, Relative neighborhood graphs and their relatives, Proceedings of IEEE, 80, 1502, 10.1109/5.163414 Kimberling Lehmann, 1988 Marchette, 2003, Characterizing the scale dimension of a high dimensional classification problem, Pattern Recognition, 36, 45, 10.1016/S0031-3203(02)00042-0 Mardia, 1977, Analysis of central place theory, Bulletin of International Statistical Institute, 47, 93 Okabe, 2000 Paterson, 1992, On nearest neighbor graphs, vol. 623, 416 Priebe, 2001, On the distribution of the domination number of random class cover catch digraphs, Statistics & Probability Letters, 55, 239, 10.1016/S0167-7152(01)00129-8 Priebe, 2003, Classification using class cover catch digraphs, Journal of Classification, 20, 3, 10.1007/s00357-003-0003-7 Priebe, 2003, Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays, Computational Statistics & Data Analysis on Visualization, 43, 621, 10.1016/S0167-9473(02)00296-7 Sen, 1989, Interval digraphs: An analogue of interval graphs, Journal of Graph Theory, 13, 189, 10.1002/jgt.3190130206 Toussaint, 1980, The relative neighborhood graph of a finite planar set, Pattern Recognition, 12, 261, 10.1016/0031-3203(80)90066-7 Tuza, 1994, Inequalities for minimal covering sets in sets in set systems of given rank, Discrete Applied Mathematics, 51, 187, 10.1016/0166-218X(94)90108-2 Weisstein