Dynamization of order decomposable set problems
From MaRDI portal
Publication:3929067
DOI10.1016/0196-6774(81)90025-0zbMath0474.68083MaRDI QIDQ3929067
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/15910
Related Items
Algorithms for deciding the containment of polygons, The one-dimensional weighted Voronoi diagram, Worst-case optimal insertion and deletion methods for decomposable searching problems, Stabbing line segments, On the dynamic maintenance of maximal points in the plane, Maintaining the minimal distance of a point set in polylogarithmic time, Efficient splitting and merging algorithms for order decomposable problems.