Geodesic
About Some Localization Problems in Delaunay Triangulations
Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 6, pp. 112-126

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: computational geometry, geometric search, merging of overlapping triangulations, unregular discrete mesh, computational complexity.
Mots-clés : Delaunay triangulation 
@article{MAIS_2012_19_6_a10,
     author = {N. F. Dyshkant},
     title = {About {Some} {Localization} {Problems} in {Delaunay} {Triangulations}},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {112--126},
     publisher = {mathdoc},
     volume = {19},
     number = {6},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a10/}
}
TY  - JOUR
AU  - N. F. Dyshkant
TI  - About Some Localization Problems in Delaunay Triangulations
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2012
SP  - 112
EP  - 126
VL  - 19
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a10/
LA  - ru
ID  - MAIS_2012_19_6_a10
ER  - 
%0 Journal Article
%A N. F. Dyshkant
%T About Some Localization Problems in Delaunay Triangulations
%J Modelirovanie i analiz informacionnyh sistem
%D 2012
%P 112-126
%V 19
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a10/
%G ru
%F MAIS_2012_19_6_a10
N. F. Dyshkant. About Some Localization Problems in Delaunay Triangulations. Modelirovanie i analiz informacionnyh sistem, Tome 19 (2012) no. 6, pp. 112-126. http://geodesic.mathdoc.fr/item/MAIS_2012_19_6_a10/