Abstract. It is known that the Lemoine point K of a triangle in the Euclidean plane is the point of the plane where the sum of the squares of the distances d1, d2, and d3 to the sides of the triangle takes its minimal value. There are several ways to generalize the Lemoine point. First, we can consider n ≥ 3 lines u1,..., un instead of three in the Euclidean plane and search for the point which minimalizes the expression d21 + · · ·+d2n, where di is the distance to the line ui, i = 1,..., n. Second, we can work in the Euclidean m-space Rm and consider n hyperplanes in Rm with n ≥ m + 1. In this paper a combination of these two generalizations is presented. 1
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractLet 1 = d1 < d2 < ⋯ < dk denote the distinct distances determined by a set of n points in th...
Abstract. The Lemoine point, K, of ABC has special properties involving centroids of pedal triangles...
Abstract. For a given triangle, the Lemoine cubic is the locus of points whose cevian lines intersec...
Abstract. We give a short proof of Lemoine’s theorem that the Lemoine point of a triangle is the uni...
TITLE Spatial generalizations of the properties of the triangle AUTHOR Jirˇı' Sřubarˇ SUPERVISOR Pro...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
In the master thesis the problem of finding the point from which the sum of all the distances to any...
In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the su...
Any triangle ABC have three symmedian lines that intersect at one point K that called symmedian poin...
The parallels taken through the simmedian center of a triangle to the sides of the triangle determi...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Oblique aerial view of Lemoine PointImage is situated at 44.233° North (Latitude), 76.615° West (Lon...
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractLet 1 = d1 < d2 < ⋯ < dk denote the distinct distances determined by a set of n points in th...
Abstract. The Lemoine point, K, of ABC has special properties involving centroids of pedal triangles...
Abstract. For a given triangle, the Lemoine cubic is the locus of points whose cevian lines intersec...
Abstract. We give a short proof of Lemoine’s theorem that the Lemoine point of a triangle is the uni...
TITLE Spatial generalizations of the properties of the triangle AUTHOR Jirˇı' Sřubarˇ SUPERVISOR Pro...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
In the master thesis the problem of finding the point from which the sum of all the distances to any...
In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the su...
Any triangle ABC have three symmedian lines that intersect at one point K that called symmedian poin...
The parallels taken through the simmedian center of a triangle to the sides of the triangle determi...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
Oblique aerial view of Lemoine PointImage is situated at 44.233° North (Latitude), 76.615° West (Lon...
In this article we consider $S$ to be a set of points in $d$-space with the property that any $d$ po...
We show the following two results on a set of n points in the plane, thus answering questions posed ...
AbstractLet 1 = d1 < d2 < ⋯ < dk denote the distinct distances determined by a set of n points in th...