Calculate the shortest distance from the vertex of a Schweikart triangle to the opposite side











up vote
-1
down vote

favorite












Let ∆ be an ideal triangle in the hyperbolic plane H2 with one right angle
at P and two other vertices at infinity. In other words, suppose you are given two
hyperbolic lines a and b intersecting at a right angle at P, and a third hyperbolic line c
ultraparallel to both a and b. The distance of c to P is defined as the minimum distance
of a point on c to the point P. Calculate this distance.
Can anyone give me a hint on how to tackle the problem?










share|cite|improve this question
























  • How about drawing the setup in the Poincare model?
    – Lord Shark the Unknown
    Nov 16 at 5:30










  • The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
    – David Kendell
    Nov 16 at 5:44










  • Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
    – Lee Mosher
    Nov 16 at 17:50















up vote
-1
down vote

favorite












Let ∆ be an ideal triangle in the hyperbolic plane H2 with one right angle
at P and two other vertices at infinity. In other words, suppose you are given two
hyperbolic lines a and b intersecting at a right angle at P, and a third hyperbolic line c
ultraparallel to both a and b. The distance of c to P is defined as the minimum distance
of a point on c to the point P. Calculate this distance.
Can anyone give me a hint on how to tackle the problem?










share|cite|improve this question
























  • How about drawing the setup in the Poincare model?
    – Lord Shark the Unknown
    Nov 16 at 5:30










  • The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
    – David Kendell
    Nov 16 at 5:44










  • Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
    – Lee Mosher
    Nov 16 at 17:50













up vote
-1
down vote

favorite









up vote
-1
down vote

favorite











Let ∆ be an ideal triangle in the hyperbolic plane H2 with one right angle
at P and two other vertices at infinity. In other words, suppose you are given two
hyperbolic lines a and b intersecting at a right angle at P, and a third hyperbolic line c
ultraparallel to both a and b. The distance of c to P is defined as the minimum distance
of a point on c to the point P. Calculate this distance.
Can anyone give me a hint on how to tackle the problem?










share|cite|improve this question















Let ∆ be an ideal triangle in the hyperbolic plane H2 with one right angle
at P and two other vertices at infinity. In other words, suppose you are given two
hyperbolic lines a and b intersecting at a right angle at P, and a third hyperbolic line c
ultraparallel to both a and b. The distance of c to P is defined as the minimum distance
of a point on c to the point P. Calculate this distance.
Can anyone give me a hint on how to tackle the problem?







hyperbolic-geometry






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 16 at 5:26

























asked Nov 16 at 5:21









David Kendell

42




42












  • How about drawing the setup in the Poincare model?
    – Lord Shark the Unknown
    Nov 16 at 5:30










  • The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
    – David Kendell
    Nov 16 at 5:44










  • Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
    – Lee Mosher
    Nov 16 at 17:50


















  • How about drawing the setup in the Poincare model?
    – Lord Shark the Unknown
    Nov 16 at 5:30










  • The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
    – David Kendell
    Nov 16 at 5:44










  • Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
    – Lee Mosher
    Nov 16 at 17:50
















How about drawing the setup in the Poincare model?
– Lord Shark the Unknown
Nov 16 at 5:30




How about drawing the setup in the Poincare model?
– Lord Shark the Unknown
Nov 16 at 5:30












The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
– David Kendell
Nov 16 at 5:44




The problem is that I'm sure the shortest distance is the Euclidean distance, but i don't know how that would look on the disk.
– David Kendell
Nov 16 at 5:44












Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
– Lee Mosher
Nov 16 at 17:50




Distance in the Poincare model is almost never equal to Euclidean distance. Do you know the form of the metric in any model, such as the Poincare disc model?
– Lee Mosher
Nov 16 at 17:50















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',
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000755%2fcalculate-the-shortest-distance-from-the-vertex-of-a-schweikart-triangle-to-the%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3000755%2fcalculate-the-shortest-distance-from-the-vertex-of-a-schweikart-triangle-to-the%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Plaza Victoria

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...