About Some Localization Problems in Delaunay Triangulations
<p>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 comp...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2012-01-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | http://mais-journal.ru/jour/article/view/145 |