DBpedia – Linked Data Fragments

Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Kirkpatrick–Seidel_algorithm> ?p ?o }

• Kirkpatrick–Seidel_algorithm abstract "The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm" is an algorithm for computing the convex hull of a set of points in the plane, with O(n log h) time complexity, where n is the number of input points and h is the number of points in the hull. Thus, the algorithm is output-sensitive: its running time depends on both the input size and the output size. Another output-sensitive algorithm, the gift wrapping algorithm, was known much earlier, but the Kirkpatrick–Seidel algorithm has an asymptotic running time that is significantly smaller and that always improves on the O(n log n) bounds of non-output-sensitive algorithms. The Kirkpatrick–Seidel algorithm is named after its inventors, David G. Kirkpatrick and Raimund Seidel.Although the algorithm is asymptotically very efficient, it is not very practical for moderate-sized problems.".
• Kirkpatrick–Seidel_algorithm wikiPageID "11699089".
• Kirkpatrick–Seidel_algorithm wikiPageLength "4160".
• Kirkpatrick–Seidel_algorithm wikiPageOutDegree "14".
• Kirkpatrick–Seidel_algorithm wikiPageRevisionID "666947779".
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Analysis_of_algorithms.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Bitangent.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Category:Convex_hull_algorithms.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Chans_algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Convex_hull.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink David_G._Kirkpatrick.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Divide-and-conquer_algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Divide_and_conquer_algorithms.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Franco_P._Preparata.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Gift_wrapping_algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Median.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Output-sensitive_algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Raimund_Seidel.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Recursion.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLink Recursively.
• Kirkpatrick–Seidel_algorithm wikiPageWikiLinkText "Kirkpatrick–Seidel algorithm".
• Kirkpatrick–Seidel_algorithm wikiPageWikiLinkText "The ultimate planar convex hull algorithm".
• Kirkpatrick–Seidel_algorithm hasPhotoCollection Kirkpatrick–Seidel_algorithm.
• Kirkpatrick–Seidel_algorithm wikiPageUsesTemplate Template:Reflist.
• Kirkpatrick–Seidel_algorithm subject Category:Convex_hull_algorithms.
• Kirkpatrick–Seidel_algorithm comment "The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm" is an algorithm for computing the convex hull of a set of points in the plane, with O(n log h) time complexity, where n is the number of input points and h is the number of points in the hull. Thus, the algorithm is output-sensitive: its running time depends on both the input size and the output size.".
• Kirkpatrick–Seidel_algorithm label "Kirkpatrick–Seidel algorithm".
• Kirkpatrick–Seidel_algorithm sameAs m.02rpd9x.
• Kirkpatrick–Seidel_algorithm sameAs Алгоритм_Киркпатрика.
• Kirkpatrick–Seidel_algorithm sameAs ขั้นตอนวิธีเคิร์กแพทริก-ไซเดิล.
• Kirkpatrick–Seidel_algorithm sameAs Алгоритм_Кіркпатрика-Зейделя.
• Kirkpatrick–Seidel_algorithm sameAs Q4060672.
• Kirkpatrick–Seidel_algorithm sameAs Q4060672.
• Kirkpatrick–Seidel_algorithm wasDerivedFrom Kirkpatrick–Seidel_algorithm?oldid=666947779.
• Kirkpatrick–Seidel_algorithm isPrimaryTopicOf Kirkpatrick–Seidel_algorithm.