Incremental and decremental maintenance of planar width

Authors:
David Eppstein
Affiliations:
Department of Information and Computer Science, University of California Irvine, CA
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Computational geometry: an introduction

Computational geometry: an introduction
Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
Off-line dynamic maintenance of the width of a planar point set

Computational Geometry: Theory and Applications
Average case analysis of dynamic geometric optimization

Computational Geometry: Theory and Applications
Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions

Proceedings of the fourteenth annual symposium on Computational geometry
Fast hierarchical clustering and other applications of dynamic closest pairs

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Maintaining the Extent of a Moving Point Set

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

Self-adjusting computation with Delta ML

AFP'08 Proceedings of the 6th international conference on Advanced functional programming

Hi-index	0.00