Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21220Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | KUIJPERS, Bart | - |
| dc.contributor.author | Revesz, Peter Z. | - |
| dc.date.accessioned | 2016-05-23T09:44:41Z | - |
| dc.date.available | 2016-05-23T09:44:41Z | - |
| dc.date.issued | 2015 | - |
| dc.identifier.uri | http://hdl.handle.net/1942/21220 | - |
| dc.description.abstract | A basic question in computational geometry is to find the relationship between a set of points and a line in the real plane. In this paper, we present multidimensional data structures for N points that allow answering in O(log N + k) time the following queries: (1) Given an input line, estimate the number of points below the line, (2) Given an input line, return the k ≤ N points that are below the line, and (3) Given an input line, return the point that is closest to the line. | - |
| dc.language.iso | en | - |
| dc.subject.other | point location queries; nearest point queries; selectivity estimation | - |
| dc.title | A Data Structure to Efficiently Answer Point Location Queries with Respect to a Line | - |
| dc.type | Research Report | - |
| local.format.pages | 12 | - |
| local.bibliographicCitation.jcat | R2 | - |
| dc.description.notes | Preprint submitted to Elsevier Science | - |
| local.type.refereed | Refereed | - |
| local.type.specified | Research Report | - |
| item.fullcitation | KUIJPERS, Bart & Revesz, Peter Z. (2015) A Data Structure to Efficiently Answer Point Location Queries with Respect to a Line. | - |
| item.contributor | KUIJPERS, Bart | - |
| item.contributor | Revesz, Peter Z. | - |
| item.fulltext | With Fulltext | - |
| item.accessRights | Closed Access | - |
| Appears in Collections: | Research publications | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.