A fast search and classification method of isomorphic polygons in LSI design data using geometric invariant feature value Online publication date: Fri, 10-Mar-2017
by Shuji Shoji; Akio Koyama
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 6, No. 4, 2016
Abstract: A large number of isomorphic polygons are included in design data of LSI. Fast search and classification for isomorphic polygons are expected for compactness and fast pattern search of design data. In this paper, we propose a high speed and high accuracy classification method of isomorphic polygons. The proposed method can reduce a shape comparison process significantly by using a geometric invariant feature value for a polygon. The feature value is calculated by summation of distance from centre of gravity to each vertex, and a polygon contour length. This value does not be affected by parallel shift, rotation and reduced scale. The feature value is same among isomorphic polygons and it is possible to access an isomorphic polygon group quickly by using this value. From evaluation results, we verified that the proposed method can realise fast classification for isomorphic polygons, and compactness of design data.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook