Minimum-Area Rectangle Containing a Set of Points
نویسنده
چکیده
3 The Rotating Calipers Algorithm 3 3.1 Computing the Initial Rectangle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Updating the Rectangle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.1 Distinct Supporting Vertices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.2 Duplicate Supporting Vertices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2.3 Multiple Polygon Edges Attain Minimum Angle . . . . . . . . . . . . . . . . . . . . . 8 3.2.4 The General Update Step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
منابع مشابه
Finding the Largest Empty Rectangle Containing Only a Query Point in Large Multidimensional Databases
Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the minimum rectangle containing the elements of S, and let q be a query point such that q / ∈ S and R ∩ q 6= ∅. In this paper, we present an algorithm for finding the empty rectangle with the largest area, sides parallel to the axes of the space, and containing only the query point q. The idea behind algorith...
متن کاملMaximum Area Rectangle Separating Red and Blue Points
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum separating rectangle. We address the planar, axis-aligned (2D) version, and present an O(m logm+n) time, O(m+n) space algorithm. The running time reduces to O(m + n) ...
متن کاملRecognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle
Given a set of n colored points with a total of m > 3 colors in 2D, the problem of identifying the smallest color-spanning object is studied. We have considered two different shapes: (i) corridor, and (ii) rectangle of arbitrary orientation. Our proposed algorithm identifies the narrowest color-spanning corridor in O(n2 log n) time using O(n) space. Our proposed algorithm for identifying minimu...
متن کاملText Skew Angle Detection in Vision-Based Scanning of Nutrition Labels
An algorithm is presented for text skew angle detection in vision-based scanning of nutrition labels on grocery packages. The algorithm takes a nutrition label image and applies several iterations of the 2D Haar Wavelet Transform (2D HWT) to downsample the image and to compute the horizontal, vertical, and diagonal change matrices. The values of these matrices are binarized and combined into a ...
متن کاملMaintaining the Extent of a Moving Point Set
Let S be a set of n moving points in the plane. We give new eecient and compact kinetic data structures for maintaining the diameter, width, and smallest area or perimeter bounding rectangle of the points. When the points in S move with pseudo-algebraic motions, these structures process O(n 2+) events. We also give constructions showing that (n 2) combinatorial changes are possible in these ext...
متن کامل