DC Field | Value | Language |
---|---|---|
dc.contributor.author | Agarwal, PK | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Sharir, M | ko |
dc.date.accessioned | 2013-02-27T12:58:24Z | - |
dc.date.available | 2013-02-27T12:58:24Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1996-01 | - |
dc.identifier.citation | DISCRETE COMPUTATIONAL GEOMETRY, v.15, no.1, pp.1 - 13 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.uri | http://hdl.handle.net/10203/68715 | - |
dc.description.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+epsilon)), for any epsilon > 0. This result has several applications: (i) a near-quadratic upper bound on the complexity of the region in S-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 three dimensions. | - |
dc.language | English | - |
dc.publisher | SPRINGER VERLAG | - |
dc.subject | DAVENPORT-SCHINZEL SEQUENCES | - |
dc.subject | COMPUTATIONAL GEOMETRY | - |
dc.subject | ARRANGEMENTS | - |
dc.subject | BOUNDS | - |
dc.subject | CURVES | - |
dc.subject | SETS | - |
dc.title | The overlay of lower envelopes and its applications | - |
dc.type | Article | - |
dc.identifier.wosid | A1996TM42200001 | - |
dc.identifier.scopusid | 2-s2.0-0030539976 | - |
dc.type.rims | ART | - |
dc.citation.volume | 15 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 1 | - |
dc.citation.endingpage | 13 | - |
dc.citation.publicationname | DISCRETE COMPUTATIONAL GEOMETRY | - |
dc.identifier.doi | 10.1007/BF02716576 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Agarwal, PK | - |
dc.contributor.nonIdAuthor | Sharir, M | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | DAVENPORT-SCHINZEL SEQUENCES | - |
dc.subject.keywordPlus | COMPUTATIONAL GEOMETRY | - |
dc.subject.keywordPlus | ARRANGEMENTS | - |
dc.subject.keywordPlus | BOUNDS | - |
dc.subject.keywordPlus | CURVES | - |
dc.subject.keywordPlus | SETS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.