| dc.contributor.author |
Lagogiannis, G |
en |
| dc.contributor.author |
Makris, C |
en |
| dc.contributor.author |
Tsakalidis, A |
en |
| dc.date.accessioned |
2014-06-06T06:43:50Z |
|
| dc.date.available |
2014-06-06T06:43:50Z |
|
| dc.date.issued |
1999 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1016/S0020-0190(99)00145-3 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/1493 |
|
| dc.subject |
Computational Geometry |
en |
| dc.subject |
Data Structure |
en |
| dc.title |
A New Algorithm for Rectangle Enclosure Reporting |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.1016/S0020-0190(99)00145-3 |
en |
| heal.publicationDate |
1999 |
en |
| heal.abstract |
We present a new algorithm for reporting all the enclosures in a set of plane rectangles in O(nlognlog logn+klog logn) time and O(n) space (k denotes the output size). The result is already known but the proposed algorithm uses simple data structures. |
en |
| heal.journalName |
Information Processing Letters |
en |
| dc.identifier.doi |
10.1016/S0020-0190(99)00145-3 |
en |