Dynamization of order decomposable set problems

DOI10.1016/0196-6774(81)90025-0MaRDI QIDQ3929067zbMATH OpenOpenAlexFDO

Authors 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

convex hullsdivide-and-conquerorder decomposable set problemsVoronoi diagram

Mathematics Subject Classification ID

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

Cited in

(9)

• 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.
• Efficient splitting and merging algorithms for order decomposable problems
• Algorithms for deciding the containment of polygons
• A parallel batch-dynamic data structure for the closest pair problem

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

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