Concatenable structures for decomposable problems

DOI10.1006/inco.1994.1027zbMath0804.68029OpenAlexW1545783206MaRDI QIDQ1322468

Mark H. Overmars, Marc J. van Kreveld

Publication date: 9 June 1994

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

orderingconvex hullsearchingsplitsdata structureconcatenationsorder decomposable set problems

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Efficient splitting and merging algorithms for order decomposable problems, Divided \(k-d\) trees, Space efficient dynamic orthogonal range reporting, Efficient splitting and merging algorithms for order decomposable problems.