Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Polishchuk, Valentin"'
Publikováno v:
19th Scandinavian Symposium on Algorithm Theory, SWAT 2024
Given a geometric domain $P$, visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within $P$ in order to be able to see a portion (or all) of $P$, while optimizing objectives, such as the length(s) of the r
Externí odkaz:
http://arxiv.org/abs/2402.05420
Autor:
Arkin, Esther M., Efrat, Alon, Knauer, Christian, Mitchell, Joseph S. B., Polishchuk, Valentin, Rote, Guenter, Schlipf, Lena, Talvitie, Topi
31st International Symposium on Computational Geometry (SoCG 2015)
We show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in or
We show how to preprocess a polygonal domain with a fixed starting point s in order to answer efficiently the following queries: Given a point q, how should one move from s in or
Externí odkaz:
http://hdl.handle.net/10150/614771
http://arizona.openrepository.com/arizona/handle/10150/614771
http://arizona.openrepository.com/arizona/handle/10150/614771
The classical and extensively-studied Fr\'echet distance between two curves is defined as an inf max, where the infimum is over all traversals of the curves, and the maximum is over all concurrent positions of the two agents. In this article we inves
Externí odkaz:
http://arxiv.org/abs/2203.04548
Autor:
Krechetov, Mikhail, Sikaroudi, Amir Mohammad Esmaieeli, Efrat, Alon, Polishchuk, Valentin, Chertkov, Michael
Hard-to-predict bursts of COVID-19 pandemic revealed significance of statistical modeling which would resolve spatio-temporal correlations over geographical areas, for example spread of the infection over a city with census tract granularity. In this
Externí odkaz:
http://arxiv.org/abs/2109.04517
Autor:
Arkin, Esther M., Das, Rathish, Gao, Jie, Goswami, Mayank, Mitchell, Joseph S. B., Polishchuk, Valentin, Toth, Csaba D.
Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are considered, depending on the definition of the "size" of a piece. In particul
Externí odkaz:
http://arxiv.org/abs/2006.15089
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.
We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion of "most vi
Externí odkaz:
http://arxiv.org/abs/1905.01185
Autor:
Mamano, Nil, Efrat, Alon, Eppstein, David, Frishberg, Daniel, Goodrich, Michael, Kobourov, Stephen, Matias, Pedro, Polishchuk, Valentin
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric problems: we construct the greedy multi-fragment tour for Euclidean TS
Externí odkaz:
http://arxiv.org/abs/1902.06875
We consider paths with low \emph{exposure} to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between \emph{integral} exposure (when we care about how long the path sees every point of the domain) and \emph{0
Externí odkaz:
http://arxiv.org/abs/1902.06471
Autor:
Arkin, Esther M., Chowdhury, Rezaul A., Goswami, Mayank, Huang, Jason, Mitchell, Joseph S.B., Polishchuk, Valentin, Ravindran, Rakesh
Publikováno v:
In Procedia Computer Science 2023 223:370-372
