Author:
Aggarwal Alok,Klawe Maria M.,Moran Shlomo,Shor Peter,Wilber Robert
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. A. Aggarwal and R. C. Melville, Fast computation of the modality of polygons,Proceedings of the Conference on Information Sciences and Systems, The Johns Hopkins University. Also appears inJ. Algorithms,7 (1986), 369–381.
2. A. Aggarwal, J. S. Chang, and C. K. Yap, Minimum area circumscribing polygons, Technical Report, Courant Institute of Mathematical Sciences, New York University, 1985. Also to appear inVisual Comput. (1986).
3. D. Avis, G. T. Toussaint, and B. K. Bhattacharya, On the multimodality of distance in convex polygons,Comput. Math. Appl.,8 (1982), 153–156.
4. J. E. Boyce, D. P. Dobkin, R. L. Drysdale, and L. J. Guibas, Finding extremal polygons,SIAM J. Comput.,14 (1985), 134–147.
5. B. M. Chazelle, R. L. Drysdale, and D. T. Lee, Computing the largest empty rectangle,SIAM J. Comput.,15 (1986), 300–315.
Cited by
280 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Largest unit rectangles inscribed in a convex polygon;Computational Geometry;2025-01
2. Finding the largest separating rectangle among two point sets;Theoretical Computer Science;2024-11
3. Parallel and (Nearly) Work-Efficient Dynamic Programming;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
4. (1 −
)-Approximation of Knapsack in Nearly Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. A Nearly Quadratic-Time FPTAS for Knapsack;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10