TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Known packings of equal circles in a circle

74 点作者 terminalhealth将近 6 年前

8 条评论

pavel_lishin将近 6 年前
What do the colors indicate?<p><a href="http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;d1.html" rel="nofollow">http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;d1.html</a><p>I see orange, blue, purple and yellow on the page; what do they signify?
评论 #20588588 未加载
评论 #20587337 未加载
评论 #20587845 未加载
评论 #20588068 未加载
lacker将近 6 年前
Nice. This will come in handy the next time I need to fit 1846 equal circles into a single larger circle.
评论 #20586659 未加载
评论 #20587952 未加载
评论 #20587533 未加载
vesinisa将近 6 年前
I find it most fascinating looking for the locally maximal densities. Starting from N=2, some arrangements always fall in a &quot;satisfying&quot; pattern and a locally optimal maximum density is achieved.<p>&quot;The sequence of N&#x27;s that establish density records&quot; link leads to an empty page, but this sequence is also known as OEIS A084644 &quot;Best packings of m&gt;1 equal circles into a larger circle setting a new density record&quot;, and starts with 2, 3, 4, 7, 19, 37, 55, 85, 121, 147, 148, 150, 151, 187. <a href="https:&#x2F;&#x2F;oeis.org&#x2F;A084644" rel="nofollow">https:&#x2F;&#x2F;oeis.org&#x2F;A084644</a><p>Look for example at N=1759: <a href="http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1759.html" rel="nofollow">http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1759.html</a><p>Compare it with N=1758, which has a slight &quot;imperfection&quot;: <a href="http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1758.html" rel="nofollow">http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1758.html</a><p>Or with N=1760, which is too &quot;tight&quot; resulting in a worse density: <a href="http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1760.html" rel="nofollow">http:&#x2F;&#x2F;hydra.nat.uni-magdeburg.de&#x2F;packing&#x2F;cci&#x2F;cci1760.html</a>
parsimo2010将近 6 年前
Is there a proven bound so we know when the best known packing is the best possible packing? The lower numbers look very tidy and we&#x27;ve probably got the best possible packing for small N, but the larger numbers look like there may be room for improvement.
评论 #20588252 未加载
评论 #20586256 未加载
2bitencryption将近 6 年前
I wonder, are there any patterns here for certain interesting mathematical sets of numbers, like primes, squares, etc?<p>First glance doesn&#x27;t show anything obvious, but I&#x27;m no mathematician.
madengr将近 6 年前
This is pretty important for modulation in digital communications. Interesting to see others than 2^N, and that 2^N are not square constellations, except for QPSK. Sometimes minimizing amplitude (envelope) variations is more important, or sometimes susceptibility to white noise or phase noise.<p>I remember learning about N-dimensional sphere packing for coding.
raven105x将近 6 年前
Would this not be an excellent design cue for friction-based water heaters?
dfeojm-zlib将近 6 年前
Newtonian packing of circles, e.g., Hungarians packing a Subaru for a summer road trip. :)
评论 #20587986 未加载