Skip to content
naulon
Not checkedNot checked for notices yet.

The question of finding the shortest distance between two points of different diversity

Brylevskaya Larisa, Gonchar Larisa, Pastukhova Elena and 1 more

E3S Web of Conferences · 2020

doi:10.1051/e3sconf/202016412019 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Digital education at the university implies application of information technologies, active learning methods and comprehensive algorithmizing of the process of solving various tasks. It is also supposed to create application software packages, which can find their application at the junction of various disciplines. (1) One area of digital education is to solve the problems of motion optimization and localization of various objects. In particular, the question of finding the shortest distance between points lying on two different varieties (curves, plane, etc.) is frequently solved (more than 10) Here are examples of the solving. The first example describes an algorithm for finding the shortest distance between two parabolas lying in the same plane; the second example suggests a solution course for an elliptical paraboloid and a point on the coordinate axis. Finally, the third example deals with the distance between a cube parabola and a hemisphere with the center at the beginning of the coordinates.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.