An Optimal Algorithm for Roundness Determination on Convex Polygons
نویسنده
چکیده
In tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar shapes. The measurement of concern in this work is the Minimum Radial Separation, as recommended by the American National Standards Institute (ANSI). Here we show that the algorithm given in Le and Lee [6] runs in /9(n 2) time even for convex polygons. Furthermore, we present an optimal O(n) time algorithm to compute the Minimum Radial Separation of convex polygons, which represents not only a factor n improvement over the previously best known algorithm, but also a factor of log n improvement over Le and Lee's conjectured complexity for the problem.
منابع مشابه
Utilizing the Structure of Data in Obtaining Upper and Lower Algorithmic Bounds
This is a thesis for the degree of \ loso e licentiat," a Swedish degree between a Master of Science, and a PhD. The thesis comprises three separate articles within the area of Algorithms and Data Structures in Computer Science. Each article takes advantage of the inherent structure of input data in order to obtain a tighter algorithmic bound. In the rst article, the inherent nature of convex p...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملOptimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملpolygons. J. Algorithms, 6(2):213–224, 1985.
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. [7] H. Edelsbrunner. Computing the extreme distances between two convex polygons. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.
متن کاملNew Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کامل