Sign In

Login

Password

Forgot Password ? Sign Up

Kinetic convex hull (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kinetic convex hull" in English language version.

refsWebsite
Global rank English rank
6doi.org
2nd place
2nd place
3psu.edu
207th place
136th place
2stanford.edu
179th place
183rd place
2semanticscholar.org
11th place
8th place
1tuns.ca
low place
low place

doi.org

  • Basch, Julien; Guibas, Leonidas J.; Hershberger, John (April 1999). "Data structures for mobile data" (PDF). Journal of Algorithms. 31 (1): 1–28. CiteSeerX 10.1.1.134.6921. doi:10.1006/jagm.1998.0988. S2CID 8013433.
  • Hershberger, John (21 December 1989). "Finding the upper envelope of n line segments in O(n log n) time". Information Processing Letters. 33 (4): 169–174. doi:10.1016/0020-0190(89)90136-1.
  • Agarwal, Pankaj K.; Schwarzkopf, Otfried; Sharir, Micha (January 1996). "The overlay of lower envelopes and its applications". Discrete & Computational Geometry. 15 (1): 1–13. CiteSeerX 10.1.1.54.5488. doi:10.1007/BF02716576. S2CID 1261935.
  • Sharir, Micha (1994). "Almost tight upper bounds for lower envelopes in higher dimensions". Discrete & Computational Geometry. 12 (1): 327–345. doi:10.1007/BF02574384.
  • Agarwal, Pankaj K.; Guibas, Leonidas J.; Hershberger, John; Veach, Eric (January 2001). "Maintaining the extent of a moving point set". Discrete & Computational Geometry. 26 (3): 353–374. CiteSeerX 10.1.1.47.8510. doi:10.1007/s00454-001-0019-x.
  • Agarwal, Pankaj K.; Guibas, Leonidas J.; Hershberger, John; Veach, Eric (August 1997). "Maintaining the extent of a moving point set". Lecture Notes in Computer Science Volume 1272. 5th Workshop on Algorithms and Data Structures (WADS '97). pp. 31–44. doi:10.1007/3-540-63307-3_46.

psu.edu

citeseerx.ist.psu.edu

  • Basch, Julien; Guibas, Leonidas J.; Hershberger, John (April 1999). "Data structures for mobile data" (PDF). Journal of Algorithms. 31 (1): 1–28. CiteSeerX 10.1.1.134.6921. doi:10.1006/jagm.1998.0988. S2CID 8013433.
  • Agarwal, Pankaj K.; Schwarzkopf, Otfried; Sharir, Micha (January 1996). "The overlay of lower envelopes and its applications". Discrete & Computational Geometry. 15 (1): 1–13. CiteSeerX 10.1.1.54.5488. doi:10.1007/BF02716576. S2CID 1261935.
  • Agarwal, Pankaj K.; Guibas, Leonidas J.; Hershberger, John; Veach, Eric (January 2001). "Maintaining the extent of a moving point set". Discrete & Computational Geometry. 26 (3): 353–374. CiteSeerX 10.1.1.47.8510. doi:10.1007/s00454-001-0019-x.

semanticscholar.org

api.semanticscholar.org

  • Basch, Julien; Guibas, Leonidas J.; Hershberger, John (April 1999). "Data structures for mobile data" (PDF). Journal of Algorithms. 31 (1): 1–28. CiteSeerX 10.1.1.134.6921. doi:10.1006/jagm.1998.0988. S2CID 8013433.
  • Agarwal, Pankaj K.; Schwarzkopf, Otfried; Sharir, Micha (January 1996). "The overlay of lower envelopes and its applications". Discrete & Computational Geometry. 15 (1): 1–13. CiteSeerX 10.1.1.54.5488. doi:10.1007/BF02716576. S2CID 1261935.

stanford.edu

graphics.stanford.edu

  • Basch, Julien; Guibas, Leonidas J.; Hershberger, John (April 1999). "Data structures for mobile data" (PDF). Journal of Algorithms. 31 (1): 1–28. CiteSeerX 10.1.1.134.6921. doi:10.1006/jagm.1998.0988. S2CID 8013433.
  • Agarwal, Pankaj K.; Guibas, Leonidas J.; Hershberger, John; Veach, Eric (August 1997). "Maintaining the extent of a moving point set". Lecture Notes in Computer Science Volume 1272. 5th Workshop on Algorithms and Data Structures (WADS '97). pp. 31–44. doi:10.1007/3-540-63307-3_46.

tuns.ca