Author:
Dumitrescu Adrian,Tóth Csaba D.
Publisher
Springer International Publishing
Reference25 articles.
1. Aichholzer, O., Hackl, T., Vogtenhuber, B., Huemer, C., Hurtado, F., Krasser, H.: On the number of plane geometric graphs. Graphs Combin. 23(1), 67–84 (2007)
2. Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9–12 (1982)
3. Alvarez, V., Bringmann, K., Curticapean, R., Ray, S.: Counting crossing-free structures. In: Proc. 28th Sympos. on Comput. Geom. (SOCG), pp. 61–68. ACM Press (2012). arXiv:1312.4628
4. Alvarez, V., Seidel, R.: A simple aggregative algorithm for counting triangulations of planar point sets and related problems. In: Proc. 29th Sympos. on Comput. Geom. (SOCG), pp. 1–8. ACM Press (2013)
5. Alvarez, V., Bringmann, K., Ray, S., Ray, S.: Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5), 386–397 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Monotone Paths in Geometric Triangulations;Lecture Notes in Computer Science;2016
2. Counting Carambolas;Graphs and Combinatorics;2015-09-02
3. Convex Polygons in Geometric Triangulations;Lecture Notes in Computer Science;2015