About Some Localization Problems in Delaunay Triangulations
We study some problems of nodes localization in a Delaunay triangulation and problem-solving procedures. For the problem of the set of nodes the computationally efficient approach that uses Euclidean minimum spanning tree of Delaunay triangulation is proposed. Efficient estimations for computational...
| Glavni autor: | |
|---|---|
| Format: | Članak |
| Jezik: | English |
| Izdano: |
Yaroslavl State University
2015-03-01
|
| Serija: | Моделирование и анализ информационных систем |
| Teme: | |
| Online pristup: | https://www.mais-journal.ru/jour/article/view/145 |