A Linear time algorithm for computing the Voronoi diagram of a convex polygon
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A linear time algorithm for finding all farthest neighbors in a convex polygon
Information Processing Letters
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
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
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Applications
CGI '96 Proceedings of the 1996 Conference on Computer Graphics International
Computational geometry.
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Let P be a polygonal region which is forbidden in order to place a base station in the context of mobile communication. Our objective is to place one base station at any point on the boundary of P or two base stations at some specified edge and assign a range such that every point in the region is covered by those base stations and the maximum range assigned to these base stations is minimum among all such possible choice of base stations. Here we consider the forbidden region P as convex and base station can be placed on the boundary of the region. We present optimum linear time algorithms for these problems.