Mixing
Identify a point in the disc that is as far away from each point of S as possible Ask Question
$begingroup$
I have a question.The question is this.
Say you have a finite set S of n points in a circular disc. Think of the points in S as houses on a circular island. You want to locate a garbage incineration plant on the island, but of course as far away from each house as possible. How would you find the optimal placement for the plant? In other words, how would you identify a point in the disc that is as far away from each point of S as possible. Identify a set L of O(n) locations, one of which must be the optimal one
So with my researches I find these links as kind of answer.
standard raster solution
Detailed raster solution
But my problem is I did not really understand what should I use. Should I identify a random point,than check the distance of it with each point and sum them.I can do it many times,but I belive I can never be sure about if it is the farthest point to that set of points. As far as I understand from question,I can get unlimited number of points.
geometry differential-geometry optimization
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
$endgroup$
add a comment |
$begingroup$
I have a question.The question is this.
Say you have a finite set S of n points in a circular disc. Think of the points in S as houses on a circular island. You want to locate a garbage incineration plant on the island, but of course as far away from each house as possible. How would you find the optimal placement for the plant? In other words, how would you identify a point in the disc that is as far away from each point of S as possible. Identify a set L of O(n) locations, one of which must be the optimal one
So with my researches I find these links as kind of answer.
standard raster solution
Detailed raster solution
But my problem is I did not really understand what should I use. Should I identify a random point,than check the distance of it with each point and sum them.I can do it many times,but I belive I can never be sure about if it is the farthest point to that set of points. As far as I understand from question,I can get unlimited number of points.
geometry differential-geometry optimization
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
$endgroup$
$begingroup$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
1
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14
add a comment |
$begingroup$
I have a question.The question is this.
Say you have a finite set S of n points in a circular disc. Think of the points in S as houses on a circular island. You want to locate a garbage incineration plant on the island, but of course as far away from each house as possible. How would you find the optimal placement for the plant? In other words, how would you identify a point in the disc that is as far away from each point of S as possible. Identify a set L of O(n) locations, one of which must be the optimal one
So with my researches I find these links as kind of answer.
standard raster solution
Detailed raster solution
But my problem is I did not really understand what should I use. Should I identify a random point,than check the distance of it with each point and sum them.I can do it many times,but I belive I can never be sure about if it is the farthest point to that set of points. As far as I understand from question,I can get unlimited number of points.
geometry differential-geometry optimization
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
$endgroup$
I have a question.The question is this.
Say you have a finite set S of n points in a circular disc. Think of the points in S as houses on a circular island. You want to locate a garbage incineration plant on the island, but of course as far away from each house as possible. How would you find the optimal placement for the plant? In other words, how would you identify a point in the disc that is as far away from each point of S as possible. Identify a set L of O(n) locations, one of which must be the optimal one
So with my researches I find these links as kind of answer.
standard raster solution
Detailed raster solution
But my problem is I did not really understand what should I use. Should I identify a random point,than check the distance of it with each point and sum them.I can do it many times,but I belive I can never be sure about if it is the farthest point to that set of points. As far as I understand from question,I can get unlimited number of points.
geometry differential-geometry optimization
geometry differential-geometry optimization
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
edited Feb 2 at 3:51
YuiTo Cheng
2,1963937
2,1963937
asked Jan 30 at 14:13
yahya emreyahya emre
111
asked Jan 30 at 14:13
yahya emreyahya emre
111
asked Jan 30 at 14:13
yahya emreyahya emre
111
111
$begingroup$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
1
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14
add a comment |
$begingroup$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
1
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14
$begingroup$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
$begingroup$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
1
1
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14
add a comment |
0
active
oldest
votes
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%2f3093575%2fidentify-a-point-in-the-disc-that-is-as-far-away-from-each-point-of-s-as-possibl%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3093575%2fidentify-a-point-in-the-disc-that-is-as-far-away-from-each-point-of-s-as-possibl%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$
So, given a disc $D$ and points $z_1,dots, z_n$ in $D$ you wish to find a point $zin D$ such that the minimum distance $min {|z-z_i|:i=1,dots,n}$ from $z$ to $z_i$ is as big as possible, right?
$endgroup$
– Alex Ravsky
Jan 30 at 21:38
1
$begingroup$
@AlexRavsky yes. My new point should be on the disk and also as far as I got it it should be far away from each point of that set
$endgroup$
– yahya emre
Jan 31 at 0:14