Abstract
We consider sets L={ℓ 1,…,ℓ n} of n labeled lines in general position in R 3, and study the order types of point sets {p 1,…,p n} that stem from the intersections of the lines in L with (directed) planes Π not parallel to any line of L, that is, the proper cross-sections of L. As two main results, we show that the number of different order types that can be obtained as cross-sections of L is O(n 9) when considering all possible planes Π and O(n 3) when restricting considerations to sets of pairwise parallel planes, where both bounds are tight. The result for parallel planes implies that any set of n points in R 2 moving with constant (but possibly different) speeds along straight lines forms at most O(n 3) different order types over time. We further generalize the setting from R 3 to R d with d>3, showing that the number of order types that can be obtained as cross-sections of a set of n labeled (d−2)-flats in R d with planes is O(((n3)+nd(d−2))).
| Originalsprache | englisch |
|---|---|
| Seiten (von - bis) | 51-61 |
| Seitenumfang | 11 |
| Fachzeitschrift | Computational Geometry |
| Jahrgang | 77 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 2019 |
ASJC Scopus subject areas
- Computational Mathematics
- Steuerung und Optimierung
- Geometrie und Topologie
- Angewandte Informatik
- Theoretische Informatik und Mathematik
Fields of Expertise
- Information, Communication & Computing
Fingerprint
Untersuchen Sie die Forschungsthemen von „Cross-sections of line configurations in $R^3$ and $(d-2)$-flat configurations in $R^d$“. Zusammen bilden sie einen einzigartigen Fingerprint.Dieses zitieren
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS