DC Field | Value | Language |
---|---|---|
dc.contributor.author | deBerg, M | ko |
dc.contributor.author | vanKreveld, M | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Snoeyink, J | ko |
dc.date.accessioned | 2013-03-03T03:35:40Z | - |
dc.date.available | 2013-03-03T03:35:40Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1996-06 | - |
dc.identifier.citation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.6, no.3, pp.131 - 143 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | http://hdl.handle.net/10203/77035 | - |
dc.description.abstract | Let A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensional affine subspace of d-space. The zone of a k-flat f with respect to H is the set of all faces in A(H) that intersect f. In this paper we study some problems on zones of k-flats. Our most important result is a data structure for point location in the zone of a k-flat. This structure uses O(n([d/2]+epsilon) + n(k+epsilon)) preprocessing time and space and has a query time of O(log(2) n). We also show how to test efficiently whether two flats are visible from each other with respect to a set of hyperplanes. Then point location in m faces in arrangements is studied. Our data structure for this problem has size O(n([d/2)]+epsilon) m([d/2]/d)) and the query time is O(log(2) n). | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | HYPERPLANE ARRANGEMENTS | - |
dc.subject | LINEAR-TIME | - |
dc.subject | ALGORITHMS | - |
dc.subject | QUERIES | - |
dc.subject | HULLS | - |
dc.title | Point location in zones of k-flats in arrangements | - |
dc.type | Article | - |
dc.identifier.wosid | A1996UQ78000001 | - |
dc.identifier.scopusid | 2-s2.0-30244484962 | - |
dc.type.rims | ART | - |
dc.citation.volume | 6 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 131 | - |
dc.citation.endingpage | 143 | - |
dc.citation.publicationname | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.identifier.doi | 10.1016/0925-7721(95)00021-6 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | deBerg, M | - |
dc.contributor.nonIdAuthor | vanKreveld, M | - |
dc.contributor.nonIdAuthor | Snoeyink, J | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | arrangements | - |
dc.subject.keywordAuthor | zones | - |
dc.subject.keywordAuthor | k-flats | - |
dc.subject.keywordAuthor | implicit point location | - |
dc.subject.keywordAuthor | multidimensional parametric search | - |
dc.subject.keywordPlus | HYPERPLANE ARRANGEMENTS | - |
dc.subject.keywordPlus | LINEAR-TIME | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | QUERIES | - |
dc.subject.keywordPlus | HULLS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.