<?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-13T01:59:52Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/26484" metadataPrefix="qdc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/26484</identifier><datestamp>2025-07-17T03:49:02Z</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>Order types and cross-sections of line arrangements in R^3</dc:title>
   <dc:creator>Aichholzer, Oswin</dc:creator>
   <dc:creator>Fabila-Monroy, Ruy</dc:creator>
   <dc:creator>Hurtado Díaz, Fernando Alfredo</dc:creator>
   <dc:creator>Pérez Lantero, Pablo</dc:creator>
   <dc:creator>Ruiz Vargas, Andrés</dc:creator>
   <dc:creator>Urrutia Galicia, Jorge</dc:creator>
   <dc:creator>Vogtenhuber, Birgit</dc:creator>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional</dc:subject>
   <dc:subject>Computational geometry</dc:subject>
   <dc:subject>Geometria computacional</dc:subject>
   <dcterms:abstract>We consider sets L = {l1,...., ln} of n labeled lines in general position in R3, and study the order types of point sets fp1; : : : ; png that stem from the intersections of the lines in L with (directed) planes II, not parallel to any line of L, i.e., the proper cross-sections of L.&#xd;
As a main result we show that the number of different order types that can be obtained as cross-sections of L is O(n9), and that this bound is tight.</dcterms:abstract>
   <dcterms:abstract>Peer Reviewed</dcterms:abstract>
   <dcterms:abstract>Postprint (published version)</dcterms:abstract>
   <dcterms:issued>2014</dcterms:issued>
   <dc:type>Conference report</dc:type>
   <dc:relation>https://projects.cs.dal.ca/cccg2014/proceedings/papers/paper39.pdf</dc:relation>
   <dc:rights>Restricted access - publisher's policy</dc:rights>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>