Point-set triangulation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Point-set triangulation" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

3psu.edu

207^th place

136^th place

2uu.nl

2,467^th place

2,049^th place

2ams.org

451^st place

277^th place

1handle.net

102^nd place

76^th place

1princeton.edu

741^st place

577^th place

1worldcat.org

5^th place

1semanticscholar.org

11^th place

8^th place

1web.archive.org

1^st place

1usask.ca

7,865^th place

5,092^nd place

1uni-bonn.de

6,912^th place

8,465^th place

1arxiv.org

69^th place

59^th place

ams.org

mathscinet.ams.org

Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992), "An O(n² log n) time algorithm for the minmax angle triangulation", SIAM Journal on Scientific and Statistical Computing, 13 (4): 994–1008, CiteSeerX 10.1.1.66.2895, doi:10.1137/0913058, MR 1166172.
Bern et al. 1993. Bern, M.; Edelsbrunner, H.; Eppstein, D.; Mitchell, S.; Tan, T. S. (1993), "Edge insertion for optimal triangulations", Discrete and Computational Geometry, 10 (1): 47–65, doi:10.1007/BF02573962, MR 1215322

arxiv.org

Fekete 2012. Fekete, Sándor P. (2012). "The Complexity of MaxMin Length Triangulation". arXiv:1208.0202v1 [cs.CG].

doi.org

Lloyd 1977. Lloyd, Errol Lynn (1977). On triangulations of a set of points in the plane. 18th Annual Symposium on Foundations of Computer Science (SFCS 1977). pp. 228–240. doi:10.1109/SFCS.1977.21. hdl:1721.1/148916.
Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992), "An O(n² log n) time algorithm for the minmax angle triangulation", SIAM Journal on Scientific and Statistical Computing, 13 (4): 994–1008, CiteSeerX 10.1.1.66.2895, doi:10.1137/0913058, MR 1166172.
Edelsbrunner, Tan & Waupotitsch 1990. Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1990). An O(n2log n) time algorithm for the MinMax angle triangulation. Proceedings of the sixth annual symposium on Computational geometry. SCG '90. ACM. pp. 44–52. CiteSeerX 10.1.1.66.2895. doi:10.1145/98524.98535. ISBN 0-89791-362-0.
Bern et al. 1993. Bern, M.; Edelsbrunner, H.; Eppstein, D.; Mitchell, S.; Tan, T. S. (1993), "Edge insertion for optimal triangulations", Discrete and Computational Geometry, 10 (1): 47–65, doi:10.1007/BF02573962, MR 1215322
Chazelle, Guibas & Lee 1985. Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. (1985). "The power of geometric duality" (PDF). BIT. 25 (1). BIT Computer Science and Numerical Mathematics: 76–90. doi:10.1007/BF01934990. ISSN 0006-3835. S2CID 122411548.
Edelsbrunner & Tan 1991. Edelsbrunner, Herbert; Tan, Tiow Seng (1991). A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium on Foundations of Computer Science. pp. 414–423. CiteSeerX 10.1.1.66.8959. doi:10.1109/SFCS.1991.185400. ISBN 0-8186-2445-0.

handle.net

hdl.handle.net

Lloyd 1977. Lloyd, Errol Lynn (1977). On triangulations of a set of points in the plane. 18th Annual Symposium on Foundations of Computer Science (SFCS 1977). pp. 228–240. doi:10.1109/SFCS.1977.21. hdl:1721.1/148916.

princeton.edu

cs.princeton.edu

Chazelle, Guibas & Lee 1985. Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. (1985). "The power of geometric duality" (PDF). BIT. 25 (1). BIT Computer Science and Numerical Mathematics: 76–90. doi:10.1007/BF01934990. ISSN 0006-3835. S2CID 122411548.

psu.edu

citeseerx.ist.psu.edu

Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1992), "An O(n² log n) time algorithm for the minmax angle triangulation", SIAM Journal on Scientific and Statistical Computing, 13 (4): 994–1008, CiteSeerX 10.1.1.66.2895, doi:10.1137/0913058, MR 1166172.
Edelsbrunner, Tan & Waupotitsch 1990. Edelsbrunner, Herbert; Tan, Tiow Seng; Waupotitsch, Roman (1990). An O(n2log n) time algorithm for the MinMax angle triangulation. Proceedings of the sixth annual symposium on Computational geometry. SCG '90. ACM. pp. 44–52. CiteSeerX 10.1.1.66.2895. doi:10.1145/98524.98535. ISBN 0-89791-362-0.
Edelsbrunner & Tan 1991. Edelsbrunner, Herbert; Tan, Tiow Seng (1991). A quadratic time algorithm for the minmax length triangulation. 32nd Annual Symposium on Foundations of Computer Science. pp. 414–423. CiteSeerX 10.1.1.66.8959. doi:10.1109/SFCS.1991.185400. ISBN 0-8186-2445-0.

semanticscholar.org

api.semanticscholar.org

Chazelle, Guibas & Lee 1985. Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. (1985). "The power of geometric duality" (PDF). BIT. 25 (1). BIT Computer Science and Numerical Mathematics: 76–90. doi:10.1007/BF01934990. ISSN 0006-3835. S2CID 122411548.

uni-bonn.de

tizian.cs.uni-bonn.de

Jansen 1992. Jansen, Klaus (1992). The Complexity of the Min-max Degree Triangulation Problem (PDF). 9th European Workshop on Computational Geometry. pp. 40–43.

usask.ca

ecommons.usask.ca

Vassilev 2005. Vassilev, Tzvetalin Simeonov (2005). Optimal Area Triangulation (PDF) (Ph.D.). University of Saskatchewan, Saskatoon. Archived from the original (PDF) on 2017-08-13. Retrieved 2013-06-15.

uu.nl

cs.uu.nl

de Berg et al. 2008, Section 9.1. de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2008). Computational Geometry: Algorithms and Applications (3 ed.). Springer-Verlag.
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.

web.archive.org

Vassilev 2005. Vassilev, Tzvetalin Simeonov (2005). Optimal Area Triangulation (PDF) (Ph.D.). University of Saskatchewan, Saskatoon. Archived from the original (PDF) on 2017-08-13. Retrieved 2013-06-15.

worldcat.org

search.worldcat.org

Chazelle, Guibas & Lee 1985. Chazelle, Bernard; Guibas, Leo J.; Lee, D. T. (1985). "The power of geometric duality" (PDF). BIT. 25 (1). BIT Computer Science and Numerical Mathematics: 76–90. doi:10.1007/BF01934990. ISSN 0006-3835. S2CID 122411548.