Verify if $n$ dimensional spheres intersect
$begingroup$
Consider $x_1,dots,x_n$ vectors lying in $mathbb{R}^n$. Also, consider positive numbers $alpha_1,dots,alpha_n$. Consider $n$ spheres with center as $x_i$ and radii $alpha_i$. How do I check the set of solutions to the set of equations
begin{align}
||x-x_i||_2 = alpha_i~,~ forall i
end{align}
is non-empty. Is this problem studied in literature?
real-analysis linear-algebra geometry
$endgroup$
add a comment |
$begingroup$
Consider $x_1,dots,x_n$ vectors lying in $mathbb{R}^n$. Also, consider positive numbers $alpha_1,dots,alpha_n$. Consider $n$ spheres with center as $x_i$ and radii $alpha_i$. How do I check the set of solutions to the set of equations
begin{align}
||x-x_i||_2 = alpha_i~,~ forall i
end{align}
is non-empty. Is this problem studied in literature?
real-analysis linear-algebra geometry
$endgroup$
2
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
1
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49
add a comment |
$begingroup$
Consider $x_1,dots,x_n$ vectors lying in $mathbb{R}^n$. Also, consider positive numbers $alpha_1,dots,alpha_n$. Consider $n$ spheres with center as $x_i$ and radii $alpha_i$. How do I check the set of solutions to the set of equations
begin{align}
||x-x_i||_2 = alpha_i~,~ forall i
end{align}
is non-empty. Is this problem studied in literature?
real-analysis linear-algebra geometry
$endgroup$
Consider $x_1,dots,x_n$ vectors lying in $mathbb{R}^n$. Also, consider positive numbers $alpha_1,dots,alpha_n$. Consider $n$ spheres with center as $x_i$ and radii $alpha_i$. How do I check the set of solutions to the set of equations
begin{align}
||x-x_i||_2 = alpha_i~,~ forall i
end{align}
is non-empty. Is this problem studied in literature?
real-analysis linear-algebra geometry
real-analysis linear-algebra geometry
edited Feb 2 at 12:53
dineshdileep
asked Feb 2 at 12:39
dineshdileepdineshdileep
6,03611935
6,03611935
2
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
1
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49
add a comment |
2
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
1
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49
2
2
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
1
1
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The question is well-studied. For example, you can read this.
One of the methods works like this:
Rewrite your equation as
$$
2x_ix = x^2 +x_i^2 - alpha_i^2.
$$
Find $x$ in form $x=ru+v$, where $r=x^2$, $u$ is the solution of $2x_iu=1$, $v$ is the solution of $2x_iv=x_i^2-alpha_i^2$. Then
$$
r=x^2=(ru+v)^2=r^2u^2+2uv r+v^2
$$
is a quadratic equation on $r$. If this equation has roots, then your $n$ spheres have a common point.
$endgroup$
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
add a comment |
Your Answer
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%2f3097254%2fverify-if-n-dimensional-spheres-intersect%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$
The question is well-studied. For example, you can read this.
One of the methods works like this:
Rewrite your equation as
$$
2x_ix = x^2 +x_i^2 - alpha_i^2.
$$
Find $x$ in form $x=ru+v$, where $r=x^2$, $u$ is the solution of $2x_iu=1$, $v$ is the solution of $2x_iv=x_i^2-alpha_i^2$. Then
$$
r=x^2=(ru+v)^2=r^2u^2+2uv r+v^2
$$
is a quadratic equation on $r$. If this equation has roots, then your $n$ spheres have a common point.
$endgroup$
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
add a comment |
$begingroup$
The question is well-studied. For example, you can read this.
One of the methods works like this:
Rewrite your equation as
$$
2x_ix = x^2 +x_i^2 - alpha_i^2.
$$
Find $x$ in form $x=ru+v$, where $r=x^2$, $u$ is the solution of $2x_iu=1$, $v$ is the solution of $2x_iv=x_i^2-alpha_i^2$. Then
$$
r=x^2=(ru+v)^2=r^2u^2+2uv r+v^2
$$
is a quadratic equation on $r$. If this equation has roots, then your $n$ spheres have a common point.
$endgroup$
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
add a comment |
$begingroup$
The question is well-studied. For example, you can read this.
One of the methods works like this:
Rewrite your equation as
$$
2x_ix = x^2 +x_i^2 - alpha_i^2.
$$
Find $x$ in form $x=ru+v$, where $r=x^2$, $u$ is the solution of $2x_iu=1$, $v$ is the solution of $2x_iv=x_i^2-alpha_i^2$. Then
$$
r=x^2=(ru+v)^2=r^2u^2+2uv r+v^2
$$
is a quadratic equation on $r$. If this equation has roots, then your $n$ spheres have a common point.
$endgroup$
The question is well-studied. For example, you can read this.
One of the methods works like this:
Rewrite your equation as
$$
2x_ix = x^2 +x_i^2 - alpha_i^2.
$$
Find $x$ in form $x=ru+v$, where $r=x^2$, $u$ is the solution of $2x_iu=1$, $v$ is the solution of $2x_iv=x_i^2-alpha_i^2$. Then
$$
r=x^2=(ru+v)^2=r^2u^2+2uv r+v^2
$$
is a quadratic equation on $r$. If this equation has roots, then your $n$ spheres have a common point.
answered Feb 2 at 13:14
Vasily MitchVasily Mitch
2,6791312
2,6791312
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
add a comment |
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
Does this work for vectors?
$endgroup$
– dineshdileep
Feb 3 at 5:06
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
$begingroup$
It is vector equations
$endgroup$
– Vasily Mitch
Feb 3 at 10:26
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%2f3097254%2fverify-if-n-dimensional-spheres-intersect%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
2
$begingroup$
Why can't you take an arbitrary $x_0$ and use $alpha_i = |x_0-x_i|$?
$endgroup$
– Vasily Mitch
Feb 2 at 12:42
1
$begingroup$
Another even more brutal solution : let M= maximal distance $|x_i-x_j|$. Then take all $alpha_i=M$...
$endgroup$
– Jean Marie
Feb 2 at 12:45
$begingroup$
@VasilyMitch I see your point, thanks. This is not what I actually wanted. Let me rewrite the question
$endgroup$
– dineshdileep
Feb 2 at 12:49