WDM-PON Design Model Based on the Minimum Spanning Tree Search over Delaunay Triangulations

2015 ◽  
Author(s):  
German V. Arevalo ◽  
Roberto C. Hincapie ◽  
Javier E. Sierra
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Design Model ◽  
Tree Search ◽  
Delaunay Triangulations ◽  
Model Based ◽  
Wdm Pon

scholarly journals About Some Localization Problems in Delaunay Triangulations

2015 ◽  
Vol 19 (6) ◽  
pp. 112-126
Author(s):  
N. F. Dyshkant
Keyword(s):  
Computational Complexity ◽  
Problem Solving ◽  
Computational Geometry ◽  
Delaunay Triangulation ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Computationally Efficient ◽  
Delaunay Triangulations ◽  
Efficient Approach ◽  
Geometric Search

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

Sign in / Sign up

Export Citation Format

Share Document