M. J. Katz

activity

20112023

most citedA PTAS for vertex guarding weakly-visible polygons - An extended abstract

5 citations · 11 across the 16 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.CG2022

Bottleneck Matching in the Plane

Matthew J. Katz, Micha Sharir

We present an algorithm for computing a bottleneck matching in a set of $n = 2 ℓ$ points in the plane, which runs in $O (n^{ω /2} lo g n)$ deterministic time, where $ω \approx 2.37$ is…

cs.CG2022

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems

Pankaj K. Agarwal, Boris Aronov, Esther Ezra +2

Let $T$ be a set of $n$ flat (planar) semi-algebraic regions in $R^{3}$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preproces…