Abstract
We consider algorithms for packing two circles in a given 77,-vert ex convex polygon. The first algorithm outputs a pair of equal non-overlapping circles of maximum radius and has running time O(n). The second algorithm outputs a pair of non-overlapping circles whose sum of radii is maximum and has running time 0(n2).
Cite
CITATION STYLE
APA
Bose, P., Czyzowicz, J., Kranakis, E., & Maheshwari, A. (2000). Algorithms for packing two circles in a convex polygon. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 93–104). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free