Home
last modified time | relevance | path

Searched refs:hull (Results 1 – 5 of 5) sorted by relevance

/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_bench.cpp143 hull.insert(hull.end(), points.begin(), points.end()); in quickhull()
153 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
163 pointVec_t hull; in main() local
175 quickhull(points, hull); in main()
564 appendVector(points, hull); in quickhull()
566 hull.insert(hull.end(), points.begin(), points.end()); in quickhull()
579 appendVector(H, hull); in quickhull()
581 hull.insert(hull.end(), H.begin(), H.end()); in quickhull()
602 pointVec_t hull; in main() local
630 pointVec_t hull; in main() local
[all …]
H A Dconvex_hull_sample.cpp246 void quickhull(const pointVec_t &points, pointVec_t &hull) { in quickhull() argument
248 appendVector(points, hull); in quickhull()
257 divide_and_conquer(points, hull, p_maxx, p_minx); in quickhull()
260 appendVector(H, hull); in quickhull()
270 pointVec_t hull; in main() local
295 quickhull(points, hull); in main()
299 << " Points in hull: " << hull.size() << "\n"; in main()
301 hull.clear(); in main()
H A DREADME.md2 Parallel version of convex hull algorithm (quick hull).
/oneTBB/examples/parallel_reduce/
H A DREADME.md6 | convex_hull | Parallel version of convex hull algorithm (quick hull).
/oneTBB/examples/
H A DREADME.md21 | parallel_reduce/convex_hull | Parallel version of convex hull algorithm (quick hull).