M. Katchalski

activity

20082012

most citedUpper bounds for the piercing number of families of pairwise intersecting convex polygons

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.MG2012★ 2 cited

Upper bounds for the piercing number of families of pairwise intersecting convex polygons

Meir Katchalski, David Nashtir

A convex polygon $A$ is related to a convex $m$ -gon $K = ⋂_{i = 1}^{m} k_{i}^{+}$ , where $k_{1}^{+}, ..., k_{m}^{+}$ are the $m$ halfplanes whose intersection is equal to $K$ , if $A$ is the in…

math.CO2011

No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing

Meir Katchalski, Eliahu Levy

The complexity of two related geometrical (indeed, combinatorial) problems is considered, measured by the number of queries needed to determine the solution. It is proved that one…

math.GT2008

The existence of thick triangulations -- an "elementary" proof

Emil Saucan, Meir Katchalski

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $C^{1}$ manifolds. Moreover, this proof is simpler than the original one gi…