The following pages link to A fast convex hull algorithm (Q1251805):
Displaying 8 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Randomized quickhull (Q675302) (← links)
- Finite nondense point set analysis (Q686052) (← links)
- Mean area of the convex hull of a run and tumble particle in two dimensions (Q5048546) (← links)
- The convex hull of the run-and-tumble particle in a plane (Q5135142) (← links)
- A convex Hull algorithm for solving a location problem (Q5501876) (← links)
