Delaunay triangulation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Delaunay triangulation" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

9web.archive.org

1^st place

5semanticscholar.org

11^th place

8^th place

3ams.org

451^st place

277^th place

2psu.edu

207^th place

136^th place

2cmu.edu

1,564^th place

1,028^th place

1mathnet.ru

8,783^rd place

low place

1mcgill.ca

2,527^th place

1,840^th place

1philips.com

low place

1nus.edu.sg

2,776^th place

2,052^nd place

1arxiv.org

69^th place

59^th place

1uu.nl

2,467^th place

2,049^th place

1uiuc.edu

3,087^th place

2,519^th place

1berkeley.edu

580^th place

462^nd place

1s-hull.org

low place

1books.google.com

3^rd place

1epfl.ch

4,521^st place

4,877^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Meijering, J. L. (1953). "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). Philips Research Reports. 8: 270–290. Archived from the original (PDF) on 2017-03-08. As cited by Dwyer, Rex A. (1991). "Higher-dimensional Voronoĭ diagrams in linear expected time". Discrete and Computational Geometry. 6 (4): 343–367. doi:10.1007/BF02574694. MR 1098813.
Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992). "An O(n² log n) time algorithm for the minmax angle triangulation" (PDF). SIAM Journal on Scientific and Statistical Computing. 13 (4): 994–1008. CiteSeerX 10.1.1.66.2895. doi:10.1137/0913058. MR 1166172. Archived from the original (PDF) on 2017-02-09. Retrieved 2017-10-24..
Xia, Ge (2013). "The stretch factor of the Delaunay triangulation is less than 1.998". SIAM Journal on Computing. 42 (4): 1620–1659. arXiv:1103.4361. doi:10.1137/110832458. MR 3082502. S2CID 6646528.

arxiv.org (Global: 69^th place; English: 59^th place)

Xia, Ge (2013). "The stretch factor of the Delaunay triangulation is less than 1.998". SIAM Journal on Computing. 42 (4): 1620–1659. arXiv:1103.4361. doi:10.1137/110832458. MR 3082502. S2CID 6646528.

berkeley.edu (Global: 580^th place; English: 462^nd place)

cs.berkeley.edu

A Comparison of Sequential Delaunay Triangulation Algorithms "Archived copy" (PDF). Archived from the original (PDF) on 2012-03-08. Retrieved 2010-08-18.{{cite web}}: CS1 maint: archived copy as title (link)

books.google.com (Global: 3^rd place; English: 3^rd place)

Franz Aurenhammer; Rolf Klein; Der-tsai Lee (26 June 2013). Voronoi Diagrams And Delaunay Triangulations. World Scientific Publishing Company. pp. 197–. ISBN 978-981-4447-65-2.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Blelloch, Guy; Gu, Yan; Shun, Julian; and Sun, Yihan. Parallelism in Randomized Incremental Algorithms Archived 2018-04-25 at the Wayback Machine. SPAA 2016. doi:10.1145/2935764.2935766.
"Triangulation Algorithms and Data Structures". www.cs.cmu.edu. Archived from the original on 10 October 2017. Retrieved 25 April 2018.

doi.org (Global: 2^nd place; English: 2^nd place)

