Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane

  title={Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane},
  author={Oswin Aichholzer and Jean Cardinal and Thomas Hackl and Ferran Hurtado and Matias Korman and Alexander Pilz and Rodrigo I. Silveira and Ryuhei Uehara and Birgit Vogtenhuber and Emo Welzl},
  journal={Discrete Mathematics & Theoretical Computer Science},
We show that in every arrangement of n red and blue lines — in general position and not all of the same color — there is a path through a linear number of cells where red and blue lines are crossed alternatingly (and no cell is revisited). When all lines have the same color, and hence the preceding alternating constraint is dropped, we prove that the dual graph of the arrangement always contains a path of length Θ(n). 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 25 references

and P

  • P. Bose, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, M. Korman
  • Taslakian Coloring and guarding arrangements…
  • 2012
1 Excerpt

Caminos alternantes

  • M. Abellanas, A. Garćıa, F. Hurtado, J. Tejel
  • Actas X Encuentros de Geometria Computacional (in…
  • 2003

Similar Papers

Loading similar papers…