max planck institut
informatik

# MPI-I-92-153

## Semi-dynamic maintenance of the width of a planar point set

### Schwarz, Christian

MPI-I-92-153. December 1992, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We give an algorithm that maintains an approximation of the width of a
set of $n$ points in the plane in $O(\alpha\log n)$ amortized
time, if only insertions or only deletions are performed.
The data structure allows for reporting the approximation in
$O(\alpha\log n\log\log n)$ time.
$\alpha$ is a parameter that expresses the quality of the approximation.
Our data structure is based on a method of Janardan that maintains an
approximation of the width under insertions and deletions using
$O(\alpha\log^2 n)$ time for the width query and the updates.
Acknowledgement:
References to related material:

MPI-I-92-153.pdf13163 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: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-153
BibTeX
@TECHREPORT{Schwarz92,
AUTHOR = {Schwarz, Christian},
TITLE = {Semi-dynamic maintenance of the width of a planar point set},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},