Graham scan (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graham scan" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

2web.archive.org

1^st place

1ucsd.edu

1,933^rd place

1,342^nd place

1archive.org

6^th place

1ams.org

451^st place

277^th place

1psu.edu

207^th place

136^th place

1inria.fr

4,903^rd place

3,679^th place

1umontreal.ca

6,223^rd place

6,135^th place

1computer.org

5,196^th place

3,635^th place

ams.org

mathscinet.ams.org

Arkin, Esther M.; Fekete, Sándor P.; Hurtado, Ferran; Mitchell, Joseph S. B.; Noy, Marc; Sacristán, Vera; Sethia, Saurabh (2003). "On the reflexivity of point sets". In Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.). Discrete and Computational Geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics. Vol. 25. Berlin: Springer. pp. 139–156. doi:10.1007/978-3-642-55566-4_6. ISBN 978-3-642-62442-1. MR 2038472.

archive.org

De Berg, Mark; Cheong, Otfried; Van Kreveld, Marc; Overmars, Mark (2008). Computational Geometry Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5.

computer.org

Fortune, Steven (1989). "Stable maintenance of point set triangulations in two dimensions" (PDF). 30th Annual Symposium on Foundations of Computer Science. Vol. 30. pp. 494–499. doi:10.1109/SFCS.1989.63524. ISBN 0-8186-1982-1. Archived from the original (PDF) on 2013-07-28.

doi.org

Graham, R.L. (1972). "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set" (PDF). Information Processing Letters. 1 (4): 132–133. doi:10.1016/0020-0190(72)90045-2.
Andrew, A. M. (1979). "Another efficient algorithm for convex hulls in two dimensions". Information Processing Letters. 9 (5): 216–219. doi:10.1016/0020-0190(79)90072-3.
De Berg, Mark; Cheong, Otfried; Van Kreveld, Marc; Overmars, Mark (2008). Computational Geometry Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5.
Arkin, Esther M.; Fekete, Sándor P.; Hurtado, Ferran; Mitchell, Joseph S. B.; Noy, Marc; Sacristán, Vera; Sethia, Saurabh (2003). "On the reflexivity of point sets". In Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.). Discrete and Computational Geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics. Vol. 25. Berlin: Springer. pp. 139–156. doi:10.1007/978-3-642-55566-4_6. ISBN 978-3-642-62442-1. MR 2038472.
Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993). "Optimal double logarithmic parallel algorithms based on finding all nearest smaller values". Journal of Algorithms. 14 (3): 344–370. CiteSeerX 10.1.1.55.5669. doi:10.1006/jagm.1993.1018..
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee (2008). "Classroom examples of robustness problems in geometric computations" (PDF). Computational Geometry. 40 (1): 61–78. doi:10.1016/j.comgeo.2007.06.003. (An earlier version was reported in 2004 at ESA'2004)
Fortune, Steven (1989). "Stable maintenance of point set triangulations in two dimensions" (PDF). 30th Annual Symposium on Foundations of Computer Science. Vol. 30. pp. 494–499. doi:10.1109/SFCS.1989.63524. ISBN 0-8186-1982-1. Archived from the original (PDF) on 2013-07-28.

inria.fr

hal.inria.fr

Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee (2008). "Classroom examples of robustness problems in geometric computations" (PDF). Computational Geometry. 40 (1): 61–78. doi:10.1016/j.comgeo.2007.06.003. (An earlier version was reported in 2004 at ESA'2004)

psu.edu

citeseerx.ist.psu.edu

Berkman, Omer; Schieber, Baruch; Vishkin, Uzi (1993). "Optimal double logarithmic parallel algorithms based on finding all nearest smaller values". Journal of Algorithms. 14 (3): 344–370. CiteSeerX 10.1.1.55.5669. doi:10.1006/jagm.1993.1018..

ucsd.edu

math.ucsd.edu

Graham, R.L. (1972). "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set" (PDF). Information Processing Letters. 1 (4): 132–133. doi:10.1016/0020-0190(72)90045-2.

umontreal.ca

iro.umontreal.ca

D. Jiang and N. F. Stewart, Backward error analysis in computational geometry Archived 2017-08-09 at the Wayback Machine, Computational Science and Its Applications - ICCSA 2006 Volume 3980 of the series Lecture Notes in Computer Science, pp 50–59

web.archive.org

D. Jiang and N. F. Stewart, Backward error analysis in computational geometry Archived 2017-08-09 at the Wayback Machine, Computational Science and Its Applications - ICCSA 2006 Volume 3980 of the series Lecture Notes in Computer Science, pp 50–59
Fortune, Steven (1989). "Stable maintenance of point set triangulations in two dimensions" (PDF). 30th Annual Symposium on Foundations of Computer Science. Vol. 30. pp. 494–499. doi:10.1109/SFCS.1989.63524. ISBN 0-8186-1982-1. Archived from the original (PDF) on 2013-07-28.