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...
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Yaroslavl State University
2015-03-01
|
| Sarja: | Моделирование и анализ информационных систем |
| Aiheet: | |
| Linkit: | https://www.mais-journal.ru/jour/article/view/145 |