Mathematik-Online problems: Problem 533: Distance between a Point and a Line in the Maximum Norm

	[home] [lexicon] [problems] [tests] [courses] [auxiliaries] [notes] [staff]
	Mathematik-Online problems:
	Problem 533: Distance between a Point and a Line in the Maximum Norm

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Find an algorithm to calculate the shortest distance between a point

and the line $g:\, x=a+td$ , $t\in\mathbb{R}$ in the maximum norm. Illustrate the algorithm with the example

$\displaystyle P = \left(\begin{array}{c} 3 \\ 1 \\ 0 \end{array}\right)\,,\quad... ...ight)\,,\quad d = \left(\begin{array}{c} 1 \\ 0 \\ -1/2 \end{array}\right) \,.$

(Authors: Höllig/Höfert)

[Links]

automatisch erstellt am 18. 1. 2017