Author:
Giannopoulos Panos,Knauer Christian,Wahlström Magnus,Werner Daniel
Funder
the German Science Foundation (DFG)
the German Research Foundation (DFG)
Deutsche Forschungsgemeinschaft
Subject
Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics
Reference27 articles.
1. A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Symposium on Computational Geometry, 278–290, 1987.
2. N. Alon, A non-linear lower bound for planar epsilon-nets, Discrete and Computational Geometry 2011 (in press) doi:10.1007/s00454-010-9323-7.
3. On approximating the depth and related problems;Aronov;SIAM J. Comput.,2008
4. J. Backer, J.M. Keil, The bichromatic rectangle problem in high dimensions, in: Proc. of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, BC, Canada, pp. 157–160, 2009.
5. J. Backer, J.M. Keil, The mono- and bichromatic empty rectangle and square problems in all dimensions, in: Proc. of the 9th Latin American Theoretical Informatics Symposium, vol. 6034, LNCS, pp. 14–25, 2010.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献