Abstract
We consider sets 葦 = {ℓ1;.,ℓn} of n labeled lines in general position in ℝ3, and study the order types of point sets {p1;.; pn} that stem from the intersections of the lines in L with (directed) planes II not parallel to any line of 葦, i.e., the proper cross-sections of 葦. As a main result we show that the number of diérent order types that can be obtained as cross-sections of L is O(n9), and that this bound is tight.
Original language | English |
---|---|
Title of host publication | 26th Canadian Conference on Computational Geometry, CCCG 2014 |
Publisher | Canadian Conference on Computational Geometry |
Pages | 267-272 |
Number of pages | 6 |
Publication status | Published - 2014 |
Event | 26th Canadian Conference on Computational Geometry: CCCG 2014 - Halifax, Canada Duration: 11 Aug 2014 → 13 Aug 2014 |
Conference
Conference | 26th Canadian Conference on Computational Geometry |
---|---|
Country/Territory | Canada |
City | Halifax |
Period | 11/08/14 → 13/08/14 |
ASJC Scopus subject areas
- Geometry and Topology
- Computational Mathematics