| DC Field | Value | Language |
|---|
| dc.contributor.author | Lushchakova, I. N. | - |
| dc.date.accessioned | 2020-11-06T07:10:03Z | - |
| dc.date.available | 2020-11-06T07:10:03Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | Lushchakova, I. N. Geometric Algorithms for Finding a Point in the Intersection of Balls / Lushchakova I. N. // Automation and Remote Control. – 2020. – №5. – P. 869 – 882. – DOI: 10.1134/S0005117920050070. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/40953 | - |
| dc.description.abstract | We consider a problem of finding a point in the intersection of n balls in the Euclidean space E^m. For the case m=2 we suggest two algorithms of the complexity O(n^2 logn) and O(n^3 ) operations, respectively. For the general case we suggest an exact polynomial recursive algorithm which uses the orthogonal transformation of the space E^m. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | Springer Nature | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | intersection of balls | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.subject | delivery applications of drones | ru_RU |
| dc.subject | configuration of the swarm of drones | ru_RU |
| dc.title | Geometric Algorithms for Finding a Point in the Intersection of Balls | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
