htwywd 发表于 2022-8-4 16:19

已知任意n个相切的圆，求能够包含这些圆的最小圆

任意n个相切的圆，求能够包含这些圆的最小圆，哪个大佬能提供思路？非常感谢！！！！

Nicolas2050 发表于 2022-8-4 18:44

Apollonian circle packings

Nicolas2050 发表于 2022-8-4 18:46

这也是最小包围盒问题

Nicolas2050 发表于 2022-8-4 19:15

可以编程解决。

htwywd 发表于 2022-8-4 21:26

Nicolas2050 发表于 2022-8-4 18:46
这也是最小包围盒问题

好的，非常感谢大佬的帮助

Nicolas2050 发表于 2022-8-5 06:45

References

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

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

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

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 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

Finding the largest area rectangle of arbitrary orientation ina closed contour.Written by Rubén Molano, Pablo G. Rodriguez,    Andres Caro, M. Luisa Duran.

玉树临风 发表于 2024-1-21 06:05

直径确定了就完事了吧，这个思路是不是有点短
页: [1]
查看完整版本: 已知任意n个相切的圆，求能够包含这些圆的最小圆