Related papers: The Fermat-Torricelli problem in the case of three…
The article studies a generalization of the classical Fermat-Torricelli problem to normed spaces of arbitrary finite dimension. Necessary and sufficient conditions for the uniqueness of the solution of the Fermat-Torricelli problem for any…
In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by…
We investigate the Fermat-Torricelli problem in d-dimensional real normed spaces or Minkowski spaces, mainly for d=2. Our approach is to study the Fermat-Torricelli locus in a geometric way. We present many new results, as well as give an…
We obtain two analytic solutions for the weighted Fermat-Torricelli problem in the Euclidean Plane which states that: Given three points in the Euclidean plane and a positive real number (weight) which correspond to each point, find the…
One of the oldest and richest problems from continuous location science is the famous Fermat-Torricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to n given (non-collinear) points. Many natural…
In this paper we develop new applications of variational analysis and generalized differentiation to the following optimization problem and its specifications: given n closed subsets of a Banach space, find such a point for which the sum of…
Let $P_1,P_2,P_3$ be three given points in $\mathbf{R}^2$, and $P$ be an arbitrary point in $\mathbf{R}^2$. The classical Fermat's problem to Torricelli asks for the location of the point $P$ such that $|PP_1|+|PP_2|+|PP_3|$ is a minimum.…
The weighted Fermat-Torricelli problem for four non-collinear and non-coplanar points in the three dimensional Euclidean Space states that: Given four non-collinear and non-coplanar points A1, A2, A3, A4 and a positive real number (weight)…
We obtain an analytical solution for the weighted Fermat-Torricelli problem for an equilateral geodesic triangle A_1A_2A_3 which is composed by three equal geodesic arcs (sides) of length Pi/2 for given three positive unequal weights that…
We prove the following fundamental property for the Fermat-Torricelli point for four non-collinear and non-coplanar points forming a tetrahedron in $\mathbb{R}^{3},$ which states that: The three bisecting lines having as a common vertex the…
In this paper, we begin by introducing a well-known geometry concept: the Fermat point in a triangle. Then, we generalize the problem and propose an iterative algorithm based on gradient descent to the weighted form in Lp space. We also…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
In this paper we consider historical genesis of trifocal curve as an optimal curve for solving the Fermat's problem (minimizing the sum of distance of one point to three given points in the plane). Trifocal curves are basic plane geometric…
The weighted Fermat-Torricelli problem for four non-collinear points in R^2 states that: Given four non-collinear points A_1, A_2, A_3,A_4 and a positive real number (weight) B_i which correspond to each point A_i, for i = 1, 2, 3, 4, find…
We find the equations that allow us to compute the position of the two interior nodes (weighted Fermat-Torricelli points) w.r. to the weighted Steiner problem for four points determining a tetrahedron in R^3. Furthermore, by applying the…
The Fermat-Weber location problem requires finding a point in $\mathbb{R}^n$ that minimizes the sum of weighted Euclidean distances to $m$ given points. An iterative solution method for this problem was first introduced by E. Weiszfeld in…
In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…
In this paper, we introduce and study the following problem and its further generalizations: given two finite collections of sets in a normed space, find a ball whose center lies in a given constraint set with the smallest radius that…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…