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...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Yaroslavl State University
2015-03-01
|
| Rangatū: | Моделирование и анализ информационных систем |
| Ngā marau: | |
| Urunga tuihono: | https://www.mais-journal.ru/jour/article/view/145 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|