Dynamic algorithms in computational geometry
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 80 (9) , 1412-1434
- https://doi.org/10.1109/5.163409
Abstract
No abstract availableThis publication has 100 references indexed in Scilit:
- Off-line dynamic maintenance of the width of a planar point setComputational Geometry, 1991
- Efficient dynamic algorithms for some geometric intersection problemsInformation Processing Letters, 1990
- Dynamic deferred data structuringInformation Processing Letters, 1990
- Hidden surface removal for rectanglesJournal of Computer and System Sciences, 1990
- General methods for adding range restrictions to decomposable searching problemsJournal of Symbolic Computation, 1989
- On the dynamization of data structuresBIT Numerical Mathematics, 1988
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Updating a balanced search tree in O(1) rotationsInformation Processing Letters, 1983
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980