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

Pankaj K. Agarwal, Alon Efrat, Micha Sharir

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

22 Citations (Scopus)

Abstract

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 result implies the existence of shallow cuttings, in the sense of [3, 31], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including: (i) data structures for several generalized three-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.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995
PublisherAssociation for Computing Machinery
Pages39-50
Number of pages12
VolumePart F129372
ISBN (Electronic)0897917243
DOIs
StatePublished - Sep 1 1995
Externally publishedYes
Event11th Annual Symposium on Computational Geometry, SCG 1995 - Vancouver, Canada
Duration: Jun 5 1995Jun 7 1995

Other

Other11th Annual Symposium on Computational Geometry, SCG 1995
CountryCanada
CityVancouver
Period6/5/956/7/95

Fingerprint

Algebraic function
Arrangement
Vertical
Lower Envelopes
Range Searching
Geometric Optimization
Dynamic Data Structures
Decomposition
Combinatorial Complexity
Decompose
Distance Function
Maximum Degree
Data structures
Euclidean
Data Structures
Efficient Algorithms
Optimization Problem
Imply
Three-dimensional
Subset

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Cite this

Agarwal, P. K., Efrat, A., & Sharir, M. (1995). Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995 (Vol. Part F129372, pp. 39-50). Association for Computing Machinery. https://doi.org/10.1145/220279.220284

Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. / Agarwal, Pankaj K.; Efrat, Alon; Sharir, Micha.

Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995. Vol. Part F129372 Association for Computing Machinery, 1995. p. 39-50.

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

Agarwal, PK, Efrat, A & Sharir, M 1995, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. in Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995. vol. Part F129372, Association for Computing Machinery, pp. 39-50, 11th Annual Symposium on Computational Geometry, SCG 1995, Vancouver, Canada, 6/5/95. https://doi.org/10.1145/220279.220284
Agarwal PK, Efrat A, Sharir M. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995. Vol. Part F129372. Association for Computing Machinery. 1995. p. 39-50 https://doi.org/10.1145/220279.220284
Agarwal, Pankaj K. ; Efrat, Alon ; Sharir, Micha. / Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995. Vol. Part F129372 Association for Computing Machinery, 1995. pp. 39-50
@inproceedings{cd0840ba9ab94758a560f36f24898623,
title = "Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications",
abstract = "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 result implies the existence of shallow cuttings, in the sense of [3, 31], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including: (i) data structures for several generalized three-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.",
author = "Agarwal, {Pankaj K.} and Alon Efrat and Micha Sharir",
year = "1995",
month = "9",
day = "1",
doi = "10.1145/220279.220284",
language = "English (US)",
volume = "Part F129372",
pages = "39--50",
booktitle = "Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995",
publisher = "Association for Computing Machinery",

}

TY - GEN

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

AU - Agarwal, Pankaj K.

AU - Efrat, Alon

AU - Sharir, Micha

PY - 1995/9/1

Y1 - 1995/9/1

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 result implies the existence of shallow cuttings, in the sense of [3, 31], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including: (i) data structures for several generalized three-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 result implies the existence of shallow cuttings, in the sense of [3, 31], of small size in arrangements of bivariate algebraic functions. We also present numerous applications of these results, including: (i) data structures for several generalized three-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=84958016763&partnerID=8YFLogxK

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

U2 - 10.1145/220279.220284

DO - 10.1145/220279.220284

M3 - Conference contribution

AN - SCOPUS:84958016763

VL - Part F129372

SP - 39

EP - 50

BT - Proceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995

PB - Association for Computing Machinery

ER -