<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-17T02:23:40Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/460151" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/460151</identifier><datestamp>2026-04-08T10:43:51Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Crossing-free monochromatic trees for bicolored point sets</dc:title>
   <dc:creator>Fernández Goycoolea, José</dc:creator>
   <dc:creator>Hernán Herrera, Luis</dc:creator>
   <dc:creator>Pérez Lantero, Pablo</dc:creator>
   <dc:creator>Seara Ojea, Carlos</dc:creator>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta</dc:subject>
   <dc:subject>Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat</dc:subject>
   <dc:subject>Colored points in the plane</dc:subject>
   <dc:subject>Non-intersecting trees</dc:subject>
   <dc:subject>Monochromatic trees</dc:subject>
   <dcterms:abstract>© 2026 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/</dcterms:abstract>
   <dcterms:abstract>We study the problem of connecting the points of a bicolored point set S = R U B by monochromatic non-overlapping geometric trees. As has been done for similar geometric problems, we characterize the minimum number of trees required in terms of the number t of non-monochromatic edges in the convex hull. Then, we propose an algorithm to construct this forest aiming to maintain the trees’ diameter long. The algorithm constructs two non-overlapping caterpillar trees when t &lt;= 2, and a forest of trees composed of linked caterpillars if t > 2. Moreover, a process to flatten such caterpillars into paths when possible is discussed and exemplified. A qualitative comparison with an existing algorithm is also presented.</dcterms:abstract>
   <dcterms:abstract>Supported by project DICYT 042332PL, Vicerrector´ıa de Investigaci´on, Desarrollo e Innovaci´on USACH (Chile). Supported by grant PID2023-150725NB-I00 funded by MICIU/AEI/10.13039/501100011033.</dcterms:abstract>
   <dcterms:abstract>Peer Reviewed</dcterms:abstract>
   <dcterms:abstract>Postprint (author's final draft)</dcterms:abstract>
   <dcterms:issued>2026-07-15</dcterms:issued>
   <dc:type>Article</dc:type>
   <dc:relation>https://www.sciencedirect.com/science/article/abs/pii/S0166218X26001277</dc:relation>
   <dc:relation>info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/PID2023-150725NB-I00/ES/GRAFOS GEOMETRICOS Y ABSTRACTOS: TEORIA Y APLICACIONES/</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
   <dc:rights>Restricted access - publisher's policy</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 International</dc:rights>
   <dc:publisher>Elsevier</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>