Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
A parallel circle-cover minimization algorithm
Information Processing Letters
Compliant motion in a simple polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
More planar two-center algorithms
Computational Geometry: Theory and Applications
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Two-Center Problems for a Convex Polygon (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Parallel algorithms for geometric intersection graphs
Parallel algorithms for geometric intersection graphs
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Efficient algorithm for placing base stations by avoiding forbidden zone
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
An approximation algorithm for k-center problem on a convex polygon
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Let P be a convex polygon with n vertices. We want to find two congruent disks whose union covers P and whose radius is minimized. We also consider its discrete version with centers restricted to be at vertices of P. Standard and discrete two-center problems are respectively solved in O(n log3 n log log n) and O(n log2 n) time. Furthermore, we can solve both of the standard and discrete two-center problems for a set of points in convex positions in O(n log2 n) time.