Geometrically L^p-optimal lines of vertices of an equilateral triangle
Annett Puettmann
Abstract
Open-access reader
Annett Puettmann
Abstract
Open-access reader
We consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric L^p-distance to the vertices of an equilateral triangle for all 1<= p<=\infty. The investigation of the L^p-distances for p\ne 1,2,\infty establishes the passage between the well-known sets of optimal lines for p=1,2,\infty. The set of optimal lines consists of three lines each parallel to one of the triangle sides for 1<= p < 4/3 and 2
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric L^p-distance to the vertices of an equilateral triangle for all 1<= p<=\infty. The investigation of the L^p-distances for p\ne 1,2,\infty establishes the passage between the well-known sets of optimal lines for p=1,2,\infty. The set of optimal lines consists of three lines each parallel to one of the triangle sides for 1<= p < 4/3 and 2
Key concepts: Equilateral triangle, Combinatorics, Mathematics, Line (geometry), Isosceles triangle, Plane (geometry), Euclidean geometry, Geometry