Open Access System for Information Sharing

Login Library

 

Article
Cited 5 time in webofscience Cited 7 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorOh, Eunjin-
dc.contributor.authorDe Carufel, Jean-Lou-
dc.contributor.authorAhn, Hee-Kap-
dc.date.accessioned2019-04-07T16:50:09Z-
dc.date.available2019-04-07T16:50:09Z-
dc.date.created2018-10-10-
dc.date.issued2018-10-
dc.identifier.issn0925-7721-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/95638-
dc.description.abstractIn the geodesic 2-center problem in a simple polygon with n vertices, we find a set S of two points in the polygon that minimizes the maximum geodesic distance from any point of the polygon to its closest point in S. In this paper, we present an O (n(2) log(2) n)-time algorithm for this problem using O (n) space. (C) 2018 Elsevier B.V. All rights reserved.-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.relation.isPartOfCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.titleThe geodesic 2-center problem in a simple polygon-
dc.typeArticle-
dc.identifier.doi10.1016/j.comgeo.2018.02.008-
dc.type.rimsART-
dc.identifier.bibliographicCitationCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.74, pp.21 - 37-
dc.identifier.wosid000441658400002-
dc.citation.endPage37-
dc.citation.startPage21-
dc.citation.titleCOMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS-
dc.citation.volume74-
dc.contributor.affiliatedAuthorOh, Eunjin-
dc.contributor.affiliatedAuthorAhn, Hee-Kap-
dc.identifier.scopusid2-s2.0-85048817680-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.type.docTypeArticle-
dc.subject.keywordPlusLINEAR-TIME ALGORITHMS-
dc.subject.keywordAuthorSimple polygons-
dc.subject.keywordAuthork-center problem-
dc.subject.keywordAuthorGeodesic distance-
dc.relation.journalWebOfScienceCategoryMathematics, Applied-
dc.relation.journalWebOfScienceCategoryMathematics-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaMathematics-

qr_code

  • mendeley

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

Related Researcher

Views & Downloads

Browse