Union-copy structures and dynamic segment trees

DOI10.1145/174130.174140MaRDI QIDQ3140020zbMATH OpenOpenAlexFDO

Authors Marc 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

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

Recommendations

• Concatenable segment trees (extended abstract)
• Direct dynamic structures for some line segment problems
• Data structures for mergeable trees
• On the dynamization of data structures
• A Data Structure for Dynamically Maintaining Rooted Trees

Cited in

(11)

• Efficient splitting and merging algorithms for order decomposable problems.
• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
• Efficient splitting and merging algorithms for order decomposable problems
• scientific article; zbMATH DE number 827974 (Why is no real title available?)
• Memory management for union-find algorithms
• Concatenable segment trees (extended abstract)
• Evaluation of labeling strategies for rotating maps
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• Minimum ply covering of points with unit squares
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks
• The relative worst-order ratio applied to paging

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140020)