Dynamic Euclidean minimum spanning trees and extrema of binary functions
- 1 January 1995
- journal article
- Published by Springer Science and Business Media LLC in Discrete & Computational Geometry
- Vol. 13 (1), 111-122
- https://doi.org/10.1007/bf02574030
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Offline algorithms for dynamic minimum spanning tree problemsPublished by Springer Science and Business Media LLC ,2005
- Off-line dynamic maintenance of the width of a planar point setComputational Geometry, 1991
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- Maintenance of geometric extremaJournal of the ACM, 1991
- Geometry Helps in MatchingSIAM Journal on Computing, 1989
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Adding range restriction capability to dynamic data structuresJournal of the ACM, 1985
- A data structure for dynamic range queriesInformation Processing Letters, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980