A fully dynamic algorithm for planar width

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A fully dynamic algorithm was developed to maintain the width of a set of n planar points. The points were subjected to insertions and deletions in amortized time per update. The decremental algorithm was used to obtain sublinear time bound for the dynamic width problems in the plane.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages172-176
Number of pages5
StatePublished - Jan 1 2001
Externally publishedYes
Event17th Annual Symposium on Computational Geometry (SCG'01) - Medford, MA, United States
Duration: Jun 3 2001Jun 5 2001

Other

Other17th Annual Symposium on Computational Geometry (SCG'01)
Country/TerritoryUnited States
CityMedford, MA
Period6/3/016/5/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'A fully dynamic algorithm for planar width'. Together they form a unique fingerprint.

Cite this