Dynamization of order decomposable set problems

DOI10.1016/0196-6774(81)90025-0zbMath0474.68083OpenAlexW2160549424MaRDI QIDQ3929067

Mark H. Overmars

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

zbMATH Keywords

Voronoi diagramconvex hullsdivide-and-conquerorder decomposable set problems

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (8)

Efficient splitting and merging algorithms for order decomposable problems ⋮ Worst-case optimal insertion and deletion methods for decomposable searching problems ⋮ Stabbing line segments ⋮ On the dynamic maintenance of maximal points in the plane ⋮ Algorithms for deciding the containment of polygons ⋮ Maintaining the minimal distance of a point set in polylogarithmic time ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ The one-dimensional weighted Voronoi diagram

This page was built for publication: Dynamization of order decomposable set problems