Estimate coordinates of vertices
Let $hat{t}$ be the reference triangle with the vertices $hat{A_1} = (0,0)$, $hat{A_2} = (1,0)$, $hat{A_3} = (0,1)$ and let $t$ be the triangle with the vertices $A_1 = (0,0)$, $A_2 = (h_1, 0)$ and $A_3 = (0, h_2)$. Let $hat{u} := u circ F_t$, where $F_t: hat{t} to t$ denotes the affine map with $F_t(hat{A_i}) = A_i$ for i = 1, 2, 3.
What can we say about the constant $C$ in $$max {h_1^{-1}, h_2^{-1} } leq C h_t^{-1}$$
where $h_t$ is the diameter of the triangle $t$ ?
(I think the best would be to express $C$ in terms of the shape-regularity constant.)
What I've done so far:
The triangle $t$ is rectangular and we know that $h_t = sqrt{h_1^2 + h_2^2}$.
We want to find a $C$ such that $max{h_1^{-1}, h_2^{-1}} leq C h_t^{-1} = frac{C}{sqrt{h_1^2+h_2^2}}$
But...am I wrong or did I missunderstand something? Because such a $C$ can not exist, if, for example, $0 leq h_1 leq 1$ and $h_2 = 1$, then $max{h_1^{-1}, h_2^{-1}} = frac{1}{h_1} to infty$ if $h_1$ goes to $0$.
But the task is as described above, so I think that I'm wrong and did a mistake. But where?
Thanks for any help!
linear-algebra geometry numerical-methods triangulation
add a comment |
Let $hat{t}$ be the reference triangle with the vertices $hat{A_1} = (0,0)$, $hat{A_2} = (1,0)$, $hat{A_3} = (0,1)$ and let $t$ be the triangle with the vertices $A_1 = (0,0)$, $A_2 = (h_1, 0)$ and $A_3 = (0, h_2)$. Let $hat{u} := u circ F_t$, where $F_t: hat{t} to t$ denotes the affine map with $F_t(hat{A_i}) = A_i$ for i = 1, 2, 3.
What can we say about the constant $C$ in $$max {h_1^{-1}, h_2^{-1} } leq C h_t^{-1}$$
where $h_t$ is the diameter of the triangle $t$ ?
(I think the best would be to express $C$ in terms of the shape-regularity constant.)
What I've done so far:
The triangle $t$ is rectangular and we know that $h_t = sqrt{h_1^2 + h_2^2}$.
We want to find a $C$ such that $max{h_1^{-1}, h_2^{-1}} leq C h_t^{-1} = frac{C}{sqrt{h_1^2+h_2^2}}$
But...am I wrong or did I missunderstand something? Because such a $C$ can not exist, if, for example, $0 leq h_1 leq 1$ and $h_2 = 1$, then $max{h_1^{-1}, h_2^{-1}} = frac{1}{h_1} to infty$ if $h_1$ goes to $0$.
But the task is as described above, so I think that I'm wrong and did a mistake. But where?
Thanks for any help!
linear-algebra geometry numerical-methods triangulation
add a comment |
Let $hat{t}$ be the reference triangle with the vertices $hat{A_1} = (0,0)$, $hat{A_2} = (1,0)$, $hat{A_3} = (0,1)$ and let $t$ be the triangle with the vertices $A_1 = (0,0)$, $A_2 = (h_1, 0)$ and $A_3 = (0, h_2)$. Let $hat{u} := u circ F_t$, where $F_t: hat{t} to t$ denotes the affine map with $F_t(hat{A_i}) = A_i$ for i = 1, 2, 3.
What can we say about the constant $C$ in $$max {h_1^{-1}, h_2^{-1} } leq C h_t^{-1}$$
where $h_t$ is the diameter of the triangle $t$ ?
(I think the best would be to express $C$ in terms of the shape-regularity constant.)
What I've done so far:
The triangle $t$ is rectangular and we know that $h_t = sqrt{h_1^2 + h_2^2}$.
We want to find a $C$ such that $max{h_1^{-1}, h_2^{-1}} leq C h_t^{-1} = frac{C}{sqrt{h_1^2+h_2^2}}$
But...am I wrong or did I missunderstand something? Because such a $C$ can not exist, if, for example, $0 leq h_1 leq 1$ and $h_2 = 1$, then $max{h_1^{-1}, h_2^{-1}} = frac{1}{h_1} to infty$ if $h_1$ goes to $0$.
But the task is as described above, so I think that I'm wrong and did a mistake. But where?
Thanks for any help!
linear-algebra geometry numerical-methods triangulation
Let $hat{t}$ be the reference triangle with the vertices $hat{A_1} = (0,0)$, $hat{A_2} = (1,0)$, $hat{A_3} = (0,1)$ and let $t$ be the triangle with the vertices $A_1 = (0,0)$, $A_2 = (h_1, 0)$ and $A_3 = (0, h_2)$. Let $hat{u} := u circ F_t$, where $F_t: hat{t} to t$ denotes the affine map with $F_t(hat{A_i}) = A_i$ for i = 1, 2, 3.
What can we say about the constant $C$ in $$max {h_1^{-1}, h_2^{-1} } leq C h_t^{-1}$$
where $h_t$ is the diameter of the triangle $t$ ?
(I think the best would be to express $C$ in terms of the shape-regularity constant.)
What I've done so far:
The triangle $t$ is rectangular and we know that $h_t = sqrt{h_1^2 + h_2^2}$.
We want to find a $C$ such that $max{h_1^{-1}, h_2^{-1}} leq C h_t^{-1} = frac{C}{sqrt{h_1^2+h_2^2}}$
But...am I wrong or did I missunderstand something? Because such a $C$ can not exist, if, for example, $0 leq h_1 leq 1$ and $h_2 = 1$, then $max{h_1^{-1}, h_2^{-1}} = frac{1}{h_1} to infty$ if $h_1$ goes to $0$.
But the task is as described above, so I think that I'm wrong and did a mistake. But where?
Thanks for any help!
linear-algebra geometry numerical-methods triangulation
linear-algebra geometry numerical-methods triangulation
asked Nov 20 '18 at 13:04
StMan
1387
1387
add a comment |
add a comment |
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%2f3006281%2festimate-coordinates-of-vertices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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%2fmath.stackexchange.com%2fquestions%2f3006281%2festimate-coordinates-of-vertices%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