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...

Cijeli opis

Bibliografski detalji

Glavni autor:	N. F. Dyshkant
Format:	Artigo
Jezik:	Inglês
Izdano:	Yaroslavl State University 2015-03-01
Serija:	Моделирование и анализ информационных систем
Teme:	computational geometry geometric search delaunay triangulation merging of overlapping triangulations unregular discrete mesh computational complexity
Online pristup:	https://www.mais-journal.ru/jour/article/view/145
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!