Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Schymura, Daria"'
Autor:
Barát, János, Dujmović, Vida, Joret, Gwenaël, Payne, Michael S., Scharf, Ludmila, Schymura, Daria, Valtr, Pavel, Wood, David R.
Publikováno v:
SIAM J. Discrete Math. 29-1 (2015), pp. 198-209
An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite set of at least 328k^2 points in the plane contains an empty pentagon o
Externí odkaz:
http://arxiv.org/abs/1207.3633
Autor:
Schymura, Daria
Let A be a bounded subset of IR^d. We give an upper bound on the volume of the symmetric difference of A and f(A) where f is a translation, a rotation, or the composition of both, a rigid motion. The volume is measured by the d-dimensional Hausdorff
Externí odkaz:
http://arxiv.org/abs/1010.2446
Autor:
Demaine, Erik D., Fekete, Sandor P., Rote, Guenter, Schweer, Nils, Schymura, Daria, Zelke, Mariano
Publikováno v:
Computational Geometry, Theory and Applications 44 (2011), 82-94
An n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings along the axis-parallel street grid, then an n-town has optimal shape i
Externí odkaz:
http://arxiv.org/abs/1009.5628
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high probability
Externí odkaz:
http://arxiv.org/abs/0902.4337
Autor:
Demaine, Erik D., Fekete, Sándor P., Rote, Günter, Schweer, Nils, Schymura, Daria, Zelke, Mariano
Publikováno v:
In Computational Geometry: Theory and Applications 2011 44(2):82-94
Publikováno v:
In Computational Geometry: Theory and Applications 2010 43(2):99-114
Autor:
Schymura, Daria
Determining the similarity between objects is a fundamental problem in computer vision and pattern recognition, but also in other fields of computer science. This thesis concentrates on the matching problem, which has received a lot of attention in C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4732::203672878570b04c1dcd5037c8febc2e
https://doi.org/10.17169/refubium-10247
https://doi.org/10.17169/refubium-10247
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.
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.
Publikováno v:
Experimental Algorithms (9783642020100); 2009, p101-112, 12p