Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational geometry on hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Mesh Computer Algorithms for Computational Geometry
IEEE Transactions on Computers
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
Run-Based Algorithms for Binary Image Analysis and Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimal enclosing parallelogram with application
Proceedings of the eleventh annual symposium on Computational geometry
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Podality-Based Time-Optimal Computations on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Algorthmic pradigms: examples in computational geometry II
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Efficient nesting of congruent convex figures
Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Spectral processing of point-sampled geometry
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
A Simple Approach to Recognise Geometric Shapes Interactively
GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Experimental Evaluation of a Trainable Scribble Recognizer for Calligraphic Interfaces
GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Determining the Convex Hull in Large Multidimensional Databases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Packing Convex Polygons into Rectangular Boxes
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
A global optimal approach to facility location in the presence of forbidden regions
Computers and Industrial Engineering
A New Convexity Measure for Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
Measuring Elongation from Shape Boundary
Journal of Mathematical Imaging and Vision
Boundary based shape orientation
Pattern Recognition
Boundary based shape orientation
Pattern Recognition
Nesting of two-dimensional irregular parts: an integrated approach
International Journal of Computer Integrated Manufacturing
New Measure for Shape Elongation
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Measuring the Related Properties of Linearity and Elongation of Point Sets
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Covering a set of points in a plane using two parallel rectangles
Information Processing Letters
A note on the all nearest-neighbor problem for convex polygons
Information Processing Letters
Combining features for distorted fingerprint matching
Journal of Network and Computer Applications
Text extraction from graphical document images using sparse representation
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
A system to detect rooms in architectural floor plan images
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
Shape elongation from optimal encasing rectangles
Computers & Mathematics with Applications
Modeling and prediction of moving region trajectories
Proceedings of the ACM SIGSPATIAL International Workshop on GeoStreaming
Fast oriented bounding box optimization on the rotation group SO(3,ℝ)
ACM Transactions on Graphics (TOG)
Largest area convex hull of axis-aligned squares based on imprecise data
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Generic shape classification for retrieval
GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
Boundary based orientation of polygonal shapes
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
Algorithms for nesting with defects
Discrete Applied Mathematics
| Hi-index | 48.26 |
This paper describes a method for finding the rectangle of minimum area in which a given arbitrary plane curve can be contained. The method is of interest in certain packing and optimum layout problems. It consists of first determining the minimal-perimeter convex polygon that encloses the given curve and then selecting the rectangle of minimum area capable of containing this polygon. Three theorems are introduced to show that one side of the minimum-area rectangle must be collinear with an edge of the enclosed polygon and that the minimum-area encasing rectangle for the convex polygon is also the minimum-area rectangle for the curve.