Zobrazeno 1 - 10
of 290 607
pro vyhledávání: '"Stabbing"'
Autor:
Biedl, Therese, Durocher, Stephane, Mondal, Debajyoti, Nishat, Rahnuma Islam, Rivier, Bastien
A \emph{conforming partition} of a rectilinear $ n $-gon\bastien{I change from ``a polygon'', otherwise $ n $ is not defined.} $ P $ is a partition of $ P $ into rectangles without using Steiner points (i.e., all corners of all rectangles must lie on
Externí odkaz:
http://arxiv.org/abs/2411.11274
Autor:
Akram, Waseem, Saxena, Sanjeev
We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $
Externí odkaz:
http://arxiv.org/abs/2411.03037
Autor:
AFSHANI, PEYMAN1 peyman@cs.au.dk, CHENG, PINGAN1 pingancheng@cs.au.dk
Publikováno v:
Journal of the ACM. Apr2023, Vol. 70 Issue 2, p1-26. 26p.
Autor:
Alyssa Maxwell
As England recovers from its costly involvement in the Great War, Lady Phoebe Renshaw and her lady's maid, Eva Huntford, find the steady comforts of their lives unsettled by a local case of murder... Eva is excited for a visit from her sister Alice,
Intervals have been generated in many applications (e.g., temporal databases), and they are often associated with weights, such as prices. This paper addresses the problem of processing top-k weighted stabbing queries on interval data. Given a set of
Externí odkaz:
http://arxiv.org/abs/2405.05601
Autor:
Kartal Yeter, Nil Deniz1 (AUTHOR) nildekarster@gmail.com, Karaca, Mehmet Ali2 (AUTHOR), Yeter, Ahmet Sefa3 (AUTHOR), Öztürk İnce, Elif2 (AUTHOR), Erbil, Bülent2 (AUTHOR)
Publikováno v:
BMC Emergency Medicine. 9/16/2024, Vol. 24 Issue 1, p1-7. 7p.
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.
Autor:
Blank, Lotte, Driemel, Anne
We study the Fr\'echet queries problem. It is a data structure problem, where we are given a set $S$ of $n$ polygonal curves and a distance threshold $\rho$. The data structure should support queries with a polygonal curve $q$ for the elements of $S$
Externí odkaz:
http://arxiv.org/abs/2401.03762
Polynomial partitioning techniques have recently led to improved geometric data structures for a variety of fundamental problems related to semialgebraic range searching and intersection searching in 3D and higher dimensions (e.g., see [Agarwal, Aron
Externí odkaz:
http://arxiv.org/abs/2403.12303
We study the problem of stabbing rectilinear polygons, where we are given $n$ rectilinear polygons in the plane that we want to stab, i.e., we want to select horizontal line segments such that for each given rectilinear polygon there is a line segmen
Externí odkaz:
http://arxiv.org/abs/2402.02412