Parametric and kinetic minimum spanning trees
Pankaj Kumar Agarwal,
David Eppstein,
Leonidas J. Guibas,
and Monika Rauch Henzinger
Proc. 39th Symp. Foundations of Computer Science, IEEE, Nov 1998, pp. 596–605
http://www.ics.uci.edu/~eppstein/pubs/AgaEppGui-FOCS-98.pdf
Cited by:
- On levels in arrangements of curves
- Notes on computing peaks in $k$-levels and parametric spanning trees
- Soft kinetic data structures
- Sensing, tracking, and reasoning with relations
- Approximate shape fitting via linearization
- Kinetic Maintenance of Proximity Structures
- Kinetic minimum-power routing and clustering in mobile ad-hoc networks
- Kinetic Data Structures for Collision Detection
- Finding the shortest bottleneck edge in a parametric minimum spanning tree
