We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in ℝ3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is bounded by 2 O(n log n), where the implied constant in the exponent depends on d. This generalizes a similar bound obtained by Pach, Pollack and Welzl for the case when d = 1. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Basu, S., Dhandapani, R., & Pollack, R. (2004). On the realizable weaving patterns of polynomial curves in ℝ3. In Lecture Notes in Computer Science (Vol. 3383, pp. 36–42).
Mendeley helps you to discover research relevant for your work.