Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Dynamic point location in general subdivisions

Baumgarten, Hanna and Jung, Hermann and Mehlhorn, Kurt

MPI-I-92-126. April 1992, 30 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
The {\em dynamic planar point location problem} is the
task of maintaining a dynamic set $S$ of $n$ non-intersecting, except
possibly at endpoints, line segments in the plane
under the following operations:

\item Locate($q$: point): Report the
segment immediately above $q$, i.e., the first segment
intersected by an upward vertical ray starting at
\item Insert($s$: segment): Add segment $s$ to the collection
$S$ of segments;
\item Delete($s$: segment): Remove segment $s$ from the
collection $S$ of segments.
We present a solution which requires space $O(n)$,
has query and insertion time and deletion time. A query time
was previously only known for monotone subdivisions and horizontal segments and required non-linear space.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-126.pdfMPI-I-92-126.pdf9054 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Baumgarten, Hanna and Jung, Hermann and Mehlhorn, Kurt},
  TITLE = {Dynamic point location in general subdivisions},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-126},
  MONTH = {April},
  YEAR = {1992},
  ISSN = {0946-011X},