 Beside realizing all packings below the critical density bound, our algorithm can also be used as a constant-factor approximation algorithm when looking for the smallest non-acute triangle of a given side ratio in which a given set of circles can be packed . An interactive visualization of the Split Packing approach and other related material can be found at URL
<meaning-changed>  Beside realizing all packings below the critical density bound, our algorithm can also be used as a constant-factor approximation algorithm when looking for the smallest non-acute triangle of a given side ratio in which a given set of circles can be packed . An interactive visualization of the Split Packing approach and other related material can be found at URL
 Beside realizing all packings below the critical density bound, our algorithm can also be used as a constant-factor approximation algorithm when looking for the smallest non-acute triangle of a given side ratio in which a given set of circles can be packed , due to its polynomial runtime. A browser-based, interactive visualization of the Split Packing approach and other related material can be found at URL