DC Field | Value | Language |
---|---|---|
dc.contributor.author | Efrat, A | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.date.accessioned | 2007-05-25T01:02:38Z | - |
dc.date.available | 2007-05-25T01:02:38Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1997-12 | - |
dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.64, no.6, pp.309 - 314 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | http://hdl.handle.net/10203/324 | - |
dc.description.abstract | A line l is called a separator for a set S of objects in the plane if l avoids all the objects and partitions S into two non-empty subsets, lying on both sides of l. A set L of Lines is said to shatter S if each line of L is a separator for S, and every two objects of S are separated by at least one line of L. We give a simple randomized algorithm to construct the set of ail separators for a given set S of n line segments in expected time O(n log n), provided the ratio between the diameter of S and the length of the shortest line segment is bounded by a constant. We also give a randomized algorithm to determine a set of lines shattering S, whose expected running time is O(n log n), improving (for this setting) the (deterministic) O(n(2) log n) time algorithm of Freimer, Mitchell and Piatko. (C) 1997 Published by Elsevier Science B.V. | - |
dc.description.sponsorship | Work on paper by the second author has been supported by the Netherlands' Organization for Scientific Research (NWO), by Pohang University of Science and Technology Grant 96F004, 1996, and partially by the nondirected research fund of the Korean Ministry of Education. | en |
dc.language | English | - |
dc.language.iso | en | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | COMPUTATIONAL GEOMETRY | - |
dc.title | Separating and shattering long line segments | - |
dc.type | Article | - |
dc.identifier.wosid | 000072118900008 | - |
dc.identifier.scopusid | 2-s2.0-0042634021 | - |
dc.type.rims | ART | - |
dc.citation.volume | 64 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 309 | - |
dc.citation.endingpage | 314 | - |
dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
dc.identifier.doi | 10.1016/S0020-0190(97)00188-9 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Efrat, A | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | computational geometry | - |
dc.subject.keywordAuthor | BSP-trees | - |
dc.subject.keywordAuthor | line separation | - |
dc.subject.keywordPlus | COMPUTATIONAL GEOMETRY | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.