S. Bespamyatnikh and M. Segal. Covering a set of points by two axis-parallel boxes. In Proc. 9th Canad. Conf. Comput. Geom., pages 33-38, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Approximation Algorithms and Randomized Algorithms for .. - Har-Peled (1999) (Correct)
....maintaining a hierarchical data structure of point containers. Most of these heuristics require O(n) time and space for computing the bounding box (or another shape) but do not provide a guaranteed value (approximation factor of the optimum) of the output. An algorithm of Bespamyatnikh and Segal [BS97] solves a similar problem, in which the n points are to be contained in two axis aligned boxes, and the goal is to minimize the volume (or any other monotonic measure) of the larger box. Their algorithm requires ) time. O Rourke [O R85] presented the only algorithm (to the best of our ....
....also used for maintaining a hierarchical data structure of point containers. Most of these heuristics require O(n) time and space for computing the bounding box (or another shape) but do not provide output with any guarantee (i.e. approximation factor of the optimal container) An algorithm of [BS97] solves a similar problem, in which the n points are to be contained in two axis aligned boxes, and the goal is to minimize the volume (or any other monotone measure) of the larger box. Their algorithm requires O(n ) time. O Rourke presented the only algorithm (to the best of our knowledge) ....
S. Bespamyatnikh and M. Segal. Covering a set of points by two axis-parallel boxes. In Proc. 9th Canad. Conf. Comput. Geom., pages 33--38, 1997.
Upper Bounds for Z-Grid Rectangular Covering Problems - Porschen (2001) (Correct)
....Another applicational eld may be picture processing [12,14] and, closely related, data compression. Of course, besides merely abstract set or graph theoretic covering problems ( 1] 11] there are also lots of geometric variants most of them concerning points distributed in the Euclidean plane [3], many of them, as far as dealing with arbitrary many covering components being NP hard [6,9] On the other hand, there are also certain partition or clustering problems [4,5,8] which could be related to partition variants of the problem at hand. Whereas there are tiling problems [10,13] which in ....
S. Bespamyatnikh, M. Segal, Covering a set of points by two axis-parallel boxes, Preprint, 1999. 20
Efficiently Approximating the Minimum-Volume Bounding Box.. - Barequet, Har-Peled (3 citations) (Correct)
....also used for maintaining a hierarchical data structure of point containers. Most of these heuristics require O(n) time and space for computing the bounding box (or another shape) but do not provide output with any guarantee (i.e. approximation factor of the optimal container) An algorithm of Bespamyatnikh and Segal [1997] solves a similar problem, in which the n points are to be contained in two axis aligned boxes, and the goal is to minimize the volume (or any other monotone measure) of the larger box. Their algorithm requires O(n 2 ) time. O Rourke [1985] presented the only algorithm (to the best of our ....
Bespamyatnikh, S., and Segal, M. 1997. Covering a set of points by two axis-parallel boxes. Proc. 9th Canadian Conf. on Computational Geometry , 33--38.
Efficiently Approximating the Minimum-Volume Bounding Box.. - Barequet, Har-Peled (3 citations) (Correct)
....a hierarchical data structure of point containers. Most of these heuristics require O(n) time and space for computing the bounding box (or another shape) but did not provide a guaranteed value (approximation factor of the optimum) of the output. An algorithm of Bespamyatnikh and Segal [BS97] solves a similar problem, in which the n points are to be contained in two axis aligned boxes, and we wish to minimize the volume (or any other monotonic measure) of the larger box. Their algorithm requires O(n 2 ) time. O Rourke presented the only algorithm (to the best of our knowledge) for ....
S. Bespamyatnikh and M. Segal, Covering a set of points by two axis-parallel boxes, Proc. 9th Canad. Conf. Comput. Geom., 33--38, 1997.
Efficiently Approximating the Minimum-Volume Bounding Box.. - Barequet, Har-Peled (3 citations) (Correct)
....maintaining a hierarchical data structure of point containers. Most of these heuristics require O(n) time and space for computing the bounding box (or another shape) but did not provide a guaranteed value (approximation factor of the optimum) of the output. An algorithm of Bespamyatnikh and Segal [BS97] solves a similar problem, in which the n points are to be contained in two axis aligned boxes, and the goal is to minimize the volume (or any other monotonic measure) of the larger box. Their algorithm requires O(n 2 ) time. O Rourke presented the only algorithm (to the best of our knowledge) ....
S. Bespamyatnikh and M. Segal. Covering a set of points by two axis-parallel boxes. In Proc. 9th Canad. Conf. Comput. Geom., pages 33--38, 1997.
Efficiently Approximating the Minimum-Volume Bounding Box.. - Barequet, Har-Peled (2001) (3 citations) (Correct)
No context found.
S. Bespamyatnikh and M. Segal. Covering a set of points by two axis-parallel boxes. In Proc. 9th Canad. Conf. Comput. Geom., pages 33-38, 1997.
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