# Discrete & Computational Geometry

## List of Papers (Total 71)

#### Computing the Fréchet Distance with a Retractable Leash

All known algorithms for the Fréchet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values. We present a novel approach that avoids the detour through the decision version. This gives the first quadratic time algorithm for the Fréchet ...

#### Coloring Intersection Graphs of Arc-Connected Sets in the Plane

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line $L$ if the intersection of any member with $L$ is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their ...