Off-line dynamic maintenance of the width of a planar point set
- 30 September 1991
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 1 (2), 65-78
- https://doi.org/10.1016/0925-7721(91)90001-u
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Off-Line Maintenance of Planar ConfigurationsJournal of Algorithms, 1996
- Planar geometric location problemsAlgorithmica, 1994
- A new approach to the dynamic maintenance of maximal points in a planeDiscrete & Computational Geometry, 1990
- Dynamically computing the maxima of decomposable functions, with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Computating the width of a setPublished by Association for Computing Machinery (ACM) ,1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981