Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
2014
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.
Peer Reviewed
Postprint (published version)
Conference report
English
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional; Computational geometry; Geometria computacional
https://projects.cs.dal.ca/cccg2014/proceedings/papers/paper39.pdf
Restricted access - publisher's policy
E-prints [73006]