Seidel, Raimund (1995). "The upper bound theorem for polytopes: an easy proof of its asymptotic version". Computational Geometry. 5 (2): 115–116. doi:10.1016/0925-7721(95)00013-Y.
Meijering, J. L. (1953). "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). Philips Research Reports. 8: 270–290. Archived from the original (PDF) on 2017-03-08. As cited by Dwyer, Rex A. (1991). "Higher-dimensional Voronoĭ diagrams in linear expected time". Discrete and Computational Geometry. 6 (4): 343–367. doi:10.1007/BF02574694. MR 1098813.
Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992). "An O(n² log n) time algorithm for the minmax angle triangulation" (PDF). SIAM Journal on Scientific and Statistical Computing. 13 (4): 994–1008. CiteSeerX 10.1.1.66.2895. doi:10.1137/0913058. MR 1166172. Archived from the original (PDF) on 2017-02-09. Retrieved 2017-10-24..
Xia, Ge (2013). "The stretch factor of the Delaunay triangulation is less than 1.998". SIAM Journal on Computing. 42 (4): 1620–1659. arXiv:1103.4361. doi:10.1137/110832458. MR 3082502. S2CID 6646528.
Guibas, Leonidas; Stolfi, Jorge (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi". ACM Transactions on Graphics. 4 (2): 74–123. doi:10.1145/282918.282923. S2CID 52852815.
Hurtado, F.; Noy, M.; Urrutia, J. (1999). "Flipping Edges in Triangulations". Discrete & Computational Geometry. 22 (3): 333–346. doi:10.1007/PL00009464.
Guibas, Leonidas J.; Knuth, Donald E.; Sharir, Micha (1992). "Randomized incremental construction of Delaunay and Voronoi diagrams". Algorithmica. 7 (1–6): 381–413. doi:10.1007/BF01758770. S2CID 3770886.
Edelsbrunner, Herbert; Shah, Nimish (1996). "Incremental Topological Flipping Works for Regular Triangulations". Algorithmica. 15 (3): 223–241. doi:10.1007/BF01975867. S2CID 12976796.
Dwyer, Rex A. (November 1987). "A faster divide-and-conquer algorithm for constructing delaunay triangulations". Algorithmica. 2 (1–4): 137–151. doi:10.1007/BF01840356. S2CID 10828441.
Cignoni, P.; C. Montani; R. Scopigno (1998). "DeWall: A fast divide and conquer Delaunay triangulation algorithm in E^d". Computer-Aided Design. 30 (5): 333–341. doi:10.1016/S0010-4485(97)00082-1.
Sterling J Anderson; Sisir B. Karumanchi; Karl Iagnemma (5 July 2012). "Constraint-based planning and control for safe, semi-autonomous operation of vehicles" (PDF). 2012 IEEE Intelligent Vehicles Symposium. IEEE. doi:10.1109/IVS.2012.6232153. Archived from the original (PDF) on 28 February 2019. Retrieved 27 February 2019.

epfl.ch (Global: 4,521^st place; English: 4,877^th place)

wiki.epfl.ch

Sterling J Anderson; Sisir B. Karumanchi; Karl Iagnemma (5 July 2012). "Constraint-based planning and control for safe, semi-autonomous operation of vehicles" (PDF). 2012 IEEE Intelligent Vehicles Symposium. IEEE. doi:10.1109/IVS.2012.6232153. Archived from the original (PDF) on 28 February 2019. Retrieved 27 February 2019.

mathnet.ru (Global: 8,783^rd place; English: low place)

mi.mathnet.ru

Delaunay, Boris (1934). "Sur la sphère vide" [On the empty sphere]. Bulletin de l'Académie des Sciences de l'URSS, Classe des Sciences Mathématiques et Naturelles (in French). 6: 793–800.

mcgill.ca (Global: 2,527^th place; English: 1,840^th place)

cs.mcgill.ca

Fukuda, Komei. "Frequently Asked Questions in Polyhedral Computation". www.cs.mcgill.ca. Retrieved 29 October 2018.

nus.edu.sg (Global: 2,776^th place; English: 2,052^nd place)

comp.nus.edu.sg

Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992). "An O(n² log n) time algorithm for the minmax angle triangulation" (PDF). SIAM Journal on Scientific and Statistical Computing. 13 (4): 994–1008. CiteSeerX 10.1.1.66.2895. doi:10.1137/0913058. MR 1166172. Archived from the original (PDF) on 2017-02-09. Retrieved 2017-10-24..

philips.com (Global: low place; English: low place)

extra.research.philips.com

Meijering, J. L. (1953). "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). Philips Research Reports. 8: 270–290. Archived from the original (PDF) on 2017-03-08. As cited by Dwyer, Rex A. (1991). "Higher-dimensional Voronoĭ diagrams in linear expected time". Discrete and Computational Geometry. 6 (4): 343–367. doi:10.1007/BF02574694. MR 1098813.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992). "An O(n² log n) time algorithm for the minmax angle triangulation" (PDF). SIAM Journal on Scientific and Statistical Computing. 13 (4): 994–1008. CiteSeerX 10.1.1.66.2895. doi:10.1137/0913058. MR 1166172. Archived from the original (PDF) on 2017-02-09. Retrieved 2017-10-24..
Leach, G. (June 1992). "Improving Worst-Case Optimal Delaunay Triangulation Algorithms". 4th Canadian Conference on Computational Geometry. CiteSeerX 10.1.1.56.2323.

s-hull.org (Global: low place; English: low place)

"S-hull" (PDF). s-hull.org. Archived (PDF) from the original on 2013-10-27. Retrieved 25 April 2018.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Xia, Ge (2013). "The stretch factor of the Delaunay triangulation is less than 1.998". SIAM Journal on Computing. 42 (4): 1620–1659. arXiv:1103.4361. doi:10.1137/110832458. MR 3082502. S2CID 6646528.
Guibas, Leonidas; Stolfi, Jorge (1985). "Primitives for the manipulation of general subdivisions and the computation of Voronoi". ACM Transactions on Graphics. 4 (2): 74–123. doi:10.1145/282918.282923. S2CID 52852815.
Guibas, Leonidas J.; Knuth, Donald E.; Sharir, Micha (1992). "Randomized incremental construction of Delaunay and Voronoi diagrams". Algorithmica. 7 (1–6): 381–413. doi:10.1007/BF01758770. S2CID 3770886.
Edelsbrunner, Herbert; Shah, Nimish (1996). "Incremental Topological Flipping Works for Regular Triangulations". Algorithmica. 15 (3): 223–241. doi:10.1007/BF01975867. S2CID 12976796.
Dwyer, Rex A. (November 1987). "A faster divide-and-conquer algorithm for constructing delaunay triangulations". Algorithmica. 2 (1–4): 137–151. doi:10.1007/BF01840356. S2CID 10828441.

uiuc.edu (Global: 3,087^th place; English: 2,519^th place)

geom.uiuc.edu

Peterson, Samuel. "COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE". www.geom.uiuc.edu. Archived from the original on 22 September 2017. Retrieved 25 April 2018.

uu.nl (Global: 2,467^th place; English: 2,049^th place)

cs.uu.nl

de Berg, Mark; Otfried Cheong; Marc van Kreveld; Mark Overmars (2008). Computational Geometry: Algorithms and Applications (PDF). Springer-Verlag. ISBN 978-3-540-77973-5. Archived from the original (PDF) on 2009-10-28. Retrieved 2010-02-23.

web.archive.org (Global: 1^st place; English: 1^st place)

Meijering, J. L. (1953). "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation" (PDF). Philips Research Reports. 8: 270–290. Archived from the original (PDF) on 2017-03-08. As cited by Dwyer, Rex A. (1991). "Higher-dimensional Voronoĭ diagrams in linear expected time". Discrete and Computational Geometry. 6 (4): 343–367. doi:10.1007/BF02574694. MR 1098813.
Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992). "An O(n² log n) time algorithm for the minmax angle triangulation" (PDF). SIAM Journal on Scientific and Statistical Computing. 13 (4): 994–1008. CiteSeerX 10.1.1.66.2895. doi:10.1137/0913058. MR 1166172. Archived from the original (PDF) on 2017-02-09. Retrieved 2017-10-24..
de Berg, Mark; Otfried Cheong; Marc van Kreveld; Mark Overmars (2008). Computational Geometry: Algorithms and Applications (PDF). Springer-Verlag. ISBN 978-3-540-77973-5. Archived from the original (PDF) on 2009-10-28. Retrieved 2010-02-23.
Blelloch, Guy; Gu, Yan; Shun, Julian; and Sun, Yihan. Parallelism in Randomized Incremental Algorithms Archived 2018-04-25 at the Wayback Machine. SPAA 2016. doi:10.1145/2935764.2935766.
Peterson, Samuel. "COMPUTING CONSTRAINED DELAUNAY TRIANGULATIONS IN THE PLANE". www.geom.uiuc.edu. Archived from the original on 22 September 2017. Retrieved 25 April 2018.
A Comparison of Sequential Delaunay Triangulation Algorithms "Archived copy" (PDF). Archived from the original (PDF) on 2012-03-08. Retrieved 2010-08-18.{{cite web}}: CS1 maint: archived copy as title (link)
"Triangulation Algorithms and Data Structures". www.cs.cmu.edu. Archived from the original on 10 October 2017. Retrieved 25 April 2018.
"S-hull" (PDF). s-hull.org. Archived (PDF) from the original on 2013-10-27. Retrieved 25 April 2018.
Sterling J Anderson; Sisir B. Karumanchi; Karl Iagnemma (5 July 2012). "Constraint-based planning and control for safe, semi-autonomous operation of vehicles" (PDF). 2012 IEEE Intelligent Vehicles Symposium. IEEE. doi:10.1109/IVS.2012.6232153. Archived from the original (PDF) on 28 February 2019. Retrieved 27 February 2019.

Delaunay triangulation (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

berkeley.edu (Global: 580th place; English: 462nd place)

cs.berkeley.edu

books.google.com (Global: 3rd place; English: 3rd place)

cmu.edu (Global: 1,564th place; English: 1,028th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

epfl.ch (Global: 4,521st place; English: 4,877th place)

wiki.epfl.ch

mathnet.ru (Global: 8,783rd place; English: low place)

mi.mathnet.ru

mcgill.ca (Global: 2,527th place; English: 1,840th place)

cs.mcgill.ca

nus.edu.sg (Global: 2,776th place; English: 2,052nd place)

comp.nus.edu.sg

philips.com (Global: low place; English: low place)

extra.research.philips.com

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

s-hull.org (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

uiuc.edu (Global: 3,087th place; English: 2,519th place)

geom.uiuc.edu

uu.nl (Global: 2,467th place; English: 2,049th place)

cs.uu.nl

web.archive.org (Global: 1st place; English: 1st place)

ams.org (Global: 451^st place; English: 277^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

berkeley.edu (Global: 580^th place; English: 462^nd place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

epfl.ch (Global: 4,521^st place; English: 4,877^th place)

mathnet.ru (Global: 8,783^rd place; English: low place)

mcgill.ca (Global: 2,527^th place; English: 1,840^th place)

nus.edu.sg (Global: 2,776^th place; English: 2,052^nd place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

uiuc.edu (Global: 3,087^th place; English: 2,519^th place)

uu.nl (Global: 2,467^th place; English: 2,049^th place)

web.archive.org (Global: 1^st place; English: 1^st place)