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

Full description

Bibliographic Details

Published in:	Моделирование и анализ информационных систем
Main Author:	N. F. Dyshkant
Format:	Article
Language:	English
Published:	Yaroslavl State University 2015-03-01
Subjects:	computational geometry geometric search delaunay triangulation merging of overlapping triangulations unregular discrete mesh computational complexity
Online Access:	https://www.mais-journal.ru/jour/article/view/145