Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Itay Ben-Dan"'
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
Publikováno v:
Journal of Combinatorial Theory, Series A. 116:747-755
We show that for every @e>0 there exists an angle @[email protected](@e) between 0 and @p, depending only on @e, with the following two properties: (1) For any continuous probability measure in the plane one can find two lines @?"1 and @?"2, crossing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::962279d2d647763c5a0781c4d1c82c54
https://doi.org/10.1016/j.jcta.2008.10.003
https://doi.org/10.1016/j.jcta.2008.10.003
Publikováno v:
Symposium on Computational Geometry
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 the extremal version of this problem. A pair (a, b) of numbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8bd6093c2e8728fdfdf4365559bd480
https://doi.org/10.1145/1810959.1811018
https://doi.org/10.1145/1810959.1811018
Autor:
Itay Ben-dan, Elior Shenhav
Publikováno v:
The MIDAS Journal.
Liver tumors segmentation is an important prerequisite for planning of surgical interventions. For clinical applicability, the segmentation approach must be able to cope with the high variation in shape and gray-value appearance of the liver. We pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66299a3a0883035ac0a118803ca5bc4b
https://doi.org/10.54294/khebj7
https://doi.org/10.54294/khebj7
Publikováno v:
Computational Geometry. (6-7):587-592
Let P be a set of n points in general position in the plane. For every x∈P let D(x,P) be the maximum number such that there are at least D(x,P) points of P in each of two opposite quadrants determined by some two perpendicular lines through x. Defi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68743e366f90bd1c1eca430aac7ea89b
Autor:
Apfelbaum, Roel1 roel6@hotmail.com, Ben-Dan, Itay2 itaybd@gmail.com, Felsner, Stefan3 felsner@math.tu-berlin.de, Miltzow, Tillmann4 t.miltzow@googlemail.com, Pinchasi, Rom2 room@math.technion.ac.il, Ueckerdt, Torsten3 ueckerdt@math.tu-berlin.de, Ziv, Ran5 ranziv@telhai.ac.il
Publikováno v:
Journal of Computational Geometry. Jun2011, Vol. 2 Issue 1, p128-143. 16p.
Publikováno v:
Proceedings of the 2010 Annual Symposium: Computational Geometry; 6/13/2010, p358-364, 7p