DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, H.-K. | - |
dc.contributor.author | Baraldo, N. | - |
dc.contributor.author | Oh, E. | - |
dc.contributor.author | Silvestri, F. | - |
dc.date.accessioned | 2021-06-01T04:13:02Z | - |
dc.date.available | 2021-06-01T04:13:02Z | - |
dc.date.created | 2018-07-18 | - |
dc.date.issued | 2017-07 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/105428 | - |
dc.description.abstract | In this paper, we consider time-space trade-offs for reporting a triangulation of points in the plane. The goal is to minimize the amount of working space while keeping the total running time small. We present the first multi-pass algorithm on the problem that returns the edges of a triangulation with their adjacency information. This even improves the previously best known random-access algorithm. ? 2017, Springer International Publishing AG. | - |
dc.language | English | - |
dc.publisher | Springer Verlag | - |
dc.relation.isPartOf | Lecture Notes in Computer Science | - |
dc.title | A time-space trade-off for triangulations of points in the plane | - |
dc.type | Article | - |
dc.identifier.doi | 10.1007/978-3-319-62389-4_1 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science, v.10392 LNCS, pp.3 - 12 | - |
dc.citation.endPage | 12 | - |
dc.citation.startPage | 3 | - |
dc.citation.title | Lecture Notes in Computer Science | - |
dc.citation.volume | 10392 LNCS | - |
dc.contributor.affiliatedAuthor | Ahn, H.-K. | - |
dc.identifier.scopusid | 2-s2.0-85028472818 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | ARTICLE | - |
dc.description.journalRegisteredClass | scopus | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.