File Download

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.number 2 -
dc.citation.startPage 206 -
dc.citation.title SYMMETRY-BASEL -
dc.citation.volume 16 -
dc.contributor.author Chung, Chaeyoon -
dc.contributor.author Vigneron, Antoine -
dc.contributor.author Ahn, Hee-Kap -
dc.date.accessioned 2024-03-19T16:35:08Z -
dc.date.available 2024-03-19T16:35:08Z -
dc.date.created 2024-03-19 -
dc.date.issued 2024-02 -
dc.description.abstract Given a set of n disks in the plane, we study the problem of finding k lines that together intersect the maximum number of input disks. We consider three variants of this problem with the following constraints on the solution: (1) no constraint on the lines, (2) the k lines should be parallel and (3) the k lines should pass through a common point. For (Formula presented.), we give (Formula presented.) -time algorithms for all three cases. For any fixed (Formula presented.), we give an (Formula presented.) -time algorithm for (1). For variants (2) and (3), the running times of our algorithms vary from (Formula presented.) to (Formula presented.). -
dc.identifier.bibliographicCitation SYMMETRY-BASEL, v.16, no.2, pp.206 -
dc.identifier.doi 10.3390/sym16020206 -
dc.identifier.issn 2073-8994 -
dc.identifier.scopusid 2-s2.0-85187247304 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/81694 -
dc.identifier.wosid 001175939800001 -
dc.language 영어 -
dc.publisher Multidisciplinary Digital Publishing Institute (MDPI) -
dc.title Maximum Coverage by k Lines -
dc.type Article -
dc.description.isOpenAccess TRUE -
dc.relation.journalWebOfScienceCategory Multidisciplinary Sciences -
dc.relation.journalResearchArea Science & Technology - Other Topics -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor computational geometry -
dc.subject.keywordAuthor exact algorithm -
dc.subject.keywordAuthor geometric optimization -
dc.subject.keywordAuthor maximum coverage -
dc.subject.keywordAuthor partial hitting sets -
dc.subject.keywordAuthor shape fitting -
dc.subject.keywordPlus POINTS -
dc.subject.keywordPlus TIME -

qrcode

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