Publisher
Springer International Publishing
Reference16 articles.
1. Alon, N., Last, H., Pinchasi, R., Sharir, M.: On the complexity of arrangements of circles in the plane. Discrete Comput. Geom. 26(4), 465–492 (2001). https://doi.org/10.1007/s00454-001-0043-x
2. Andreev, E.M.: Convex polyhedra in Lobačevskiĭ spaces. Mat. Sb. (N.S.) 81(123)(3), 445–478 (1970). https://doi.org/10.1070/SM1970v010n03ABEH001677
3. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1–2), 3–24 (1998). https://doi.org/10.1016/S0925-7721(97)00014-X
4. Carmesin, S., Schulz, A.: Arrangements of orthogonal circles with many intersections (2021). https://arxiv.org/abs/2106.03557v2
5. Lecture Notes in Computer Science;S Chaplick,2019