Funder
Consejo Nacional de Ciencia y Tecnología
Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference19 articles.
1. Bárány, I., Matoušek, J., Pór, A.: Curves in $$R^d$$ R d intersecting every hyperplane at most $$d+1$$ d + 1 times. In: Computational Geometry (SoCG’14), pp. 565–571. ACM, New York (2014)
2. Bisztriczky, T.: Characterizations of cyclic polytopes. J. Geom. 84(1–2), 30–36 (2006)
3. Dzunic, Z.: Largest Fence. USACO December 2008, Gold Problems. http://tjsct.wikidot.com/usaco-dec08-gold
4. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)
5. Forge, D., Las Vergnas, M., Schuchert, P.: 10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope. Eur. J. Comb. 22(5), 705–708 (2001)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献