Off-line dynamic maintenance of the width of a planar point set

Pankaj K. Agarwal, Micha Sharir

Research output: Contribution to journalArticlepeer-review

Abstract

Agarwal, P.K. and M. Sharir, Off-line dynamic maintenance of the width of a planar point set, Computational Geometry: Theory and Applications 1 (1990) 65-78. In this paper we present an efficient algorithm for the off-line dynamic maintenance of the width of a planar point set in the following restricted case: We are given a real parameter W and a sequence Σ=(σ1,...,σn) of n insert and delete operations on a set S of points in R2, initially consisting of n points, and we want to determine whether there is an i such that the width of S the ith operation is less than or equal to W. Our algorithm runs in time O(nlog3n) and uses O(n) space.

Original languageEnglish
Pages (from-to)65-78
Number of pages14
JournalComputational Geometry: Theory and Applications
Volume1
Issue number2
DOIs
StatePublished - Sep 1991

Fingerprint

Dive into the research topics of 'Off-line dynamic maintenance of the width of a planar point set'. Together they form a unique fingerprint.

Cite this