Mostra el registre d'ítem simple

dc.contributor.authorAlegría Galicia, Carlos
dc.contributor.authorOrden Martin, David
dc.contributor.authorSeara Ojea, Carlos
dc.contributor.authorUrrutia Galicia, Jorge
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2021-03-03T10:34:05Z
dc.date.available2022-03-01T01:26:07Z
dc.date.issued2021-03
dc.identifier.citationAlegría-Galicia, C. [et al.]. Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations. "Journal of Global Optimization", Març 2021, vol. 79, núm. 3, p. 687-714.
dc.identifier.issn1573-2916
dc.identifier.otherhttps://arxiv.org/pdf/1710.10888.pdf
dc.identifier.urihttp://hdl.handle.net/2117/340814
dc.descriptionThis is a post-peer-review, pre-copyedit version of an article published in Journal of Global Optimization. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10898-020-00953-5
dc.description.abstractLet P be a set of n points in the plane. We compute the value of ¿¿[0,2p) for which the rectilinear convex hull of P, denoted by RHP(¿), has minimum (or maximum) area in optimal O(nlogn) time and O(n) space, improving the previous O(n2) bound. Let O be a set of k lines through the origin sorted by slope and let ai be the sizes of the 2k angles defined by pairs of two consecutive lines, i=1,…,2k. Let Ti=p-ai and T=min{Ti:i=1,…,2k}. We obtain: (1) Given a set O such that T=p2, we provide an algorithm to compute the O-convex hull of P in optimal O(nlogn) time and O(n) space; If T<p2, the time and space complexities are O(nTlogn) and O(nT) respectively. (2) Given a set O such that T=p2, we compute and maintain the boundary of the O¿-convex hull of P for ¿¿[0,2p) in O(knlogn) time and O(kn) space, or if T<p2, in O(knTlogn) time and O(knT) space. (3) Finally, given a set O such that T=p2, we compute, in O(knlogn) time and O(kn) space, the angle ¿¿[0,2p) such that the O¿-convex hull of P has minimum (or maximum) area over all ¿¿[0,2p).
dc.description.sponsorshipCarlos Alegría: Research supported in part by UNAM Project PAEP, and by MIUR Proj. “AHeAD” No. 20174LF3T8. David Orden: Research supported by Projects MTM2017-83750-P of the Spanish Ministry of Science (AEI/FEDER, UE), and Project PID2019-104129GB-I00 of the Spanish Ministry of Science and Innovation. Carlos Seara: Research supported by Projects Gen. Cat. DGR 2017SGR1640, MINECO MTM2015-63791-R, and Project PID2019-104129GB-I00 of the Spanish Ministry of Science and Innovation. Jorge Urrutia: Research supported in part by SEP-CONACYT 80268, PAPPIIT IN102117 Programa de Apoyo a la Investigación e Innovación Tecnológica UNAM. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 734922.
dc.format.extent28 p.
dc.language.isoeng
dc.publisherSpringer Nature
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subject.lcshOperations research
dc.subject.otherRectilinear convex hull
dc.subject.otherRestricted orientation convex hull
dc.subject.otherMinimum area
dc.titleEfficient computation of minimum-area rectilinear convex hull under rotation and generalizations
dc.typeArticle
dc.subject.lemacOptimització matemàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. CGA - Computational Geometry and Applications
dc.identifier.doi10.1007/s10898-020-00953-5
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90B Operations research and management science
dc.relation.publisherversionhttps://link.springer.com/article/10.1007/s10898-020-00953-5
dc.rights.accessOpen Access
local.identifier.drac30371529
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-104129GB-I00/ES/TEORIA Y APLICACIONES DE CONFIGURACIONES DE PUNTOS Y REDES/
local.citation.authorAlegría-Galicia , C.; Orden, D.; Seara, C.; URRUTIA, J.
local.citation.publicationNameJournal of Global Optimization
local.citation.volume79
local.citation.number3
local.citation.startingPage687
local.citation.endingPage714


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple