Matches in DBpedia 2014 for { <http://dbpedia.org/resource/QuickHull> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- QuickHull abstract "QuickHull is a method of computing the convex hull of a finite set of points in the plane. It uses a divide and conquer approach similar to that of QuickSort, which its name derives from. Its average case complexity is considered to be O(n * log(n)), whereas in the worst case it takes O(n2) (quadratic).".
- QuickHull thumbnail Quickhull_example3.svg?width=300.
- QuickHull wikiPageID "34650849".
- QuickHull wikiPageRevisionID "592901264".
- QuickHull hasPhotoCollection QuickHull.
- QuickHull subject Category:Convex_hull_algorithms.
- QuickHull type Abstraction100002137.
- QuickHull type Act100030358.
- QuickHull type Activity100407535.
- QuickHull type Algorithm105847438.
- QuickHull type ConvexHullAlgorithms.
- QuickHull type Event100029378.
- QuickHull type Procedure101023820.
- QuickHull type PsychologicalFeature100023100.
- QuickHull type Rule105846932.
- QuickHull type YagoPermanentlyLocatedEntity.
- QuickHull comment "QuickHull is a method of computing the convex hull of a finite set of points in the plane. It uses a divide and conquer approach similar to that of QuickSort, which its name derives from. Its average case complexity is considered to be O(n * log(n)), whereas in the worst case it takes O(n2) (quadratic).".
- QuickHull label "QuickHull".
- QuickHull label "QuickHull".
- QuickHull label "Quickhull".
- QuickHull label "Алгоритм быстрой оболочки".
- QuickHull sameAs QuickHull.
- QuickHull sameAs Quickhull.
- QuickHull sameAs m.0j2b1h6.
- QuickHull sameAs Q2123073.
- QuickHull sameAs Q2123073.
- QuickHull sameAs QuickHull.
- QuickHull wasDerivedFrom QuickHull?oldid=592901264.
- QuickHull depiction Quickhull_example3.svg.
- QuickHull isPrimaryTopicOf QuickHull.
