Existing of non-intersecting raysConstructing a circle through a point in the interior of an angleHow many...
Why is so much work done on numerical verification of the Riemann Hypothesis?
Why does the Sun have different day lengths, but not the gas giants?
Is there a working SACD iso player for Ubuntu?
What is the evidence for the "tyranny of the majority problem" in a direct democracy context?
Closed-form expression for certain product
The screen of my macbook suddenly broken down how can I do to recover
What if a revenant (monster) gains fire resistance?
Strong empirical falsification of quantum mechanics based on vacuum energy density
How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?
Existing of non-intersecting rays
How could a planet have erratic days?
The IT department bottlenecks progress. How should I handle this?
What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?
How do I color the graph in datavisualization?
Drawing ramified coverings with tikz
Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?
If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?
Where does the bonus feat in the cleric starting package come from?
How to implement a feedback to keep the DC gain at zero for this conceptual passive filter?
Create all possible words using a set or letters
Should I stop contributing to retirement accounts?
Why electric field inside a cavity of a non-conducting sphere not zero?
Not using 's' for he/she/it
Biological Blimps: Propulsion
Existing of non-intersecting rays
Constructing a circle through a point in the interior of an angleHow many rays can made from $4$ collinear points?Angle between different rays (3d line segments) and computing their angular relationshipsIntersecting three rays and a sphere of known radiusDesigning a distance function between raysLines between point and sphere surface intersecting a planeIntersecting planes stereometry problemIs a single line, line segment, or ray a valid angle?Coxeter, Introduction to Geometry, ordered geometry, parallelism of rays and linesNon-congruent angle of an isosceles triangle
$begingroup$
Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.
But how to prove this?
geometry
$endgroup$
add a comment |
$begingroup$
Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.
But how to prove this?
geometry
$endgroup$
add a comment |
$begingroup$
Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.
But how to prove this?
geometry
$endgroup$
Given $n$ points on a plane, it seems intuitive that it’s possible to draw a ray (half-line) from each point s. t. the $n$ rays do not intersect.
But how to prove this?
geometry
geometry
asked 26 mins ago
athosathos
98611340
98611340
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.
One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.
$endgroup$
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
add a comment |
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%2f3160029%2fexisting-of-non-intersecting-rays%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$
Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.
One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.
$endgroup$
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
add a comment |
$begingroup$
Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.
One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.
$endgroup$
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
add a comment |
$begingroup$
Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.
One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.
$endgroup$
Pick any point $P$ in the plane that is not on a line containing two or more of the given $n$ points. At each point, draw the ray in the direction away from $P$.
One can in fact do better: It is possible to draw lines through all $n$ points that do not intersect. Choose an orientation that is not parallel to any of the lines between any two of the given points, and draw parallel lines in that orientation through each point.
edited 8 mins ago
answered 14 mins ago
FredHFredH
2,6041021
2,6041021
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
add a comment |
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
+1 for being slightly faster than me :)
$endgroup$
– Severin Schraven
14 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
$begingroup$
Thx ! This is a “oh of course “ moment of me
$endgroup$
– athos
13 mins ago
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%2f3160029%2fexisting-of-non-intersecting-rays%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