Mixing
How to perfectly split a bezier curve into two curves of unequal length
$begingroup$
I couldn't find a title that didn't seem duplicate, but my question is very different from every other I could find on this site.
I have a Bezier curve, defined by 4 points. Two of those points (first and last) are "real", and the other two are control points. This is all happening in 2D space. Let's call those points p1, p2, p3 and p4.
I have a fifth 2D point, let's call it t, which is garanteed to be on the curve itself, or at least close enough for all intent and purposes. t can be anything as long as it touches the curve.
What I am trying to do is split this curve into two curves, which would be linked together at point t, and when drawn together, would be exactly the same as the original curve
Let's call those two curves a and b, with points a1, a2, a3, a4, b1, b2, b3, b4.
Please forgive the slight differences, this was done in paint. I want perfect equivalency in the final result.
Now, a few of the components of the answer are obvious.
a1 = p1
a4 = b1 = t
b4 = p4
What I am having trouble with, specifically, is finding a2, a3, b2 and b3.
What I did so far
I have figured out that the line segments a3-t and t-b2 should be perfectly parallel, and should be tangent to the curve at point t. I could not figure out how to get this tangent, nor how to determine the length of those segments, so I can't pinpoint the exact location of a3 and b2.
I could figure out how to get the tangent at a point, provided I know exactly how far along the curve my point is (u = [0,1], 0 being right at the start, 0.5 in the middle, etc), thanks to this page. I was unfortunately unable to figure out this value u from my point t.
I could also figure out that the segment a1-a2 should be perfectly parallel to p1-p2 (same goes for b3-b4 and p3-p4). I was not able to figure out how to determine the length of this segment.
I also noticed that all control points, to get the same results, are much closer to the curves after the split than they were before. This seems to suggest that the length of the control segments are somehow determined by a relation between the length of the original control segments and u, since u is always lower than 1 (unless i split on the very end of the curve). In my example, it is obvious that u < 0.5, and the control segments of a are smaller than those of b.
So with everything I know right now, I am confident that I could get my answer to the question if somebody could explain those points:
- How to find u (distance [0,1] where t is along the curve) from my parameters.
- How to find the lengths of a3-a4 and b1-b2. (probably related to u)
- How to find the lengths of a1-a2 and b3-b4. (probably related to u)
bezier-curve
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
$endgroup$
add a comment |
$begingroup$
I couldn't find a title that didn't seem duplicate, but my question is very different from every other I could find on this site.
I have a Bezier curve, defined by 4 points. Two of those points (first and last) are "real", and the other two are control points. This is all happening in 2D space. Let's call those points p1, p2, p3 and p4.
I have a fifth 2D point, let's call it t, which is garanteed to be on the curve itself, or at least close enough for all intent and purposes. t can be anything as long as it touches the curve.
What I am trying to do is split this curve into two curves, which would be linked together at point t, and when drawn together, would be exactly the same as the original curve
Let's call those two curves a and b, with points a1, a2, a3, a4, b1, b2, b3, b4.
Please forgive the slight differences, this was done in paint. I want perfect equivalency in the final result.
Now, a few of the components of the answer are obvious.
a1 = p1
a4 = b1 = t
b4 = p4
What I am having trouble with, specifically, is finding a2, a3, b2 and b3.
What I did so far
I have figured out that the line segments a3-t and t-b2 should be perfectly parallel, and should be tangent to the curve at point t. I could not figure out how to get this tangent, nor how to determine the length of those segments, so I can't pinpoint the exact location of a3 and b2.
I could figure out how to get the tangent at a point, provided I know exactly how far along the curve my point is (u = [0,1], 0 being right at the start, 0.5 in the middle, etc), thanks to this page. I was unfortunately unable to figure out this value u from my point t.
I could also figure out that the segment a1-a2 should be perfectly parallel to p1-p2 (same goes for b3-b4 and p3-p4). I was not able to figure out how to determine the length of this segment.
I also noticed that all control points, to get the same results, are much closer to the curves after the split than they were before. This seems to suggest that the length of the control segments are somehow determined by a relation between the length of the original control segments and u, since u is always lower than 1 (unless i split on the very end of the curve). In my example, it is obvious that u < 0.5, and the control segments of a are smaller than those of b.
So with everything I know right now, I am confident that I could get my answer to the question if somebody could explain those points:
- How to find u (distance [0,1] where t is along the curve) from my parameters.
- How to find the lengths of a3-a4 and b1-b2. (probably related to u)
- How to find the lengths of a1-a2 and b3-b4. (probably related to u)
bezier-curve
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
$endgroup$
add a comment |
$begingroup$
I couldn't find a title that didn't seem duplicate, but my question is very different from every other I could find on this site.
I have a Bezier curve, defined by 4 points. Two of those points (first and last) are "real", and the other two are control points. This is all happening in 2D space. Let's call those points p1, p2, p3 and p4.
I have a fifth 2D point, let's call it t, which is garanteed to be on the curve itself, or at least close enough for all intent and purposes. t can be anything as long as it touches the curve.
What I am trying to do is split this curve into two curves, which would be linked together at point t, and when drawn together, would be exactly the same as the original curve
Let's call those two curves a and b, with points a1, a2, a3, a4, b1, b2, b3, b4.
Please forgive the slight differences, this was done in paint. I want perfect equivalency in the final result.
Now, a few of the components of the answer are obvious.
a1 = p1
a4 = b1 = t
b4 = p4
What I am having trouble with, specifically, is finding a2, a3, b2 and b3.
What I did so far
I have figured out that the line segments a3-t and t-b2 should be perfectly parallel, and should be tangent to the curve at point t. I could not figure out how to get this tangent, nor how to determine the length of those segments, so I can't pinpoint the exact location of a3 and b2.
I could figure out how to get the tangent at a point, provided I know exactly how far along the curve my point is (u = [0,1], 0 being right at the start, 0.5 in the middle, etc), thanks to this page. I was unfortunately unable to figure out this value u from my point t.
I could also figure out that the segment a1-a2 should be perfectly parallel to p1-p2 (same goes for b3-b4 and p3-p4). I was not able to figure out how to determine the length of this segment.
I also noticed that all control points, to get the same results, are much closer to the curves after the split than they were before. This seems to suggest that the length of the control segments are somehow determined by a relation between the length of the original control segments and u, since u is always lower than 1 (unless i split on the very end of the curve). In my example, it is obvious that u < 0.5, and the control segments of a are smaller than those of b.
So with everything I know right now, I am confident that I could get my answer to the question if somebody could explain those points:
- How to find u (distance [0,1] where t is along the curve) from my parameters.
- How to find the lengths of a3-a4 and b1-b2. (probably related to u)
- How to find the lengths of a1-a2 and b3-b4. (probably related to u)
bezier-curve
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
$endgroup$
I couldn't find a title that didn't seem duplicate, but my question is very different from every other I could find on this site.
I have a Bezier curve, defined by 4 points. Two of those points (first and last) are "real", and the other two are control points. This is all happening in 2D space. Let's call those points p1, p2, p3 and p4.
I have a fifth 2D point, let's call it t, which is garanteed to be on the curve itself, or at least close enough for all intent and purposes. t can be anything as long as it touches the curve.
What I am trying to do is split this curve into two curves, which would be linked together at point t, and when drawn together, would be exactly the same as the original curve
Let's call those two curves a and b, with points a1, a2, a3, a4, b1, b2, b3, b4.
Please forgive the slight differences, this was done in paint. I want perfect equivalency in the final result.
Now, a few of the components of the answer are obvious.
a1 = p1
a4 = b1 = t
b4 = p4
What I am having trouble with, specifically, is finding a2, a3, b2 and b3.
What I did so far
I have figured out that the line segments a3-t and t-b2 should be perfectly parallel, and should be tangent to the curve at point t. I could not figure out how to get this tangent, nor how to determine the length of those segments, so I can't pinpoint the exact location of a3 and b2.
I could figure out how to get the tangent at a point, provided I know exactly how far along the curve my point is (u = [0,1], 0 being right at the start, 0.5 in the middle, etc), thanks to this page. I was unfortunately unable to figure out this value u from my point t.
I could also figure out that the segment a1-a2 should be perfectly parallel to p1-p2 (same goes for b3-b4 and p3-p4). I was not able to figure out how to determine the length of this segment.
I also noticed that all control points, to get the same results, are much closer to the curves after the split than they were before. This seems to suggest that the length of the control segments are somehow determined by a relation between the length of the original control segments and u, since u is always lower than 1 (unless i split on the very end of the curve). In my example, it is obvious that u < 0.5, and the control segments of a are smaller than those of b.
So with everything I know right now, I am confident that I could get my answer to the question if somebody could explain those points:
- How to find u (distance [0,1] where t is along the curve) from my parameters.
- How to find the lengths of a3-a4 and b1-b2. (probably related to u)
- How to find the lengths of a1-a2 and b3-b4. (probably related to u)
bezier-curve
bezier-curve
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
edited Jan 29 at 14:57
Kaito Kid
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
asked Jan 29 at 14:34
Kaito KidKaito Kid
6610
6610
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The page you link discusses de Casteljau evaluation of a Bézier curve. A further page on the same site explains how this extends to de Casteljau subdivision. This allows you to split the curve into two curves at an arbitrary parameter value, so your second and third points become unnecessary, leaving just the first one:
How to find u (distance [0,1] where t is along the curve) from my parameters.
In fact, de Casteljau subdivision (combined with the convex hull property) is the simple robust way to do just about anything with Bézier curves. Split the curve into two, say at $u = 0.5$. Use the convex hull property to bound the distance between your point $t$ and the two curves. (The distance between $t$ and the nearer endpoint gives an upper bound; the distance between $t$ and the nearer edge of the convex hull gives a lower bound). Discard any curves whose lower bound is greater than the upper bound of a different curve. Split all remaining curves and repeat until the parameter range remaining is small enough.
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
$endgroup$
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
add a comment |
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%2f3092244%2fhow-to-perfectly-split-a-bezier-curve-into-two-curves-of-unequal-length%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 page you link discusses de Casteljau evaluation of a Bézier curve. A further page on the same site explains how this extends to de Casteljau subdivision. This allows you to split the curve into two curves at an arbitrary parameter value, so your second and third points become unnecessary, leaving just the first one:
How to find u (distance [0,1] where t is along the curve) from my parameters.
In fact, de Casteljau subdivision (combined with the convex hull property) is the simple robust way to do just about anything with Bézier curves. Split the curve into two, say at $u = 0.5$. Use the convex hull property to bound the distance between your point $t$ and the two curves. (The distance between $t$ and the nearer endpoint gives an upper bound; the distance between $t$ and the nearer edge of the convex hull gives a lower bound). Discard any curves whose lower bound is greater than the upper bound of a different curve. Split all remaining curves and repeat until the parameter range remaining is small enough.
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
$endgroup$
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
add a comment |
$begingroup$
The page you link discusses de Casteljau evaluation of a Bézier curve. A further page on the same site explains how this extends to de Casteljau subdivision. This allows you to split the curve into two curves at an arbitrary parameter value, so your second and third points become unnecessary, leaving just the first one:
How to find u (distance [0,1] where t is along the curve) from my parameters.
In fact, de Casteljau subdivision (combined with the convex hull property) is the simple robust way to do just about anything with Bézier curves. Split the curve into two, say at $u = 0.5$. Use the convex hull property to bound the distance between your point $t$ and the two curves. (The distance between $t$ and the nearer endpoint gives an upper bound; the distance between $t$ and the nearer edge of the convex hull gives a lower bound). Discard any curves whose lower bound is greater than the upper bound of a different curve. Split all remaining curves and repeat until the parameter range remaining is small enough.
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
$endgroup$
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
add a comment |
$begingroup$
The page you link discusses de Casteljau evaluation of a Bézier curve. A further page on the same site explains how this extends to de Casteljau subdivision. This allows you to split the curve into two curves at an arbitrary parameter value, so your second and third points become unnecessary, leaving just the first one:
How to find u (distance [0,1] where t is along the curve) from my parameters.
In fact, de Casteljau subdivision (combined with the convex hull property) is the simple robust way to do just about anything with Bézier curves. Split the curve into two, say at $u = 0.5$. Use the convex hull property to bound the distance between your point $t$ and the two curves. (The distance between $t$ and the nearer endpoint gives an upper bound; the distance between $t$ and the nearer edge of the convex hull gives a lower bound). Discard any curves whose lower bound is greater than the upper bound of a different curve. Split all remaining curves and repeat until the parameter range remaining is small enough.
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
$endgroup$
The page you link discusses de Casteljau evaluation of a Bézier curve. A further page on the same site explains how this extends to de Casteljau subdivision. This allows you to split the curve into two curves at an arbitrary parameter value, so your second and third points become unnecessary, leaving just the first one:
How to find u (distance [0,1] where t is along the curve) from my parameters.
In fact, de Casteljau subdivision (combined with the convex hull property) is the simple robust way to do just about anything with Bézier curves. Split the curve into two, say at $u = 0.5$. Use the convex hull property to bound the distance between your point $t$ and the two curves. (The distance between $t$ and the nearer endpoint gives an upper bound; the distance between $t$ and the nearer edge of the convex hull gives a lower bound). Discard any curves whose lower bound is greater than the upper bound of a different curve. Split all remaining curves and repeat until the parameter range remaining is small enough.
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
answered Jan 29 at 14:51
Peter TaylorPeter Taylor
9,15712343
9,15712343
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
add a comment |
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I managed to get it to work perfectly as I wanted with your answer and the linked page. You should probably still add the critical parts of the linked page to your answer, maybe as a quote, so that your answer remains valid, complete and relevant if the link ever goes down.
$endgroup$
– Kaito Kid
Jan 29 at 18:08
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
I linked to that page because you linked to the site in the question, so I assumed you found the style helpful. I personally don't, but there are plenty of other resources for the algorithm. In another answer on this site I just name the algorithm so that people can search for it.
$endgroup$
– Peter Taylor
Jan 29 at 21:03
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
$begingroup$
You were right in assuming the style was good enough for me to understand. As you can see, I've accepted the answer regardless. I have just seen this guideline (or suggestion?) often on stackexchange sites (If you have links in your answer, quote or paraphrase the information so that the answer works if the link goes down), so I parroted it. You're free to do as you wish :) Thanks a lot for the help
$endgroup$
– Kaito Kid
Jan 29 at 21:16
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%2f3092244%2fhow-to-perfectly-split-a-bezier-curve-into-two-curves-of-unequal-length%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
