Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Chans_algorithm> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Chans_algorithm abstract "In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P of n points, in 2- or 3-dimensional space. The algorithm takes O(n log h) time, where h is the number of vertices of the output (the convex hull). In the planar case, the algorithm combines an O(n log n) algorithm (Graham scan, for example) with Jarvis march, in order to obtain an optimal O(n log h) time. Chan's algorithm is notable because it is much simpler than the Kirkpatrick–Seidel algorithm, and it naturally extends to 3-dimensional space. This paradigm has been independently developed by Frank Nielsen in his Ph. D. thesis.".
- Chans_algorithm wikiPageID "8320430".
- Chans_algorithm wikiPageLength "4970".
- Chans_algorithm wikiPageOutDegree "10".
- Chans_algorithm wikiPageRevisionID "667497526".
- Chans_algorithm wikiPageWikiLink Binary_search.
- Chans_algorithm wikiPageWikiLink Binary_search_algorithm.
- Chans_algorithm wikiPageWikiLink Category:Convex_hull_algorithms.
- Chans_algorithm wikiPageWikiLink Computational_geometry.
- Chans_algorithm wikiPageWikiLink Convex_hull.
- Chans_algorithm wikiPageWikiLink Gift_wrapping_algorithm.
- Chans_algorithm wikiPageWikiLink Graham_scan.
- Chans_algorithm wikiPageWikiLink Jarvis_march.
- Chans_algorithm wikiPageWikiLink Kirkpatrick–Seidel_algorithm.
- Chans_algorithm wikiPageWikiLink Output-sensitive_algorithm.
- Chans_algorithm wikiPageWikiLink Timothy_M._Chan.
- Chans_algorithm wikiPageWikiLinkText "Chan's algorithm".
- Chans_algorithm hasPhotoCollection Chans_algorithm.
- Chans_algorithm wikiPageUsesTemplate Template:Reflist.
- Chans_algorithm subject Category:Convex_hull_algorithms.
- Chans_algorithm hypernym Algorithm.
- Chans_algorithm type Software.
- Chans_algorithm comment "In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P of n points, in 2- or 3-dimensional space. The algorithm takes O(n log h) time, where h is the number of vertices of the output (the convex hull). In the planar case, the algorithm combines an O(n log n) algorithm (Graham scan, for example) with Jarvis march, in order to obtain an optimal O(n log h) time.".
- Chans_algorithm label "Chan's algorithm".
- Chans_algorithm sameAs الگوریتم_چان.
- Chans_algorithm sameAs m.026_b2v.
- Chans_algorithm sameAs Алгоритм_Чана.
- Chans_algorithm sameAs Алгоритм_Чена.
- Chans_algorithm sameAs Thuật_toán_Chan.
- Chans_algorithm sameAs Q2025538.
- Chans_algorithm sameAs Q2025538.
- Chans_algorithm wasDerivedFrom Chans_algorithmoldid=667497526.
- Chans_algorithm isPrimaryTopicOf Chans_algorithm.