Author:
Bespamyatnikh S.,Kirkpatrick D.,Snoeyink J.
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. P. Agarwal and M. Sharir. Arrangements. In Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, eds.). Elsevier Science/North-Holland, Amsterdam, 1998.
2. I. Bárány. Geometric and combinatorial applications of Borsuk’s theorem. In New Trends in Discrete and Computational Geometry (J. Pach, ed.). Vol. 10 of Algorithms and Combinatorics, pp. 235–249. Springer-Verlag, Berlin, 1993.
3. I. Bárány and J. Matoušek. Simultaneous partitions of measures by k-fans. Preprint, 1999.
4. T. K. Dey. Improved bounds on planar k-sets and related problems. Discrete Comput. Geom., 19 (1998), 373–382.
5. M. Díaz and J. O’Rourke. Ham-sandwich sectioning of polygons. In Proc. 2nd Canad. Conf. Comput. Geom., pp. 282–286, 1990.
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献