Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/1140
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEvrendilek, Cem-
dc.contributor.authorGenc, Burkay-
dc.contributor.authorHnich, Brahim-
dc.date.accessioned2023-06-16T12:59:07Z-
dc.date.available2023-06-16T12:59:07Z-
dc.date.issued2016-
dc.identifier.issn0925-7721-
dc.identifier.issn1879-081X-
dc.identifier.urihttps://doi.org/10.1016/j.comgeo.2016.02.003-
dc.identifier.urihttps://hdl.handle.net/20.500.14365/1140-
dc.description.abstractIn this paper, we address the problem of covering a given set of points on the plane with minimum and/or maximum area orthogonally convex polygons. It is known that the number of possible orthogonally convex polygon covers can be exponential in the number of input points. We propose, for the first time, an O(n(2)) algorithm to construct either the maximum or the minimum area orthogonally convex polygon if it exists, else report the non-existence in O (n log n). (C) 2016 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevier Science Bven_US
dc.relation.ispartofComputatıonal Geometry-Theory And Applıcatıonsen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectOrthogonally convexen_US
dc.subjectPolygon coveren_US
dc.subjectOptimal areaen_US
dc.subjectDynamic programmingen_US
dc.titleCovering Points With Minimum/Maximum Area Orthogonally Convex Polygonsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.comgeo.2016.02.003-
dc.identifier.scopus2-s2.0-84959421710-
dc.departmentİzmir Ekonomi Üniversitesien_US
dc.authorid0000-0001-5134-1487-
dc.authoridHnich, Brahim/0000-0001-8875-8390-
dc.authorwosidAAG-6482-2021-
dc.authorscopusid6506351542-
dc.authorscopusid57202163971-
dc.authorscopusid6602458958-
dc.identifier.volume54en_US
dc.identifier.startpage32en_US
dc.identifier.endpage44en_US
dc.identifier.wosWOS:000374598700003-
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.scopusqualityQ4-
dc.identifier.wosqualityQ3-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.grantfulltextreserved-
crisitem.author.dept05.05. Computer Engineering-
crisitem.author.dept05.05. Computer Engineering-
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File SizeFormat 
156.pdf
  Restricted Access		543.34 kBAdobe PDFView/Open
Show simple item record



CORE Recommender

SCOPUSTM   
Citations

2
checked on Apr 16, 2025

Page view(s)

124
checked on Apr 14, 2025

Download(s)

8
checked on Apr 14, 2025

Google ScholarTM

Check




Altmetric


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