Multidimensional trees, range searching, and a correlation dimension algorithm of reduced complexity
- 1 October 1989
- journal article
- Published by Elsevier in Physics Letters A
- Vol. 140 (6) , 327-330
- https://doi.org/10.1016/0375-9601(89)90629-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Intrinsic limits on dimension calculationsPhysics Letters A, 1988
- Efficient algorithm for estimating the correlation dimension from a set of discrete pointsPhysical Review A, 1987
- Predicting chaotic time seriesPhysical Review Letters, 1987
- Measuring the strangeness of strange attractorsPhysica D: Nonlinear Phenomena, 1983
- Characterization of Strange AttractorsPhysical Review Letters, 1983
- Impracticality of a box-counting algorithm for calculating the dimensionality of strange attractorsPhysical Review A, 1982
- Geometry from a Time SeriesPhysical Review Letters, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- A two-dimensional mapping with a strange attractorCommunications in Mathematical Physics, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975