Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Omrit Filtser"'
Autor:
Arnold Filtser, Omrit Filtser
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:5407-5414
Consider a set of voters V, represented by a multiset in a metric space (X,d). The voters have to reach a decision - a point in X. A choice p∈ X is called a β-plurality point for V, if for any other choice q∈ X it holds that |{v∈ V ∣ β⋅ d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71c7fb00a4a56d273ba9067464d5c83f
https://doi.org/10.1609/aaai.v35i6.16681
https://doi.org/10.1609/aaai.v35i6.16681
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030808785
WAOA
WAOA
The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time \(O(\log n)\)-approximation algorithm for placing as few guards as possible at vertices of a simple n-gon P, such that every p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::102da4aeb2899f0610c6659a80af1c11
https://doi.org/10.1007/978-3-030-80879-2_6
https://doi.org/10.1007/978-3-030-80879-2_6
Autor:
Filtser, A., Omrit Filtser
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdefcae22dae633fdc23a61524faf12f
https://doi.org/10.1137/1.9781611976465.71
https://doi.org/10.1137/1.9781611976465.71
Publikováno v:
Computational Geometry. 101:101832
A graph \(G = (V,E)\) is terrain-like if one can assign a unique integer from the range [1..|V|] to each vertex in V, such that, if both \(\{i,k\}\) and \(\{j,l\}\) are in E, for any \(i< j< k < l\), then so is \(\{i,l\}\). We present a local-search-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4efc1398c051e958f2768208a2ec902
https://doi.org/10.1016/j.comgeo.2021.101832
https://doi.org/10.1016/j.comgeo.2021.101832
Autor:
Omrit Filtser
Publikováno v:
Information Processing Letters. 132:22-27
The problem of simplifying a polygonal curve or chain is well studied and has many applications. The discrete Frechet distance is a useful similarity measure for curves, which has been utilized for many real-world applications. When the curves are hu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7da6e4b29ada3d1236a28065ef088890
https://doi.org/10.1016/j.ipl.2017.10.002
https://doi.org/10.1016/j.ipl.2017.10.002
In the $(1+\varepsilon,r)$-approximate near-neighbor problem for curves (ANNC) under some distance measure $\delta$, the goal is to construct a data structure for a given set $\mathcal{C}$ of curves that supports approximate near-neighbor queries: Gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f497b74e36e5288a81c3ff07a584916
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030394783
WAOA
WAOA
A graph \(G = (V,E)\) is terrain-like if one can assign a unique integer from the range [1..|V|] to each vertex in V, such that, if both \(\{i,k\}\) and \(\{j,l\}\) are in E, for any \(i< j< k < l\), then so is \(\{i,l\}\). We present a local-search-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a7852b53c748ca4135889f0780fdb7c
https://doi.org/10.1007/978-3-030-39479-0_1
https://doi.org/10.1007/978-3-030-39479-0_1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030247652
WADS
WADS
We study two fundamental problems dealing with curves in the plane, namely, the nearest-neighbor problem and the center problem. Let \(\mathcal {C}\) be a set of n polygonal curves, each of size m. In the nearest-neighbor problem, the goal is to cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33ee5674fac5fc2f4ee00cf4ea0f327b
https://doi.org/10.1007/978-3-030-24766-9_3
https://doi.org/10.1007/978-3-030-24766-9_3
Let A and B be two sets of points in R^d, where |A|=|B|=n and the distance between them is defined by some bipartite measure dist(A, B). We study several problems in which the goal is to translate the set B, so that dist(A, B) is minimized. The main
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06556fffedd641a630079788609c836b
Publikováno v:
Computational Geometry, 65(October 2017), 12-26. Elsevier
Let P be an orthogonal polygon with n vertices. A sliding camera travels back and forth along an orthogonal line segment s ⊆ P corresponding to its trajectory. The camera sees a point p ∈ P if there is a point q ∈ s such that p q ‾ is a line
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5c6d01a30a48f0edcc1809a00c3fc21
https://research.tue.nl/nl/publications/1e014690-8651-4b4b-bc7b-28748abfa61f
https://research.tue.nl/nl/publications/1e014690-8651-4b4b-bc7b-28748abfa61f