Open Access System for Information Sharing

Login Library

 

Conference
Cited 0 time in webofscience Cited 1 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorChoi, Jongmin-
dc.contributor.authorJeong, Dahye-
dc.contributor.authorAhn, Hee-Kap-
dc.date.accessioned2022-03-11T05:40:25Z-
dc.date.available2022-03-11T05:40:25Z-
dc.date.created2022-03-11-
dc.date.issued2021-07-05-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/110814-
dc.description.abstractWe consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an O(nlog n) -time algorithm for the two-center problem for a convex polygon, where n is the number of vertices of the polygon. This improves upon the previous best algorithm for the problem.-
dc.languageEnglish-
dc.publisherSpringer Science and Business Media Deutschland GmbH-
dc.relation.isPartOf32nd International Workshop on Combinatorial Algorithms, IWOCA 2021-
dc.relation.isPartOfLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.titleCovering Convex Polygons by Two Congruent Disks-
dc.typeConference-
dc.type.rimsCONF-
dc.identifier.bibliographicCitation32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, pp.165 - 178-
dc.citation.conferenceDate2021-07-05-
dc.citation.conferencePlaceCN-
dc.citation.endPage178-
dc.citation.startPage165-
dc.citation.title32nd International Workshop on Combinatorial Algorithms, IWOCA 2021-
dc.contributor.affiliatedAuthorChoi, Jongmin-
dc.contributor.affiliatedAuthorJeong, Dahye-
dc.contributor.affiliatedAuthorAhn, Hee-Kap-
dc.identifier.scopusid2-s2.0-85112016883-
dc.description.journalClass1-
dc.description.journalClass1-

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