Publisher
Springer International Publishing
Reference16 articles.
1. Aichholzer, O., et al.: Compatible geometric matchings. Comput. Geom. 42(6–7), 617–626 (2009). https://doi.org/10.1016/j.endm.2008.06.040
2. Aichholzer, O., García, A., Hurtado, F., Tejel, J.: Compatible matchings in geometric graphs. In: Proceeding of XIV Encuentros de Geometría Computacional, pp. 145–148. Alcalá, Spain (2011)
3. Akitaya, H.A., Korman, M., Rudoy, M., Souvaine, D.L., Tóth, C.D.: Circumscribing polygons and polygonizations for disjoint line segments. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), LIPIcs. Leibniz International Proceedings in Informatics, vol. 129, Art. No. 9, 17. Schloss Dagstuhl (2019). https://doi.org/10.4230/LIPIcs.SoCG.2019.9
4. Bae, S.W., de Berg, M., Cheong, O., Gudmundsson, J., Levcopoulos, C.: Shortcuts for the circle. Comput. Geom. 79, 37–54 (2019). https://doi.org/10.1016/j.comgeo.2019.01.006
5. Lecture Notes in Computer Science;M de Berg,2010
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Disjoint Compatibility via Graph Classes;Graph-Theoretic Concepts in Computer Science;2022