Author:
Dey T. K.,Edelsbrunner H.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference9 articles.
1. M. Ajtai, V. Chvátal, M. M. Newborn, and E. Szemerédi. Crossing-free subgraphs.Ann. Discrete Math. 12 (1982), 9–12.
2. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman. Point selection and weak ε-nets for convex hulls.Combin. Probab. Comput. 1 (1992), 189–200.
3. B. Aronov, B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and R. Wenger. Points and triangles in the plane and halving planes in space.Discrete Comput. Geom. 6 (1991), 435–442.
4. I. Bárány, Z. Füredi, and L. Lovász. On the number of halving planes.Proc. 5th Ann. Symp. on Computational Geometry, 1989, pp. 140–144.
5. H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987.
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献