Author:
McAllister M.,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
Reference37 articles.
1. H. Alt, D. Hsu, and J. Snoeyink. Computing the largest inscribed isothetic rectangle.Proc. 7th Canad. Conf. Comput. Geom., pp. 67–72. Université Laval, Quebec, 1995.
2. H. Alt and C. K. Yap. Algorithmic aspects of motion planning: a tutorial, part 2.Algorithms Rev., 1(2):61–77, 1990.
3. F. Aurenhammer. Voronoi diagrams— a survey of a fundamental geometric data structure.ACM Comput. Surveys, 23(3):345–405, 1991.
4. M. Ben-Or. Lower bounds for algebraic computation trees.Proc. 15th Ann. ACM STOC, pp. 80–86, 1983.
5. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry.Discrete Comput. Geom., 8:51–71, 1992.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献