Is there a space filling curve for 2D images that can guarantee maximal diagonal access time?
So I want to store a 2D image made of pixels in a 1d space filling curve to minimize up, down, left, right and diagonal Access from any given image point to its nearest in Euclidean terms neighbours. Is there such curve that can provide some form of such access speed guarantee? (Say no more than in say 10 elements is your up right neighbor for images of any size, or Something similar)?
image iteration access curve
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
add a comment |
So I want to store a 2D image made of pixels in a 1d space filling curve to minimize up, down, left, right and diagonal Access from any given image point to its nearest in Euclidean terms neighbours. Is there such curve that can provide some form of such access speed guarantee? (Say no more than in say 10 elements is your up right neighbor for images of any size, or Something similar)?
image iteration access curve
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35
add a comment |
So I want to store a 2D image made of pixels in a 1d space filling curve to minimize up, down, left, right and diagonal Access from any given image point to its nearest in Euclidean terms neighbours. Is there such curve that can provide some form of such access speed guarantee? (Say no more than in say 10 elements is your up right neighbor for images of any size, or Something similar)?
image iteration access curve
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
So I want to store a 2D image made of pixels in a 1d space filling curve to minimize up, down, left, right and diagonal Access from any given image point to its nearest in Euclidean terms neighbours. Is there such curve that can provide some form of such access speed guarantee? (Say no more than in say 10 elements is your up right neighbor for images of any size, or Something similar)?
image iteration access curve
image iteration access curve
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
edited Dec 5 '18 at 13:18
usr2564301
17.7k73370
17.7k73370
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
asked Nov 23 '18 at 2:34
DuckQueenDuckQueen
72322871
72322871
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35
add a comment |
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
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%2fstackoverflow.com%2fquestions%2f53440011%2fis-there-a-space-filling-curve-for-2d-images-that-can-guarantee-maximal-diagonal%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 Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f53440011%2fis-there-a-space-filling-curve-for-2d-images-that-can-guarantee-maximal-diagonal%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
Why? What are you hoping to gain from this that you can't get out of a standard 1D array with known width for modulo arithmetics?
– Mike 'Pomax' Kamermans
Nov 29 '18 at 19:35