Union-copy structures and dynamic segment trees

DOI10.1145/174130.174140zbMath0785.68018OpenAlexW2114984472MaRDI QIDQ3140020

Marc J. van Kreveld, Mark H. Overmars

Publication date: 6 December 1993

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17931

zbMATH Keywords

dynamic segment treesunion-copy structureunion-find structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (8)

Memory management for Union-Find algorithms ⋮ ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ The relative worst-order ratio applied to paging ⋮ Minimum ply covering of points with unit squares ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects ⋮ Evaluation of Labeling Strategies for Rotating Maps

This page was built for publication: Union-copy structures and dynamic segment trees