Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Graham_scan> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Graham_scan abstract "Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham, who published the original algorithm in 1972. The algorithm finds all vertices of the convex hull ordered along its boundary.".
- Graham_scan thumbnail Graham_Scan.svg?width=300.
- Graham_scan wikiPageID "393372".
- Graham_scan wikiPageLength "8017".
- Graham_scan wikiPageOutDegree "17".
- Graham_scan wikiPageRevisionID "698115763".
- Graham_scan wikiPageWikiLink All_nearest_smaller_values.
- Graham_scan wikiPageWikiLink Big_O_notation.
- Graham_scan wikiPageWikiLink Category:Articles_with_example_pseudocode.
- Graham_scan wikiPageWikiLink Category:Convex_hull_algorithms.
- Graham_scan wikiPageWikiLink Convex_hull.
- Graham_scan wikiPageWikiLink Cross_product.
- Graham_scan wikiPageWikiLink Dot_product.
- Graham_scan wikiPageWikiLink Euclidean_vector.
- Graham_scan wikiPageWikiLink Heapsort.
- Graham_scan wikiPageWikiLink Interval_(mathematics).
- Graham_scan wikiPageWikiLink Robert_Sedgewick_(computer_scientist).
- Graham_scan wikiPageWikiLink Ronald_Graham.
- Graham_scan wikiPageWikiLink Sorting_algorithm.
- Graham_scan wikiPageWikiLink Time_complexity.
- Graham_scan wikiPageWikiLink File:Graham_Scan.svg.
- Graham_scan wikiPageWikiLinkText "Graham scan".
- Graham_scan wikiPageUsesTemplate Template:Introduction_to_Algorithms.
- Graham_scan wikiPageUsesTemplate Template:Refbegin.
- Graham_scan wikiPageUsesTemplate Template:Refend.
- Graham_scan wikiPageUsesTemplate Template:Reflist.
- Graham_scan subject Category:Articles_with_example_pseudocode.
- Graham_scan subject Category:Convex_hull_algorithms.
- Graham_scan hypernym Method.
- Graham_scan type Software.
- Graham_scan type Algorithm.
- Graham_scan type Redirect.
- Graham_scan comment "Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham, who published the original algorithm in 1972. The algorithm finds all vertices of the convex hull ordered along its boundary.".
- Graham_scan label "Graham scan".
- Graham_scan sameAs Q914780.
- Graham_scan sameAs Mètode_de_Graham.
- Graham_scan sameAs Graham_Scan.
- Graham_scan sameAs Método_de_Graham.
- Graham_scan sameAs پیمایش_گراهام.
- Graham_scan sameAs Parcours_de_Graham.
- Graham_scan sameAs הסריקה_של_גראהם.
- Graham_scan sameAs Algorytm_Grahama.
- Graham_scan sameAs Exame_de_Graham.
- Graham_scan sameAs m.022_1b.
- Graham_scan sameAs Алгоритм_Грэхема.
- Graham_scan sameAs Грахамово_скенирање.
- Graham_scan sameAs เกรแฮมสแกน.
- Graham_scan sameAs Алгоритм_Грехема.
- Graham_scan sameAs Q914780.
- Graham_scan sameAs 葛立恆掃描法.
- Graham_scan wasDerivedFrom Graham_scan?oldid=698115763.
- Graham_scan depiction Graham_Scan.svg.
- Graham_scan isPrimaryTopicOf Graham_scan.