Fast maintenance of rectilinear centers

Sergei Bespamyatnikh, Michael Segal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We address the problem of dynamic maintenance of 2-centers in the plane under rectilinear metric.We present two algorithms for the continuous and discrete ver- sions of the problem. We show that rectilinear 2-centers can be maintained in O(log2 n) time. We give an algorithm for semi-dynamic (either insertions only or deletions only) maintenance of the discrete 2-centers in O(log n logm) amortized time where n is the number of customer points and m is the number of possible locations of centers.

Original languageEnglish
Title of host publicationComputational Science - ICCS 2001 - International Conference, 2001, Proceedings
EditorsVassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, René S. Renner, C.J. Kenneth Tan
PublisherSpringer Verlag
Pages633-639
Number of pages7
ISBN (Print)3540422323, 9783540422327
DOIs
StatePublished - 1 Jan 2001
EventInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
Duration: 28 May 200130 May 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2073
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Computational Science, ICCS 2001
Country/TerritoryUnited States
CitySan Francisco
Period28/05/0130/05/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Fast maintenance of rectilinear centers'. Together they form a unique fingerprint.

Cite this