TY - JOUR

T1 - Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications

AU - Agarwal, Pankaj K.

AU - Efrat, Alon

AU - Sharir, Micha

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 1999/12

Y1 - 1999/12

N2 - Let F be a collection of n bivariate algebraic functions of constant maximum degree. We show that the combinatorial complexity of the vertical decomposition of the (≤k)-level of the arrangement A(F) is O(k3+ε ψ(n/k)) for any ε > 0, where ψ(r) is the maximum complexity of the lower envelope of a subset of at most r functions of F. This bound is nearly optimal in the worst case and implies the existence of shallow cuttings, in the sense of [J. Matousek, Comput. Geom., 2 (1992), pp. 169-186], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including (i) data structures for several generalized 3-dimensional range-searching problems; (ii) dynamic data structures for planar nearest- and farthest-neighbor searching under various fairly general distance functions; (iii) an improved (near-quadratic) algorithm for minimum-weight bipartite Euclidean matching in the plane; and (iv) efficient algorithms for certain geometric optimization problems in static and dynamic settings.

AB - Let F be a collection of n bivariate algebraic functions of constant maximum degree. We show that the combinatorial complexity of the vertical decomposition of the (≤k)-level of the arrangement A(F) is O(k3+ε ψ(n/k)) for any ε > 0, where ψ(r) is the maximum complexity of the lower envelope of a subset of at most r functions of F. This bound is nearly optimal in the worst case and implies the existence of shallow cuttings, in the sense of [J. Matousek, Comput. Geom., 2 (1992), pp. 169-186], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including (i) data structures for several generalized 3-dimensional range-searching problems; (ii) dynamic data structures for planar nearest- and farthest-neighbor searching under various fairly general distance functions; (iii) an improved (near-quadratic) algorithm for minimum-weight bipartite Euclidean matching in the plane; and (iv) efficient algorithms for certain geometric optimization problems in static and dynamic settings.

UR - http://www.scopus.com/inward/record.url?scp=0033296344&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033296344&partnerID=8YFLogxK

U2 - 10.1137/s0097539795295936

DO - 10.1137/s0097539795295936

M3 - Article

AN - SCOPUS:0033296344

VL - 29

SP - 912

EP - 953

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -