On tangencies among planar curves with an application to coloring L-shapes
From MaRDI portal
Publication:6604683
DOI10.1007/978-3-030-83823-2_20MaRDI QIDQ6604683
Eyal Ackerman, Dömötör Pálvölgyi, Balázs Keszegh
Publication date: 13 September 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersection graphs of L-shapes and segments in the plane
- Triangle-free intersection graphs of line segments with large chromatic number
- Tangencies between families of disjoint regions in the plane
- On pseudo-disk hypergraphs
- On the number of touching pairs in a set of planar curves
- On bounding the chromatic number of L-graphs
- Conflict-free coloring of string graphs
- On grounded \(\llcorner\)-graphs and their relatives
- Geometry -- intuitive, discrete, and convex. A tribute to László Fejes Tóth
- Topological Hypergraphs
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
Related Items (1)
This page was built for publication: On tangencies among planar curves with an application to coloring L-shapes
