dc.contributor
Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.author
Aichholzer, Oswin
dc.contributor.author
Fabila-Monroy, Ruy
dc.contributor.author
Hurtado Díaz, Fernando Alfredo
dc.contributor.author
Pérez Lantero, Pablo
dc.contributor.author
Ruiz Vargas, Andrés
dc.contributor.author
Urrutia Galicia, Jorge
dc.contributor.author
Vogtenhuber, Birgit
dc.identifier
Aichholzer, O. [et al.]. Order types and cross-sections of line arrangements in R^3. A: Canadian Conference on Computational Geometry. "Proceedings 26th Canadian Conference on Computational Geometry". 2014, p. 1-6.
dc.identifier
https://hdl.handle.net/2117/26484
dc.description.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.
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.
dc.description.abstract
Peer Reviewed
dc.description.abstract
Postprint (published version)
dc.format
application/pdf
dc.relation
https://projects.cs.dal.ca/cccg2014/proceedings/papers/paper39.pdf
dc.rights
Restricted access - publisher's policy
dc.subject
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional
dc.subject
Computational geometry
dc.subject
Geometria computacional
dc.title
Order types and cross-sections of line arrangements in R^3
dc.type
Conference report
