Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.01012

Reconstructing the Dynamic Sea Surface from Tide Gauge Records Using Optimal Data-Dependent Triangulations

Alina Nitzke·Benjamin Niedermann·Luciana Fenoglio-Marc·Jürgen Kusche·Jan-Henrik Haunert
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconstructions of sea level prior to the satellite altimeter era are usually derived from tide gauge records; however most algorithms for this assume that modes of sea level variability are stationary which is not true over several decades. Here we suggest a method that is based on optimized data-dependent triangulations of the network of gauge stations. Data-dependent triangulations are triangulations of point sets that rely not only on 2D point positions but also on additional data (e.g. elevation, anomalies). In this article, we show how data-dependent triangulations with min-error criteria can be used to reconstruct 2D maps of the sea surface anomaly over a longer time period, assuming that height anomalies are continuously monitored at a sparse set of stations and, in addition, observations of a reference surface is provided over a shorter time period. At the heart of our method is the idea to learn a min-error triangulation based on the available reference data, and to use the learned triangulation subsequently to compute piece-wise linear surface models for epochs in which only observations from monitoring stations are given. We combine our approach of min-error triangulation with $k$-order Delaunay triangulation to stabilize the triangles geometrically. We show that this approach is advantageous for the reconstruction of the sea surface by combining tide gauge measurements with data of modern satellite altimetry. We show how to learn a min-error triangulation and a min-error $k$-order Delaunay triangulation using integer linear programming. We confront our reconstructions against the Delaunay triangulation. With real data for the North Sea we show that the min-error triangulation outperforms the Delaunay method significantly for reconstructions back in time up to 18 years, and the $k$-order Delaunay min-error triangulation even up to 21 years for $k=2$.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Alina Nitzke, Benjamin Niedermann, Luciana Fenoglio-Marc, Jürgen Kusche, Jan-Henrik Haunert. 2020-09-02. Reconstructing the Dynamic Sea Surface from Tide Gauge Records Using Optimal Data-Dependent Triangulations. https://arxiv.org/abs/2009.01012

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