Maximum number of circle packing into a rectangle
$begingroup$
I'm asked to pack the maximum number of 10m^2 circle into a 257 x 157m rectangle. After a lot of research, I found out that there are no optimal solution. So, i try to pack as many as possible (taking this website as reference):
1) First, I tried to place them in rectangular pattern:
- I had the width 257/d (diameter) -> I got about 72.024 --> So along the width, i can place 72 circle.
- I had the height 157/d (diameter) -> I got about 43.999 --> So along the height, i can place 43 circle.
--> That means in this case, i can fit in 43*72= 3096 circles
2) Then I try triangular pattern, which can fit more circles, 3575 circles. However, I find my math calculation kinda inefficient, long, and not correct in any other cases.
So my question is: Did I calculate it in a correct way? Are there any other more effective calculation methods?
Because in later question, it asks me to find the area of the circle to so that we get the maximum profit. Giving the profit of each circle is: P(a) = 200 - 200/a (a is the area of the circle)
calculus packing-problem
$endgroup$
add a comment |
$begingroup$
I'm asked to pack the maximum number of 10m^2 circle into a 257 x 157m rectangle. After a lot of research, I found out that there are no optimal solution. So, i try to pack as many as possible (taking this website as reference):
1) First, I tried to place them in rectangular pattern:
- I had the width 257/d (diameter) -> I got about 72.024 --> So along the width, i can place 72 circle.
- I had the height 157/d (diameter) -> I got about 43.999 --> So along the height, i can place 43 circle.
--> That means in this case, i can fit in 43*72= 3096 circles
2) Then I try triangular pattern, which can fit more circles, 3575 circles. However, I find my math calculation kinda inefficient, long, and not correct in any other cases.
So my question is: Did I calculate it in a correct way? Are there any other more effective calculation methods?
Because in later question, it asks me to find the area of the circle to so that we get the maximum profit. Giving the profit of each circle is: P(a) = 200 - 200/a (a is the area of the circle)
calculus packing-problem
$endgroup$
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24
add a comment |
$begingroup$
I'm asked to pack the maximum number of 10m^2 circle into a 257 x 157m rectangle. After a lot of research, I found out that there are no optimal solution. So, i try to pack as many as possible (taking this website as reference):
1) First, I tried to place them in rectangular pattern:
- I had the width 257/d (diameter) -> I got about 72.024 --> So along the width, i can place 72 circle.
- I had the height 157/d (diameter) -> I got about 43.999 --> So along the height, i can place 43 circle.
--> That means in this case, i can fit in 43*72= 3096 circles
2) Then I try triangular pattern, which can fit more circles, 3575 circles. However, I find my math calculation kinda inefficient, long, and not correct in any other cases.
So my question is: Did I calculate it in a correct way? Are there any other more effective calculation methods?
Because in later question, it asks me to find the area of the circle to so that we get the maximum profit. Giving the profit of each circle is: P(a) = 200 - 200/a (a is the area of the circle)
calculus packing-problem
$endgroup$
I'm asked to pack the maximum number of 10m^2 circle into a 257 x 157m rectangle. After a lot of research, I found out that there are no optimal solution. So, i try to pack as many as possible (taking this website as reference):
1) First, I tried to place them in rectangular pattern:
- I had the width 257/d (diameter) -> I got about 72.024 --> So along the width, i can place 72 circle.
- I had the height 157/d (diameter) -> I got about 43.999 --> So along the height, i can place 43 circle.
--> That means in this case, i can fit in 43*72= 3096 circles
2) Then I try triangular pattern, which can fit more circles, 3575 circles. However, I find my math calculation kinda inefficient, long, and not correct in any other cases.
So my question is: Did I calculate it in a correct way? Are there any other more effective calculation methods?
Because in later question, it asks me to find the area of the circle to so that we get the maximum profit. Giving the profit of each circle is: P(a) = 200 - 200/a (a is the area of the circle)
calculus packing-problem
calculus packing-problem
asked Dec 3 '17 at 6:48
Thiên BảoThiên Bảo
2112
2112
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24
add a comment |
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Consider the following diagram of a triangular packing:
If the circles have radius $r$, then each pair of horizontal red lines is a distance $r$ apart, and they're a distance $r$ from the edges. Each pair of vertical blue lines is a distance $r sqrt 3$ apart, and they're still a distance $r$ from the edges.
So if you want the triangular packing to have $m$ circles in each column, and $n$ columns, then the rectangle must be at least $(2m+1) cdot r$ units tall and $(2 + (n-1)sqrt3) cdot r$ units long. (Also, if the rectangle is only $2m cdot r$ units tall, we can alternate columns with $m$ and $m-1$ circles.)
If the rectangle is $257 times 157$ and the radius of a circle is $sqrt{frac{10}{pi}}$, then:
- If we make $257$ the vertical dimension, then the rectangle is a bit over $144 cdot r$ units tall, and a bit over $(2 + 49sqrt3) cdot r$ units wide. So we can arrange the circles in $50$ columns that alternate between $72$ and $71$ circles, for $25 cdot 72 + 25 cdot 71 = 3575$ circles.
- If we make $157$ the vertical dimension, then the rectangle is a bit over $87 cdot r$ units tall, and a bit over $(2 + 82sqrt3) cdot r$ units wide. So we can arrange the circles in $83$ columns that have $43$ circles each, for $3569$ circles.
We pick the first option, which gave us the greater value.
If you want to know the exact number of circles that can fit, there is nothing better to be done than this calculation. But you can estimate the number of circles that will fit by knowing that the limiting density of the triangular packing is $frac{pi}{2sqrt 3}$.
The $257 times 157$ rectangle has area $40349$, but at most a $frac{pi}{2sqrt 3}$ fraction of that area can be used: at most area $frac{40349 pi}{2sqrt 3} approx 36592.5$. If all circles have area $10$, then at most $3659$ circles can fit in that area. As you can see, this is an overestimate, because we aren't using the space around the edges of the packing as efficiently as possible.
$endgroup$
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2548513%2fmaximum-number-of-circle-packing-into-a-rectangle%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Consider the following diagram of a triangular packing:
If the circles have radius $r$, then each pair of horizontal red lines is a distance $r$ apart, and they're a distance $r$ from the edges. Each pair of vertical blue lines is a distance $r sqrt 3$ apart, and they're still a distance $r$ from the edges.
So if you want the triangular packing to have $m$ circles in each column, and $n$ columns, then the rectangle must be at least $(2m+1) cdot r$ units tall and $(2 + (n-1)sqrt3) cdot r$ units long. (Also, if the rectangle is only $2m cdot r$ units tall, we can alternate columns with $m$ and $m-1$ circles.)
If the rectangle is $257 times 157$ and the radius of a circle is $sqrt{frac{10}{pi}}$, then:
- If we make $257$ the vertical dimension, then the rectangle is a bit over $144 cdot r$ units tall, and a bit over $(2 + 49sqrt3) cdot r$ units wide. So we can arrange the circles in $50$ columns that alternate between $72$ and $71$ circles, for $25 cdot 72 + 25 cdot 71 = 3575$ circles.
- If we make $157$ the vertical dimension, then the rectangle is a bit over $87 cdot r$ units tall, and a bit over $(2 + 82sqrt3) cdot r$ units wide. So we can arrange the circles in $83$ columns that have $43$ circles each, for $3569$ circles.
We pick the first option, which gave us the greater value.
If you want to know the exact number of circles that can fit, there is nothing better to be done than this calculation. But you can estimate the number of circles that will fit by knowing that the limiting density of the triangular packing is $frac{pi}{2sqrt 3}$.
The $257 times 157$ rectangle has area $40349$, but at most a $frac{pi}{2sqrt 3}$ fraction of that area can be used: at most area $frac{40349 pi}{2sqrt 3} approx 36592.5$. If all circles have area $10$, then at most $3659$ circles can fit in that area. As you can see, this is an overestimate, because we aren't using the space around the edges of the packing as efficiently as possible.
$endgroup$
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
add a comment |
$begingroup$
Consider the following diagram of a triangular packing:
If the circles have radius $r$, then each pair of horizontal red lines is a distance $r$ apart, and they're a distance $r$ from the edges. Each pair of vertical blue lines is a distance $r sqrt 3$ apart, and they're still a distance $r$ from the edges.
So if you want the triangular packing to have $m$ circles in each column, and $n$ columns, then the rectangle must be at least $(2m+1) cdot r$ units tall and $(2 + (n-1)sqrt3) cdot r$ units long. (Also, if the rectangle is only $2m cdot r$ units tall, we can alternate columns with $m$ and $m-1$ circles.)
If the rectangle is $257 times 157$ and the radius of a circle is $sqrt{frac{10}{pi}}$, then:
- If we make $257$ the vertical dimension, then the rectangle is a bit over $144 cdot r$ units tall, and a bit over $(2 + 49sqrt3) cdot r$ units wide. So we can arrange the circles in $50$ columns that alternate between $72$ and $71$ circles, for $25 cdot 72 + 25 cdot 71 = 3575$ circles.
- If we make $157$ the vertical dimension, then the rectangle is a bit over $87 cdot r$ units tall, and a bit over $(2 + 82sqrt3) cdot r$ units wide. So we can arrange the circles in $83$ columns that have $43$ circles each, for $3569$ circles.
We pick the first option, which gave us the greater value.
If you want to know the exact number of circles that can fit, there is nothing better to be done than this calculation. But you can estimate the number of circles that will fit by knowing that the limiting density of the triangular packing is $frac{pi}{2sqrt 3}$.
The $257 times 157$ rectangle has area $40349$, but at most a $frac{pi}{2sqrt 3}$ fraction of that area can be used: at most area $frac{40349 pi}{2sqrt 3} approx 36592.5$. If all circles have area $10$, then at most $3659$ circles can fit in that area. As you can see, this is an overestimate, because we aren't using the space around the edges of the packing as efficiently as possible.
$endgroup$
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
add a comment |
$begingroup$
Consider the following diagram of a triangular packing:
If the circles have radius $r$, then each pair of horizontal red lines is a distance $r$ apart, and they're a distance $r$ from the edges. Each pair of vertical blue lines is a distance $r sqrt 3$ apart, and they're still a distance $r$ from the edges.
So if you want the triangular packing to have $m$ circles in each column, and $n$ columns, then the rectangle must be at least $(2m+1) cdot r$ units tall and $(2 + (n-1)sqrt3) cdot r$ units long. (Also, if the rectangle is only $2m cdot r$ units tall, we can alternate columns with $m$ and $m-1$ circles.)
If the rectangle is $257 times 157$ and the radius of a circle is $sqrt{frac{10}{pi}}$, then:
- If we make $257$ the vertical dimension, then the rectangle is a bit over $144 cdot r$ units tall, and a bit over $(2 + 49sqrt3) cdot r$ units wide. So we can arrange the circles in $50$ columns that alternate between $72$ and $71$ circles, for $25 cdot 72 + 25 cdot 71 = 3575$ circles.
- If we make $157$ the vertical dimension, then the rectangle is a bit over $87 cdot r$ units tall, and a bit over $(2 + 82sqrt3) cdot r$ units wide. So we can arrange the circles in $83$ columns that have $43$ circles each, for $3569$ circles.
We pick the first option, which gave us the greater value.
If you want to know the exact number of circles that can fit, there is nothing better to be done than this calculation. But you can estimate the number of circles that will fit by knowing that the limiting density of the triangular packing is $frac{pi}{2sqrt 3}$.
The $257 times 157$ rectangle has area $40349$, but at most a $frac{pi}{2sqrt 3}$ fraction of that area can be used: at most area $frac{40349 pi}{2sqrt 3} approx 36592.5$. If all circles have area $10$, then at most $3659$ circles can fit in that area. As you can see, this is an overestimate, because we aren't using the space around the edges of the packing as efficiently as possible.
$endgroup$
Consider the following diagram of a triangular packing:
If the circles have radius $r$, then each pair of horizontal red lines is a distance $r$ apart, and they're a distance $r$ from the edges. Each pair of vertical blue lines is a distance $r sqrt 3$ apart, and they're still a distance $r$ from the edges.
So if you want the triangular packing to have $m$ circles in each column, and $n$ columns, then the rectangle must be at least $(2m+1) cdot r$ units tall and $(2 + (n-1)sqrt3) cdot r$ units long. (Also, if the rectangle is only $2m cdot r$ units tall, we can alternate columns with $m$ and $m-1$ circles.)
If the rectangle is $257 times 157$ and the radius of a circle is $sqrt{frac{10}{pi}}$, then:
- If we make $257$ the vertical dimension, then the rectangle is a bit over $144 cdot r$ units tall, and a bit over $(2 + 49sqrt3) cdot r$ units wide. So we can arrange the circles in $50$ columns that alternate between $72$ and $71$ circles, for $25 cdot 72 + 25 cdot 71 = 3575$ circles.
- If we make $157$ the vertical dimension, then the rectangle is a bit over $87 cdot r$ units tall, and a bit over $(2 + 82sqrt3) cdot r$ units wide. So we can arrange the circles in $83$ columns that have $43$ circles each, for $3569$ circles.
We pick the first option, which gave us the greater value.
If you want to know the exact number of circles that can fit, there is nothing better to be done than this calculation. But you can estimate the number of circles that will fit by knowing that the limiting density of the triangular packing is $frac{pi}{2sqrt 3}$.
The $257 times 157$ rectangle has area $40349$, but at most a $frac{pi}{2sqrt 3}$ fraction of that area can be used: at most area $frac{40349 pi}{2sqrt 3} approx 36592.5$. If all circles have area $10$, then at most $3659$ circles can fit in that area. As you can see, this is an overestimate, because we aren't using the space around the edges of the packing as efficiently as possible.
answered Dec 3 '17 at 8:23
Misha LavrovMisha Lavrov
48.1k657107
48.1k657107
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
add a comment |
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Thank you so much for your answer. So this would be the only method to find the accurate value. However, it's great to know the 'limiting density' part, big help, :D even though i don't fully understand about it.
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:45
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
Would you mind sharing the website or anywhere that i can that information?
$endgroup$
– Thiên Bảo
Dec 3 '17 at 12:56
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
$begingroup$
See mathworld.wolfram.com/CirclePacking.html.
$endgroup$
– Misha Lavrov
Dec 3 '17 at 17:59
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2548513%2fmaximum-number-of-circle-packing-into-a-rectangle%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
See my answer regarding a similar question: math.stackexchange.com/questions/701/…
$endgroup$
– Paul McErlean
Mar 11 '18 at 1:24