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 |
| _version_ | 1797972418547941376 |
|---|---|
| author | N. F. Dyshkant |
| author_facet | N. F. Dyshkant |
| author_sort | N. F. Dyshkant |
| collection | DOAJ |
| description | <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 computational comlexity of the proposed methods in the average and in the worst cases are proved.</p><p>computational geometry, geometric search, Delaunay triangulation, merging of overlapping triangulations, unregular discrete mesh, computational complexity</p> |
| first_indexed | 2024-04-11T03:48:07Z |
| format | Article |
| id | doaj.art-f1f6d180ccff4598a1fc5e11a8481a26 |
| institution | Directory Open Access Journal |
| issn | 1818-1015 2313-5417 |
| language | English |
| last_indexed | 2024-04-11T03:48:07Z |
| publishDate | 2012-01-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj.art-f1f6d180ccff4598a1fc5e11a8481a262023-01-02T02:31:12ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172012-01-01196112126140About Some Localization Problems in Delaunay TriangulationsN. F. Dyshkant0осковский государственный университет имени М.В. Ломоносова<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 computational comlexity of the proposed methods in the average and in the worst cases are proved.</p><p>computational geometry, geometric search, Delaunay triangulation, merging of overlapping triangulations, unregular discrete mesh, computational complexity</p>http://mais-journal.ru/jour/article/view/145вычислительная геометриягеометрический поисктриангуляция Делонеслияние перекрывающихся триангуляцийнерегулярная дискретная сеткавычислительная сложность |
| spellingShingle | N. F. Dyshkant About Some Localization Problems in Delaunay Triangulations Моделирование и анализ информационных систем вычислительная геометрия геометрический поиск триангуляция Делоне слияние перекрывающихся триангуляций нерегулярная дискретная сетка вычислительная сложность |
| title | About Some Localization Problems in Delaunay Triangulations |
| title_full | About Some Localization Problems in Delaunay Triangulations |
| title_fullStr | About Some Localization Problems in Delaunay Triangulations |
| title_full_unstemmed | About Some Localization Problems in Delaunay Triangulations |
| title_short | About Some Localization Problems in Delaunay Triangulations |
| title_sort | about some localization problems in delaunay triangulations |
| topic | вычислительная геометрия геометрический поиск триангуляция Делоне слияние перекрывающихся триангуляций нерегулярная дискретная сетка вычислительная сложность |
| url | http://mais-journal.ru/jour/article/view/145 |
| work_keys_str_mv | AT nfdyshkant aboutsomelocalizationproblemsindelaunaytriangulations |