DC Field | Value | Language |
---|---|---|
dc.contributor.author | DEBERG, M | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.date.accessioned | 2008-12-19T07:25:35Z | - |
dc.date.available | 2008-12-19T07:25:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1995-12 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS, v.5, no.4, pp.343 - 355 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/8141 | - |
dc.description.abstract | We prove a general lemma on the existence of (1/r)-cutting of geometric objects in E(d) that satisfy certain properties. We use this lemma to construct (1/r)-cuttings of small size for arrangements of line segments in the plane and arrangements of triangles in 3-space; for line segments in the plane we obtain a cutting of size O(r+Ar-2/n(2)), and for triangles in 3-space our cutting has size O(r(2+e)+Ar-3/n(3)). Here A is the combinatorial complexity of the arrangement. Finally, we use these results to obtain new results for several problems concerning line segments in the plane and triangles in 3-space. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.subject | PARTITIONING ARRANGEMENTS | - |
dc.subject | COMPUTATIONAL GEOMETRY | - |
dc.subject | EPSILON-NETS | - |
dc.subject | ALGORITHM | - |
dc.subject | LINES | - |
dc.subject | SEGMENTS | - |
dc.subject | QUERIES | - |
dc.title | CUTTINGS AND APPLICATIONS | - |
dc.type | Article | - |
dc.identifier.wosid | A1995TG50100001 | - |
dc.type.rims | ART | - |
dc.citation.volume | 5 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 343 | - |
dc.citation.endingpage | 355 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY APPLICATIONS | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | DEBERG, M | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | CUTTINGS | - |
dc.subject.keywordAuthor | RANDOM SAMPLING | - |
dc.subject.keywordAuthor | SEGMENT INTERSECTION COUNTING | - |
dc.subject.keywordAuthor | HOPCROFTS PROBLEM | - |
dc.subject.keywordAuthor | POINT LOCATION | - |
dc.subject.keywordPlus | PARTITIONING ARRANGEMENTS | - |
dc.subject.keywordPlus | COMPUTATIONAL GEOMETRY | - |
dc.subject.keywordPlus | EPSILON-NETS | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | LINES | - |
dc.subject.keywordPlus | SEGMENTS | - |
dc.subject.keywordPlus | QUERIES | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.