TY - JOUR
T1 - Off-line dynamic maintenance of the width of a planar point set
AU - Agarwal, Pankaj K.
AU - Sharir, Micha
N1 - Funding Information:
* A preliminary version of this paper has appeared in Second Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 449-458. ** Supported by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), an NSF Science and Technology Center, under Grant STC-8809648. *** Supported by the Office of Naval Research under Grants, NOOO14-89-J-3042 and NOOO14-90-J-1284, by the National Science Foundation under Grant CCR-89-01484, by DIMACS, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.
PY - 1991/9
Y1 - 1991/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026272825&partnerID=8YFLogxK
U2 - 10.1016/0925-7721(91)90001-U
DO - 10.1016/0925-7721(91)90001-U
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0026272825
VL - 1
SP - 65
EP - 78
JO - Computational Geometry: Theory and Applications
JF - Computational Geometry: Theory and Applications
SN - 0925-7721
IS - 2
ER -