Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | David Phillip Wagner | - |
dc.date.accessioned | 2018-04-26T05:12:40Z | - |
dc.date.available | 2018-04-26T05:12:40Z | - |
dc.date.issued | 2013-08 | - |
dc.identifier.citation | In: CCCG 2013 - 25th Canadian Conference on Computational Geometry. (CCCG 2013 - 25th Canadian Conference on Computational Geometry, 2013, :67-72) | en_US |
dc.identifier.uri | https://arxiv.org/pdf/1302.6653.pdf | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/70770 | - |
dc.description.abstract | In this paper we introduce a variation on the multidimensional segment tree, formed by unifying different interpretations of the dimensionalities of the data structure. We give some new definitions to previously well-defined concepts that arise naturally in this variation, and we show some properties concerning the relationships between the nodes, and the regions those nodes represent. We think these properties will enable the data to be utilized in new situations, beyond those previously studied. As an example, we show that the data structure can be used to solve the Rectangle Intersection Problem in a more straightforward and natural way than had be done in the past. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Canadian Conference on Computational Geometry | en_US |
dc.subject | segment tree | en_US |
dc.subject | multidimensional | en_US |
dc.subject | rectangle intersection prob-lem | en_US |
dc.subject | quad tree | en_US |
dc.title | The Unified Segment Tree and its Application to the Rectangle Intersection Problem | en_US |
dc.type | Article | en_US |
dc.relation.page | 1-4 | - |
dc.contributor.googleauthor | David P. Wagner | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | DEPARTMENT OF ELECTRONIC ENGINEERING | - |
dc.identifier.pid | dwagndwagn | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.