|
发表于 2023-10-2 16:40:48
|
显示全部楼层
References
[1] H. Alt, D. Hsu, and J. Snoeyink. Computing the largest inscribed isothetic rectangle. In Proc. 7th Canadian Conf. Comput. Geom., Universit'e Laval, Qu'ebec, August 1995, pp. 67--72.http://citeseer.nj.nec.com/alt94computing.html
[2] D. Kirkpatrick and J. Snoeyink, Tentative prune-and-search for computing fixed-points with applications to geometric computation, Fundamental Informatic, 22 (1995), 353--370.http://citeseer.nj.nec.com/319045.html
[3] K. Daniels, V. Milenkovic, and D. Roth. Finding the largest area axis-parallel rectangle in a polygon. Computational Geometry: Theory and Applications, 7:125--148, 1997.http://citeseer.nj.nec.com/daniels97finding.html
[4] N. Amenta. - Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem. Proceedings of the 10th Annual ACM Symposium on Computational Geometry (1994) pages 340-347. http://www.cs.utexas.edu/users/amenta/pubs/meatloaf.ps.gz |
|