Incremental Neighborhood Graphs Construction for Multidimensional Databases Indexing
暂无分享,去创建一个
[1] H. L. Le Roy,et al. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .
[2] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[3] R. Sokal,et al. A New Statistical Approach to Geographic Variation Analysis , 1969 .
[4] Robert L. Scot Drysdale,et al. A Comparison of Sequential Delaunay Triangulation Algorithms , 1997, Comput. Geom..
[5] Wenfei Fan,et al. Keys with Upward Wildcards for XML , 2001, DEXA.
[6] Warren D. Smith. Studies in computational geometry motivated by mesh generation , 1989 .
[7] P Cignoni,et al. DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed , 1998, Comput. Aided Des..
[8] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[9] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[10] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[11] D. Kirkpatrick,et al. A Framework for Computational Morphology , 1985 .
[12] Panu Somervuo,et al. Self-Organizing Maps and Learning Vector Quantization for Feature Sequences , 1999, Neural Processing Letters.
[13] Jyrki Katajaien,et al. The region approach for computing relative neighborhood graphs in the L p metric , 1988 .
[14] Hakim Hacid,et al. An Effective Method for Locally Neighborhood Graphs Updating , 2005, DEXA.
[15] Godfried T. Toussaint,et al. Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.