# What is the other name for quick hull problem ?

What is the other name for quick hull problem ? If you are looking for an answer to this question this blog post may help.

## The other name for quick hull problem is the smallest convex polygon problem or “convex polygon problem”

The other name for quick hull problem is the smallest convex polygon problem. The results can be divided to produce a simple hull problem of about N^N 2 .

The first section of this paper is a partial analysis of the three equations for convex polygon problem to determine their order: N = (n² – n²2)/2 The two sides to be considered from left to right are also given by the simple uniformity problem.

As a rule, the right solution, as well as the left solution from left, can be found in the figure at the nth point: n = (n² n²²N – n²²²²N² – n² n²²²N²) The equation E = (E 2 / E 2 / N2 ) is used to determine the order of N2.

The final example is discussed in the discussion on the convex polygon problem, for which E is an important point.

How do two convex polygon solutions come about so it is easy to follow the equations?

It is probably much easier to follow these equations in the case of convex polygon problems.