Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 4 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorAhn, H.-K.-
dc.contributor.authorBaraldo, N.-
dc.contributor.authorOh, E.-
dc.contributor.authorSilvestri, F.-
dc.date.accessioned2021-06-01T04:13:02Z-
dc.date.available2021-06-01T04:13:02Z-
dc.date.created2018-07-18-
dc.date.issued2017-07-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/105428-
dc.description.abstractIn 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.languageEnglish-
dc.publisherSpringer Verlag-
dc.relation.isPartOfLecture Notes in Computer Science-
dc.titleA time-space trade-off for triangulations of points in the plane-
dc.typeArticle-
dc.identifier.doi10.1007/978-3-319-62389-4_1-
dc.type.rimsART-
dc.identifier.bibliographicCitationLecture Notes in Computer Science, v.10392 LNCS, pp.3 - 12-
dc.citation.endPage12-
dc.citation.startPage3-
dc.citation.titleLecture Notes in Computer Science-
dc.citation.volume10392 LNCS-
dc.contributor.affiliatedAuthorAhn, H.-K.-
dc.identifier.scopusid2-s2.0-85028472818-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.type.docTypeARTICLE-
dc.description.journalRegisteredClassscopus-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

안희갑AHN, HEE-KAP
Grad. School of AI
Read more

Views & Downloads

Browse