de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Dynamic maintenance of 2-d convex hulls and order decomposable problems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44728

Kapoor,  Sanjiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-95-1-015.pdf
(Any fulltext), 15MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Kapoor, S.(1995). Dynamic maintenance of 2-d convex hulls and order decomposable problems (MPI-I-1995-1-015). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B6D6-1
Abstract
In this paper, we consider dynamic data structures for order decomposable problems. This class of problems include the convex hull problem, the Voronoi diagram problem, the maxima problem, and intersection of halfspaces. This paper first describes a scheme for maintaining convex hulls in the plane dynamically in $O(\log n)$ amortized time for insertions and $O(\log^2 n)$ time for deletions. $O(n)$ space is used. The scheme improves on the time complexity of the general scheme by Overmars and Van Leeuwen. We then consider the general class of Order Decomposable Problems. We show improved behavior for insertions in the presence of deletions, under some assumptions. The main assumption we make is that the problems are required to be {\em change sensitive}, i.e., updates to the solution of the problem at an insertion can be obtained in time proportional to the changes.