Algorithms for packing two circles in a convex polygon
From MaRDI portal
Recommendations
- Efficient algorithms for the dense packing of congruent circles inside a square
- A polynomial time circle packing algorithm
- A circle packing algorithm
- Techniques and results on approximation algorithms for packing circles
- Polynomial-time approximation schemes for circle packing problems
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Polynomial-time approximation schemes for circle and other packing problems
- Greedy algorithms for packing unequal circles into a rectangular container
- Approximation algorithms for solving packing problems of convex polygons in plane
Cited in
(9)- Packing two disks in a polygon
- Algorithm to find a maximum 2-packing set in a cactus
- Three problems about simple polygons
- Locating two obnoxious facilities using the weighted maximin criterion
- scientific article; zbMATH DE number 3988128 (Why is no real title available?)
- Faster Circle Packing with Application to Nonobtuse Triangulation
- scientific article; zbMATH DE number 1796962 (Why is no real title available?)
- Greedy algorithms for packing unequal circles into a rectangular container
- Packing two disks into a polygonal environment.
This page was built for publication: Algorithms for packing two circles in a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2728847)