Add to ORKGThis Demonstration shows how the scalar product (dot product) can be used to find the point of shortest distance between a point P and a line. You can modify the line by dragging points A and BComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemátic
This work relates to the problem of linear approximation of multidimensional statistical data. Inste...
Path finding is one problem that is common and widely applied, for example, for determining the shor...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
This Demonstration shows how the scalar product (dot product) can be used to find the point of short...
Digital education at the university implies application of information technologies, active learning...
We present a fast algorithm for computing the shortest distance between two line segments in three-d...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
We seek for lines of minimal distance to finitely many given points in the plane. The distance betwe...
Plane GeometryComputing the distance between two points in the plane is an application of the Pythag...
This study provides a clear-cut solution to a minimum distance problem, in particular, the problem o...
The shortest path between two points on the surface of a sphere is an arc of a great circle (great c...
<p>Each dot represents the closest (in terms of minimizing the Procrustes distance) grid point to a ...
[FIRST PARAGRAPH] Consider a straight line on a flat surface running from point A to C and passin...
We consider the classic all-pairs-shortest-paths (APSP) problem in a three-dimensional environment w...
Finding the shortest distance to a triaxial ellipsoid is equivalent to the presence of ellipsoidal h...
This work relates to the problem of linear approximation of multidimensional statistical data. Inste...
Path finding is one problem that is common and widely applied, for example, for determining the shor...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...
This Demonstration shows how the scalar product (dot product) can be used to find the point of short...
Digital education at the university implies application of information technologies, active learning...
We present a fast algorithm for computing the shortest distance between two line segments in three-d...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
We seek for lines of minimal distance to finitely many given points in the plane. The distance betwe...
Plane GeometryComputing the distance between two points in the plane is an application of the Pythag...
This study provides a clear-cut solution to a minimum distance problem, in particular, the problem o...
The shortest path between two points on the surface of a sphere is an arc of a great circle (great c...
<p>Each dot represents the closest (in terms of minimizing the Procrustes distance) grid point to a ...
[FIRST PARAGRAPH] Consider a straight line on a flat surface running from point A to C and passin...
We consider the classic all-pairs-shortest-paths (APSP) problem in a three-dimensional environment w...
Finding the shortest distance to a triaxial ellipsoid is equivalent to the presence of ellipsoidal h...
This work relates to the problem of linear approximation of multidimensional statistical data. Inste...
Path finding is one problem that is common and widely applied, for example, for determining the shor...
AbstractWe prove that among n points in the plane in general position, the shortest distance can occ...