Delaunay üçgenleme (Turkish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Delaunay üçgenleme" in Turkish language version.

refsWebsite

Global rank Turkish rank

2^nd place

4^th place

1^st place

8,783^rd place

low place

low place

2,796^th place

2,776^th place

3,336^th place

doi.org

Seidel (1995). "The upper bound theorem for polytopes: an easy proof of its asymptotic version". Computational Geometry dergisi (İngilizce). 5 (2): 115-116. doi:10.1016/0925-7721(95)00013-Y.
"Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). 8. 1953: 270-290. 8 Mart 2017 tarihinde kaynağından (PDF) arşivlendi. . As cited by "Higher-dimensional Voronoĭ diagrams in linear expected time" (İngilizce). 6 (4). 1991: 343-367. doi:10.1007/BF02574694.
"An O(n² log n) time algorithm for the minmax angle triangulation" (PDF) (İngilizce). 13 (4). 1992: 994-1008. doi:10.1137/0913058. 9 Şubat 2017 tarihinde kaynağından (PDF) arşivlendi. Erişim tarihi: 24 Ekim 2017.
"Classes of graphs which approximate the complete Euclidean graph" (İngilizce). 7 (1). 1992: 13-28. doi:10.1007/BF02187821.
Guibas (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi". ACM Transactions on Graphics (İngilizce). 4 (2): 74-123. doi:10.1145/282918.282923.

Delaunay (1934). "Sur la sphère vide". Bulletin de l'Académie des Sciences de l'URSS, Classe des Sciences Mathématiques et Naturelles (İngilizce). 6: 793-800.

"An O(n² log n) time algorithm for the minmax angle triangulation" (PDF) (İngilizce). 13 (4). 1992: 994-1008. doi:10.1137/0913058. 9 Şubat 2017 tarihinde kaynağından (PDF) arşivlendi. Erişim tarihi: 24 Ekim 2017.

"Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). 8. 1953: 270-290. 8 Mart 2017 tarihinde kaynağından (PDF) arşivlendi. . As cited by "Higher-dimensional Voronoĭ diagrams in linear expected time" (İngilizce). 6 (4). 1991: 343-367. doi:10.1007/BF02574694.

"Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). 8. 1953: 270-290. 8 Mart 2017 tarihinde kaynağından (PDF) arşivlendi. . As cited by "Higher-dimensional Voronoĭ diagrams in linear expected time" (İngilizce). 6 (4). 1991: 343-367. doi:10.1007/BF02574694.
"An O(n² log n) time algorithm for the minmax angle triangulation" (PDF) (İngilizce). 13 (4). 1992: 994-1008. doi:10.1137/0913058. 9 Şubat 2017 tarihinde kaynağından (PDF) arşivlendi. Erişim tarihi: 24 Ekim 2017.