DocumentCode :
2162861
Title :
On Automatic Computation of Minimum-Area Encasing Rectangles of Arbitrary Polygons
Author :
Yang, Weifang
fYear :
2009
fDate :
17-19 Oct. 2009
Firstpage :
1
Lastpage :
4
Abstract :
The minimum area encasing rectangle (MAER) of an arbitrary polygon is an important tool in the communities of document recognition, geographic information systems and image retrieval. However, how to calculate MAER precisely is of great difficulty. This paper firstly proves that the MAER of an arbitrary polygon shares a common edge with the convex hull of the polygon. Secondly, an algorithm for computing MAER has been presented and the efficiency of the algorithm has been discussed. Finally, some experiments are given to show the feasibility and reliability of the algorithm.
Keywords :
computational geometry; computer vision; arbitrary polygons; document recognition; geographic information systems; image retrieval; minimum-area encasing rectangles; Civil engineering; Earthquakes; Erbium; Geographic Information Systems; Geophysics computing; Image edge detection; Image recognition; Image retrieval; Information retrieval; Least squares approximation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image and Signal Processing, 2009. CISP '09. 2nd International Congress on
Conference_Location :
Tianjin
Print_ISBN :
978-1-4244-4129-7
Electronic_ISBN :
978-1-4244-4131-0
Type :
conf
DOI :
10.1109/CISP.2009.5304371
Filename :
5304371
Link To Document :
بازگشت