Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, and Micha Sharir. Approximation and exact algorithms for minimum-width annuli and shells. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 380389, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computing Roundness is Easy If the Set is Almost Round - Ramos (1999) (3 citations) (Correct)
....and can be solved in O(n log n) time. Bose and Morin [3] extend the results of Mehlhorn et al. 12] to the case where the set is not convex by making some assumptions on the input which are essentially equivalent to the restricted roundness hypothesis that we use below. Finally, Agarwal et al. [2] give a simple approximation algorithm for the roundness problem in arbitrary dimension and the first o(n 3 ) solution for dimension 3. 1.1 Our results In this paper, instead of looking for simple algorithms that give an approximate solution to the problem, we propose simple algorithms that ....
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. These proceedings.
An Efficient, Exact, and Generic Quadratic Programming.. - Gärtner, Schönherr (Correct)
....can be used to test whether the input points lie approximately on a sphere. Roundness tests have in general received some attention recently [8] The problem is also of theoretical importance, because it can be used in an approximation algorithm for the minimumwidth annulus, a much harder problem [1]. The smallest enclosing annulus problem is an LP problem, but it can of course also be considered as QP with a degenerate objective function, having D = 0. We provide test results also for this problem, mainly to show that we incur no loss of efficiency in comparison with a dedicated LP solver ....
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 380--389, 1999.
Shape Fitting with Outliers - Har-Peled, Wang (2003) Self-citation (Har-peled) (Correct)
No context found.
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom., 24(4):687-705, 2000.
Approximating Extent Measures of Points - Agarwal, Har-Peled, Varadarajan (2003) (1 citation) Self-citation (Agarwal Har-peled) (Correct)
No context found.
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom., 24(4):687-705, 2000.
Geometric Shape Approximation via Linearization - Har-Peled, Varadarajan (2001) Self-citation (Har-peled) (Correct)
No context found.
P.K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom., 24(4):687-705, 2000.
On Core-sets and Slabs - Har-Peled (2003) Self-citation (Har-peled) (Correct)
No context found.
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. Discrete Comput. Geom., 24(4):687-705, 2000.
Approximation Algorithms for Minimum-Width Annuli and.. - Agarwal, Aronov.. Self-citation (Agarwal Aronov Har-peled Sharir) (Correct)
....simple and ecient approximation algorithms for computing the minimumwidth . Although several approximation algorithms were proposed earlier for the planar case, all of them made some assumptions either on the input points or on the minimum width annulus. In an earlier version of this paper [1], we also presented the rst subcubic algorithm for computing a minimum width shell containing a set of points in R . The algorithms was fairly involved and mostly interesting as a con rmation that the problem can be solved in subcubic time. Since then we have learned that a signi cantly ....
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pp. 380-389.
Geometric Approximation Algorithms and Randomized Algorithms for .. - Har-Peled (1999) Self-citation (Agarwal Aronov Har-peled Sharir) (Correct)
....to approximate A (S) and while this approximation might not always be good, it can at least be computed in linear time (using linear programming) We show how to refine this idea (and extend it to higher dimensions) to achieve the bounds stated above. For the planar case, Agarwal et al. AAHPS99] gave an O(n log n) time algorithm that computes an annulus of width 2 (S) Using this algorithm, we present in Section 5.3.1, an algorithm that computes an annulus that contains S whose width is at most (1 ) where (S) and 0 is a given error parameter. The algorithm runs in ....
....width 2 (S) Using this algorithm, we present in Section 5.3.1, an algorithm that computes an annulus that contains S whose width is at most (1 ) where (S) and 0 is a given error parameter. The algorithm runs in O(n log n n= time. The results of Chapter 5 appeared in [AAHPS99] 1.3 Approximating the Minimum Volume Bounding Box In Chapter 6, we give an efficient algorithm for solving the following problem: and a parameter 0 1, find a box B (not necessarily axis aligned) that encloses S and approximates the minimumvolume bounding box B opt of S, so that ....
[Article contains additional citation context not shown here]
P.K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 380--389, 1999.
Exact and Approximation Algorithms for Minimum-Width.. - Agarwal, Aronov, Sharir (2001) (5 citations) Self-citation (Agarwal Aronov Sharir) (Correct)
.... of the criteria suggested in the recent ASME Y14.5M standard to determine how closely resembles a cylinder [15, 16] In the last few years much work has been done on measuring the circularity of a planar point set, which is de ned as the width of the thinnest annulus that contains the point set [2, 5, 10, 11, 12]. The best known algorithm runs in O(n 3=2 ) for any 0 [5] and nearlinear approximation algorithms are proposed in [2, 10] In three dimensions, the minimumwidth spherical shell (a region enclosed between two concentric spheres) containing an n element point set S can be computed in time ....
.... much work has been done on measuring the circularity of a planar point set, which is de ned as the width of the thinnest annulus that contains the point set [2, 5, 10, 11, 12] The best known algorithm runs in O(n 3=2 ) for any 0 [5] and nearlinear approximation algorithms are proposed in [2, 10]. In three dimensions, the minimumwidth spherical shell (a region enclosed between two concentric spheres) containing an n element point set S can be computed in time O(n 3 1 19 ) for any 0 [2] The same paper also presents near linear algorithms that compute an approximation to the ....
[Article contains additional citation context not shown here]
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proc. 15th ACM Sympos. Comput. Geom., 1999, 380-389.
Exact and Approximation Algorithms for Minimum-Width.. - Agarwal, Aronov, Sharir (2001) (5 citations) Self-citation (Agarwal Aronov Sharir) (Correct)
.... criteria suggested in the recent ASME Y14.5M standard to determine how closely Gamma resembles a cylinder [14, 15] In the last few years much work has been done on measuring the circularity of a planar point set, which is defined as the width of the thinnest annulus that contains the point set [2, 5, 9, 10, 11]. The best known algorithm runs in O(n 3=2 ffi ) for any ffi 0 [5] and nearlinear approximation algorithms are proposed in [2, 9] In three dimensions, the minimum width spherical shell (a region enclosed between two concentric spheres) containing an n element point set S can be computed in ....
.... work has been done on measuring the circularity of a planar point set, which is defined as the width of the thinnest annulus that contains the point set [2, 5, 9, 10, 11] The best known algorithm runs in O(n 3=2 ffi ) for any ffi 0 [5] and nearlinear approximation algorithms are proposed in [2, 9]. In three dimensions, the minimum width spherical shell (a region enclosed between two concentric spheres) containing an n element point set S can be computed in time O(n 3 Gamma 1 19 ffi ) for any ffi 0 [2] The same paper also presents near linear algorithms that compute an approximation ....
[Article contains additional citation context not shown here]
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Approximation and exact algorithms for minimum-width annuli and shells, Proc. 15th ACM Sympos. Comput. Geom., 1999, 380--389.
Evaluating The Cylindricity Of A Nominally Cylindrical Point Set - Devillers, al. (1999) (1 citation) (Correct)
No context found.
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, and Micha Sharir. Approximation and exact algorithms for minimum-width annuli and shells. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 380389, 1999.
Testing the Quality of Manufactured Disks and Balls - Bose, Morin (Correct)
No context found.
P. K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir. Approximation and exact algorithms for minimum-width annuli and shells. In Proceedings of the 16th ACM Symposium on Computational Geometry (SoCG 99), pages 380--389, 1999.
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