Elsevier

Information Processing Letters

Volume 40, Issue 4, 25 November 1991, Pages 189-192
Information Processing Letters

On disjoint concave chains in arrangements of (pseudo) lines

https://doi.org/10.1016/0020-0190(91)90076-TGet rights and content

Abstract

We show that the maximum number of edges of m pairwise-disjoint x-monotone concave polygonal chains contained in the union of n lines is Θ(m23n23+n). The notion of a concave chain is extended to the case of pseudo l ines and the result is proven in this more general setting.

References (11)

  • H. Edelsbrunner et al.

    Topologically sweeping an arrangement

    J. Comput. System Sci.

    (1989)
  • B. Chazelle et al.

    A deterministic view of random sampling and its use in geometry

    Combinatorica

    (1990)
  • K. Clarkson et al.

    Combinatorial complexity bounds for arrangements of curves and spheres

    Discrete Comput. Geom.

    (1990)
  • K.L. Clarkson et al.

    Applications of random sampling in computational geometry, II

    Discrete Comput. Geom.

    (1989)
  • H. Edelsbrunner

    Algorithms in Combinatorial Geometry

    (1987)
There are more references available in the full text version of this article.

Cited by (9)

View all citing articles on Scopus
View full text