SearcharxivSearch

arXiv · 1904.08053

A scaled space-filling curve index applied to tropical rain forest tree distributions

Abstract

In order to be able to process the increasing amount of spatial data, efficient methods for their handling need to be developed. One major challenge for big spatial data is access. This can be achieved through space-filling curves, as they have the property that nearby points on the curve are also nearby in space. They are able to handle higher dimensional data, too. Higher dimensional data is widely used e.g. in CityGML and is becoming more and more important. In a laboratory experiment on a tropical rain forest tree data set of 2.5 million points taken from an 18-dimensional space, it is demonstrated that the recently constructed scaled Gray-Hilbert curve index performs better than its standard static version, saving a significant amount of space for a projection of the data set onto 8 attributes. The implementation is based on a binary tree in a data-driven process, in a similar way as e.g. the R-tree. Its scalability allows the handling of different kinds of data distributions which are reflected in the tree structure of the index. The relative efficiency of the scaled Gray-Hilbert curve in comparison with the best static version is seen to depend on the distribution of the point cloud. A local sparsity measure derived from properties of the corresponding trees can distinguish point clouds with different tail distributions. The different resulting binary trees are visualised to illustrate the influences of the different tail distributions they have been built on.

Explore related subjects

Keep this discovery

BibTeXRIS

Markus Wilhelm Jahn, Patrick Erik Bradley. 2019-04-16. A scaled space-filling curve index applied to tropical rain forest tree distributions. https://arxiv.org/abs/1904.08053

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS