Measuring the Complexity of Polygonal Objects
暂无分享,去创建一个
Hans-Peter Kriegel | Thomas Brinkhoff | Ralf Schneider | A. Braun | H. Kriegel | Thomas Brinkhoff | R. Schneider | A. Braun
[1] Takao Asano,et al. Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[3] Benoit B. Mandelbrot,et al. Fractal Geometry of Nature , 1984 .
[4] Christos Faloutsos,et al. Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.
[5] Dietmar Saupe,et al. Chaos and fractals - new frontiers of science , 1992 .
[6] Hans-Peter Kriegel,et al. The Performance of Object Decomposition Techniques for Spatial Query Processing , 1991, SSD.
[7] P. Pizor. Principles of Geographical Information Systems for Land Resources Assessment. , 1987 .
[8] Hans-Peter Kriegel,et al. Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.
[9] Michael Stonebraker,et al. The SEQUOIA 2000 storage benchmark , 1993, SIGMOD '93.
[10] P. Burrough. Principles of Geographical Information Systems for Land Resources Assessment , 1986 .
[11] Hans-Peter Kriegel,et al. Performance Comparison of Point and Spatial Access Methods , 1990, SSD.
[12] Hans-Peter Kriegel,et al. The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations , 1991, Workshop on Computational Geometry.
[13] Hans-Peter Kriegel,et al. Multi-step processing of spatial joins , 1994, SIGMOD '94.