Multidimensional $\beta$-skeletons in $L_1$ and $L_{\infty}$ metric

TL;DR

This paper studies the properties and algorithms for computing $eta$-skeletons in $ ext{L}_1$ and $ ext{L}_ ext{infty}$ metrics across various dimensions, providing efficient algorithms for different $eta$ ranges.

Contribution

It introduces algorithms for computing $eta$-skeletons in $ ext{L}_1$ and $ ext{L}_ ext{infty}$ metrics for all $eta$ values and analyzes their computational complexities.

Findings

For $ ext{L}_ ext{infty}$, $eta<2$ skeletons can be computed in $O(n^2 ext{log}^d n)$ time.

For $ ext{L}_ ext{infty}$, $eta ext{ge} 2$ skeletons can be computed in $O(n ext{log}^{d-1} n)$ time.

In $ ext{L}_1$, skeletons can be computed in $O(n^2 ext{log}^{d+2} n)$ time.

Abstract

The $\beta$-skeleton $\{G_{\beta}(V)\}$ for a point set V is a family of geometric graphs, defined by the notion of neighborhoods parameterized by real number $0 < \beta < \infty$. By using the distance-based version definition of $\beta$-skeletons we study those graphs for a set of points in $\mathbb{R}^d$ space with $l_1$ and $l_{\infty}$ metrics. We present algorithms for the entire spectrum of $\beta$ values and we discuss properties of lens-based and circle-based $\beta$-skeletons in those metrics. Let $V \in \mathbb{R}^d$ in $L_{\infty}$ metric be a set of $n$ points in general position. Then, for $\beta<2$ lens-based $\beta$-skeleton $G_{\beta}(V)$ can be computed in $O(n^2 \log^d n)$ time. For $\beta \geq 2$ there exists an $O(n \log^{d-1} n)$ time algorithm that constructs $\beta$-skeleton for the set $V$. We show that in $\mathbb{R}^d$ with $L_{\infty}$ metric, for $\beta<2$ $\beta$-skeleton $G_{\beta}(V)$ for $n$ points can be computed in $O(n^2 \log^d n)$ time. For $\beta \geq 2$ there exists an $O(n \log^{d-1} n)$ time algorithm. In $\mathbb{R}^d$ with $L_1$ metric for a set of $n$ points in arbitrary position $\beta$-skeleton $G_{\beta}(V)$ can be computed in $O(n^2 \log^{d+2} n)$ time.