Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Rom Pinchasi"'
Publikováno v:
Discrete Mathematics Letters, Vol 7, Pp 79-85 (2021)
Externí odkaz:
https://doaj.org/article/974879ec015b4b2fb31bae93566e3603
Publikováno v:
Journal of Computational Geometry, Vol 4, Iss 1 (2013)
Erdős conjectured in 1946 that every $n$-point set $P$ in convex position in the plane contains a point that determines at least $\lfloor n/2\rfloor$ distinct distances to the other points of $P$. The best known lower bound due to Dumitrescu (2006)
Externí odkaz:
https://doaj.org/article/4b393c1bae7a4d0d846fbd0a7f562e32
Autor:
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv
Publikováno v:
Journal of Computational Geometry, Vol 2, Iss 1 (2011)
Given a set P of points in the plane we are interested in points that are `deep' in the set in the sense that they have two opposite quadrants both containing many points of P. We deal with an extremal version of this problem. A pair (a,b) of numbers
Externí odkaz:
https://doaj.org/article/e9a6181236124e7cb48d88d0ad14f9f8
Autor:
Mehdi Makhul, Rom Pinchasi
Publikováno v:
Studia Scientiarum Mathematicarum Hungarica. 59:196-208
Let P be a set of n points in general position in the plane. Let R be a set of points disjoint from P such that for every x, y € P the line through x and y contains a point in R. We show that if is contained in a cubic curve c in the plane, then P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae226b465b81d127db2f4e24949b9430
https://doi.org/10.1556/012.2022.01527
https://doi.org/10.1556/012.2022.01527
Autor:
Rom Pinchasi, Chaya Keller
Publikováno v:
Discrete & Computational Geometry. 64:905-915
Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$ and $y$. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::635073c1226d3bf74f1ea05d68053309
https://doi.org/10.1007/s00454-020-00201-3
https://doi.org/10.1007/s00454-020-00201-3
Publikováno v:
Journal of Graph Theory. 94:159-169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5421ee7dc41402aa99fe67458ba1a8a1
https://doi.org/10.1002/jgt.22512
https://doi.org/10.1002/jgt.22512
Autor:
Rom Pinchasi, Alexandr Polyanskii
Publikováno v:
Discrete & Computational Geometry. 64:382-385
The following theorem was conjectured by Erdős and Purdy: Let P be a set of $$n>4$$ points in general position in the plane. Suppose that R is a set of points disjoint from P such that every line determined by P passes through a point in R. Then $$|
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25e36dffe033974305f60c9cee9b2e88
https://doi.org/10.1007/s00454-019-00139-1
https://doi.org/10.1007/s00454-019-00139-1
Autor:
Rom Pinchasi
Publikováno v:
The American Mathematical Monthly. 125:164-168
Let n ⩾ 1 be an odd integer. For every 1 ⩽ i ⩽ n let si = (ai, bi) be an open unit segment on the real line. Let be fixed. Color by green all the points (numbers) on the real line of the fo...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5b808dbc52949d9289a80705dff9332
https://doi.org/10.1080/00029890.2018.1401833
https://doi.org/10.1080/00029890.2018.1401833
Publikováno v:
Computational Geometry. 92:101687
Let F be a family of pseudo-disks in the plane, and P be a finite subset of F . Consider the hyper-graph H ( P , F ) whose vertices are the pseudo-disks in P and the edges are all subsets of P of the form { D ∈ P | D ∩ S ≠ ∅ } , where S is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::916f3f0a2eadf7e392cb0d76d231513e
https://doi.org/10.1016/j.comgeo.2020.101687
https://doi.org/10.1016/j.comgeo.2020.101687
Publikováno v:
Discrete & Computational Geometry. 55:715-724
The main result in the paper is a construction of a simple (in fact, just a union of two squares) set T in the plane with the following property. For every $$\varepsilon >0$$?>0 there is a family $$\mathcal{F}$$F of an odd number of translates of T s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10dff016be6213693f8ff42657cbb797
https://doi.org/10.1007/s00454-016-9768-4
https://doi.org/10.1007/s00454-016-9768-4