Concatenable segment trees (extended abstract)

DOI10.1007/BFB0029010MaRDI QIDQ5096181zbMATH OpenOpenAlexFDO

Authors Marc Van Kreveld, Mark H. Overmars

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0029010

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Union-copy structures and dynamic segment trees
• Divided \(k-d\) trees
• Concatenable structures for decomposable problems
• Data structures for mergeable trees
• Efficient splitting and merging algorithms for order decomposable problems.

Cites work

• Decomposable searching problems
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• The design of dynamic data structures

Cited in

(7)

• Concatenable structures for decomposable problems
• Translating a regular grid over a point set
• Union-copy structures and dynamic segment trees
• Mergeable dictionaries
• Efficient splitting and merging algorithms for order decomposable problems
• scientific article; zbMATH DE number 1874367 (Why is no real title available?)
• scientific article; zbMATH DE number 827974 (Why is no real title available?)

This page was built for publication: Concatenable segment trees (extended abstract)

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