Hoffmann, M. A simple linear algorithm for computing rectangular three-centers. In Proc. 11th Canad. Conf. Comput. Geom. (1999), pp. 72-75.  Home/Search   Document Details and Download   Summary   Related Articles

....a factor of less than two unless P = NP [10, 9] one cannot expect to do better for the more general problem of covering polygons. Despite the apparent intractability, ecient algorithms have been developed for small values of p. The rectilinear 2 and 3 center problem can be solved in linear time [4, 8, 13], while for p = 4 already there is a lower bound of n log n) and algorithms of matching complexity for p 5 [3, 11, 12] The hope is that also the polygon covering problem can be solved eciently for a small number of covering squares. 2 Results While in principle techniques similar to the ....

Hoffmann, M. A simple linear algorithm for computing rectangular three-centers. In Proc. 11th Canad. Conf. Comput. Geom. (1999), pp. 72-75.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC