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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2015-03-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/145 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849338821155487744 |
|---|---|
| author | N. F. Dyshkant |
| author_facet | N. F. Dyshkant |
| author_sort | N. F. Dyshkant |
| collection | DOAJ |
| description | 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.computational geometry, geometric search, Delaunay triangulation, merging of overlapping triangulations, unregular discrete mesh, computational complexity |
| format | Article |
| id | doaj-art-0ffc4a10cd024de29bcca7c5bbd30619 |
| institution | Kabale University |
| issn | 1818-1015 2313-5417 |
| language | English |
| publishDate | 2015-03-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj-art-0ffc4a10cd024de29bcca7c5bbd306192025-08-20T03:44:18ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172015-03-0119611212610.18255/1818-1015-2012-6-112-126140About Some Localization Problems in Delaunay TriangulationsN. F. Dyshkant0Московский государственный университет имени М.В. Ломоносова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.computational geometry, geometric search, Delaunay triangulation, merging of overlapping triangulations, unregular discrete mesh, computational complexityhttps://www.mais-journal.ru/jour/article/view/145computational geometrygeometric searchdelaunay triangulationmerging of overlapping triangulationsunregular discrete meshcomputational complexity |
| spellingShingle | N. F. Dyshkant About Some Localization Problems in Delaunay Triangulations Моделирование и анализ информационных систем computational geometry geometric search delaunay triangulation merging of overlapping triangulations unregular discrete mesh computational complexity |
| 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 | computational geometry geometric search delaunay triangulation merging of overlapping triangulations unregular discrete mesh computational complexity |
| url | https://www.mais-journal.ru/jour/article/view/145 |
| work_keys_str_mv | AT nfdyshkant aboutsomelocalizationproblemsindelaunaytriangulations |