Matthew J. Katz

activity

20122023

most citedBottleneck Non-Crossing Matching in the Plane

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

collaborators

4 papers

cs.CG2023

Spanners under the Hausdorff and Fréchet Distances

Tsuri Farhana, Matthew J. Katz

We initiate the study of spanners under the Hausdorff and Fréchet distances. We show that any $t$ -spanner of a planar point-set $S$ is a $\frac{t ^{2} - 1}{2}$ -Hausdorff-spanner…

cs.CG2023

Minimum-link $C$ -Oriented Paths Visiting a Sequence of Regions in the Plane

Kerem Geva, Matthew J. Katz, Joseph S. B. Mitchell +1

Let $E = {e_{1}, \dots, e_{n}}$ be a set of $C$ -oriented disjoint segments in the plane, where $C$ is a given finite set of orientations that spans the plane, and let $s$ and $t$ be two…

cs.CG2014

On the Chain Pair Simplification Problem

Chenglin Fan, Omrit Filtser, Matthew J. Katz +2

The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification…

cs.CG2012★ 1 cited

Bottleneck Non-Crossing Matching in the Plane

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz +1

Let $P$ be a set of $2 n$ points in the plane, and let $M_{C}$ (resp., $M_{NC}$ ) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$ . We study th…

Spanners under the Hausdorff and Fréchet Distances

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

On the Chain Pair Simplification Problem

Bottleneck Non-Crossing Matching in the Plane

Minimum-link $C$ -Oriented Paths Visiting a Sequence of Regions in the Plane