Zobrazeno 1 - 9
of 9
pro vyhledávání: '"de Berg, Sarita"'
A geometric $t$-spanner $\mathcal{G}$ on a set $S$ of $n$ point sites in a metric space $P$ is a subgraph of the complete graph on $S$ such that for every pair of sites $p,q$ the distance in $\mathcal{G}$ is a most $t$ times the distance $d(p,q)$ in
Externí odkaz:
http://arxiv.org/abs/2402.12110
In this paper, we consider the Weighted Region Problem. In the Weighted Region Problem, the length of a path is defined as the sum of the weights of the subpaths within each region, where the weight of a subpath is its Euclidean length multiplied by
Externí odkaz:
http://arxiv.org/abs/2402.12028
We study a variant of the searching problem where the environment consists of a known terrain and the goal is to obtain visibility of an unknown target point on the surface of the terrain. The searcher starts on the surface of the terrain and is allo
Externí odkaz:
http://arxiv.org/abs/2401.01289
Given a set of $n$ points in the Euclidean plane, the $k$-MinSumRadius problem asks to cover this point set using $k$ disks with the objective of minimizing the sum of the radii of the disks. After a long line of research on related problems, it was
Externí odkaz:
http://arxiv.org/abs/2312.08803
A geometric $t$-spanner for a set $S$ of $n$ point sites is an edge-weighted graph for which the (weighted) distance between any two sites $p,q \in S$ is at most $t$ times the original distance between $p$ and~$q$. We study geometric $t$-spanners for
Externí odkaz:
http://arxiv.org/abs/2303.02997
We devise a data structure that can answer shortest path queries for two query points in a polygonal domain $P$ on $n$ vertices. For any $\varepsilon > 0$, the space complexity of the data structure is $O(n^{10+\varepsilon })$ and queries can be answ
Externí odkaz:
http://arxiv.org/abs/2303.00666
Autor:
de Berg, Sarita, Staals, Frank
Our aim is to develop dynamic data structures that support $k$-nearest neighbors ($k$-NN) queries for a set of $n$ point sites in the plane in $O(f(n) + k)$ time, where $f(n)$ is some polylogarithmic function of $n$. The key component is a general qu
Externí odkaz:
http://arxiv.org/abs/2109.11854
Autor:
de Berg, Sarita1 s.deberg@uu.nl, van Kreveld, Marc1 m.j.vankreveld@uu.nl, Staals, Frank1 f.staals@uu.nl
Publikováno v:
Journal of Computational Geometry. 2024, Vol. 15 Issue 1, p21-65. 45p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.