# Tightness and computing distances in the curve complex

@article{Shackleton2004TightnessAC, title={Tightness and computing distances in the curve complex}, author={Kenneth J. Shackleton}, journal={Geometriae Dedicata}, year={2004}, volume={160}, pages={243-259} }

We address the lack of local-finiteness in Harvey’s curve complex by computational means, computing bounds on certain intersection numbers among curves lying on a natural family of geodesics. We give a finite time algorithm for constructing all of these geodesics between any two curves, and treat stable lengths.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 20 CITATIONS

## The geometry of the disk complex

VIEW 2 EXCERPTS

## Efficient geodesics and an effective algorithm for distance in the complex of curves

VIEW 7 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED