Computational geometry: an introduction
Computational geometry: an introduction
Computer-Aided Design
Detection of generalized principal axes is rotationally symmetric shapes
Pattern Recognition
Computing deviations from convexity in polygons
Pattern Recognition Letters
On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Alternative area-perimeter ratios for measurement of 2D shape compactness of habitats
Applied Mathematics and Computation
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
Statistical Shape Features for Content-Based Image Retrieval
Journal of Mathematical Imaging and Vision
Rectilinearity Measurements for Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
Measuring shape: ellipticity, rectangularity, and triangularity
Machine Vision and Applications
A New Convexity Measure for Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Convexity Measure Based on a Probabilistic Interpretation of Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Vision and Image Understanding
Notes on shape orientation where the standard method does not work
Pattern Recognition
Measuring Elongation from Shape Boundary
Journal of Mathematical Imaging and Vision
Boundary based shape orientation
Pattern Recognition
Measuring linearity of planar point sets
Pattern Recognition
On the Convex Hull of the Integer Points in a Bi-circular Region
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On the Orientability of Shapes
IEEE Transactions on Image Processing
| Hi-index | 0.09 |
Let S be a shape with a polygonal boundary. We show that the boundary of the maximally elongated rectangle R(S) which encases the shape S contains at least one edge of the convex hull of S. Such a nice property enables a computationally efficient construction of R(S). In addition, we define the elongation of a given shape S as the ratio of the length of R(S) (determined by the longer edge of R(S)) and the width of R(S) (determined by the shorter edge of R(S)) and show that a so defined shape elongation measure has several desirable properties. Several examples are given in order to illustrate the behavior of the new elongation measure. As a by-product, of the method developed here, we obtain a new method for the computation of the shape orientation, where the orientation of a given shape S is defined by the direction of the longer edge of R(S).