Euclidean N-D Space to Model Great-Circle Distances
$begingroup$
Assuming you have a graph and know the distances between the points.
You know that they can roughly be modeled as points on the 2D surface of a sphere by treating the distances as great-circle or orthodromic distances, but not quite.
How effectively could we use an euclidean N-D space to model great-circle distances?
I guess my question would be answered by a graph/chart that plots the deviation/error by distance and dimension.
linear-algebra graph-theory spherical-geometry
$endgroup$
add a comment |
$begingroup$
Assuming you have a graph and know the distances between the points.
You know that they can roughly be modeled as points on the 2D surface of a sphere by treating the distances as great-circle or orthodromic distances, but not quite.
How effectively could we use an euclidean N-D space to model great-circle distances?
I guess my question would be answered by a graph/chart that plots the deviation/error by distance and dimension.
linear-algebra graph-theory spherical-geometry
$endgroup$
1
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10
add a comment |
$begingroup$
Assuming you have a graph and know the distances between the points.
You know that they can roughly be modeled as points on the 2D surface of a sphere by treating the distances as great-circle or orthodromic distances, but not quite.
How effectively could we use an euclidean N-D space to model great-circle distances?
I guess my question would be answered by a graph/chart that plots the deviation/error by distance and dimension.
linear-algebra graph-theory spherical-geometry
$endgroup$
Assuming you have a graph and know the distances between the points.
You know that they can roughly be modeled as points on the 2D surface of a sphere by treating the distances as great-circle or orthodromic distances, but not quite.
How effectively could we use an euclidean N-D space to model great-circle distances?
I guess my question would be answered by a graph/chart that plots the deviation/error by distance and dimension.
linear-algebra graph-theory spherical-geometry
linear-algebra graph-theory spherical-geometry
asked Jan 9 at 19:12
guestguest
7017
7017
1
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10
add a comment |
1
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10
1
1
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10
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%2f3067842%2feuclidean-n-d-space-to-model-great-circle-distances%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%2f3067842%2feuclidean-n-d-space-to-model-great-circle-distances%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
1
$begingroup$
I suspect it might never work. if we set/start with the distance between north and south poles, any points on the equator will always fall on the line between north and south, i.e: all points on the equator will collapse into one point, in any dimension.
$endgroup$
– guest
Jan 9 at 19:41
$begingroup$
maybe if we use the largest regular polytope in the dimension as a sort of backbone?
$endgroup$
– guest
Jan 9 at 20:10