Skip to main content
Article thumbnail
Location of Repository

Geometry © 1996 Springer-Verlag New York Inc. The Overlay of Lower Envelopes and Its Applications ∗

By P. K. Agarwal, O. Schwarzkopf and M. Sharir

Abstract

Abstract. Let F and G be two collections of a total of n (possibly partially defined) bivariate, algebraic functions of constant maximum degree. The minimization diagrams of F, G are the planar maps obtained by the xy-projections of the lower envelopes of F, G, respectively. We show that the combinatorial complexity of the overlay of the minimization diagrams of F and of G is O(n 2+ε), for any ε>0. This result has several applications: (i) a near-quadratic upper bound on the complexity of the region in 3-space enclosed between the lower envelope of one such collection of functions and the upper envelope of another collection; (ii) an efficient and simple divide-and-conquer algorithm for constructing lower envelopes in three dimensions; and (iii) a near-quadratic upper bound on the complexity of the space of all plane transversals of a collection of simply shaped convex sets in thre

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.341
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://biogeometry.duke.edu/pu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.