In the  circle packing problem for triangular containers , one asks whether a given set of circles can be packed into a given triangle . Packing problems like this have been shown to be NP-hard.
<clarity> In the  circle packing problem for triangular containers , one asks whether a given set of circles can be packed into a given triangle . Packing problems like this have been shown to be NP-hard.
In the circle packing problem for triangular containers , one asks whether a given set of circles can be packed into a given container . Packing problems like this have been shown to be NP-hard.