Find intersection area of a diamond and movable/resizable square or rectangle.
$begingroup$
I am creating a program in which I have to crop the area intersected by movable and resizable rectangle in a diamond.
to achieve this I need a formula which will give me all the vertices of the intersection of "diamond and square".
I have x,y and height,width of square and diamond.
I need a formula for below condition.
- If red square intersects diamond then I need all the points of vertices of the intersection of "diamond and square".
- If they don't intersect I just need a flag (true or false).
There can be many possible conditions few of them are described in below image.
trigonometry intersection-theory
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
$endgroup$
add a comment |
$begingroup$
I am creating a program in which I have to crop the area intersected by movable and resizable rectangle in a diamond.
to achieve this I need a formula which will give me all the vertices of the intersection of "diamond and square".
I have x,y and height,width of square and diamond.
I need a formula for below condition.
- If red square intersects diamond then I need all the points of vertices of the intersection of "diamond and square".
- If they don't intersect I just need a flag (true or false).
There can be many possible conditions few of them are described in below image.
trigonometry intersection-theory
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
$endgroup$
$begingroup$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23
add a comment |
$begingroup$
I am creating a program in which I have to crop the area intersected by movable and resizable rectangle in a diamond.
to achieve this I need a formula which will give me all the vertices of the intersection of "diamond and square".
I have x,y and height,width of square and diamond.
I need a formula for below condition.
- If red square intersects diamond then I need all the points of vertices of the intersection of "diamond and square".
- If they don't intersect I just need a flag (true or false).
There can be many possible conditions few of them are described in below image.
trigonometry intersection-theory
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
$endgroup$
I am creating a program in which I have to crop the area intersected by movable and resizable rectangle in a diamond.
to achieve this I need a formula which will give me all the vertices of the intersection of "diamond and square".
I have x,y and height,width of square and diamond.
I need a formula for below condition.
- If red square intersects diamond then I need all the points of vertices of the intersection of "diamond and square".
- If they don't intersect I just need a flag (true or false).
There can be many possible conditions few of them are described in below image.
trigonometry intersection-theory
trigonometry intersection-theory
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
edited Jan 8 at 6:14
Govind Prajapati
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
asked Jan 8 at 5:38
Govind PrajapatiGovind Prajapati
1012
1012
$begingroup$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23
add a comment |
$begingroup$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23
$begingroup$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23
$begingroup$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23
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%2f3065837%2ffind-intersection-area-of-a-diamond-and-movable-resizable-square-or-rectangle%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%2f3065837%2ffind-intersection-area-of-a-diamond-and-movable-resizable-square-or-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$
A program can take advantage of breaking down the problem into cases. So a single formula is not as practical as goods ways to consider cases that cover all possibilities. I'd have a look at Questions on StackOverfow that concern collision detection for related ideas.
$endgroup$
– hardmath
Jan 9 at 1:23