Author:
Froese Vincent,Renken Malte
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. J. Abello and Ö. Egecioglu: Visibility graphs of staircase polygons with uniform step length, International Journal of Computational Geometry & Applications 3 (1993), 27–37.
2. J. Abello, Ö. Egecioglu and K. Kumar: Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains, Discrete & Computational Geometry 14 (1995), 331–358.
3. S. Ameer, M. Gibson-Lopez, E. Krohn, S. Soderman and Q. Wang: Terrain visibility graphs: Persistence is not enough, in: 36th International Symposium on Computational Geometry (SoCG 2020), volume 164 of LIPIcs, 6 1–6:13, Schloss Dagstuhl — Leibniz-Zentrum für Informatik, 2020.
4. M. Azaola and F. Santos: The number of triangulations of the cyclic polytope c(n,n − 4), Discrete & Computational Geometry 27 (2002), 29–48.
5. M. Breen: Primitive radon partitions for cyclic polytopes, Israel Journal of Mathematics 15 (1973), 156–157.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献