Open Access Open Access  Restricted Access Subscription or Fee Access

A Packing Remnant Feature Extraction Scheme Based on Graph Theory

Jing Tao, Wei Yang

Abstract


Many scholars have done a lot of work on designing reasonable and effective packing algorithms. Because of its shape of some parts with complex graphics, no mater how to pack, the remnant persists. In order to solve this problem, combining with the basic principle of graph theory, a packing remnant feature extraction algorithm based on graph theory is proposed. Geometric rules are established firstly, and a digraph is founded after the treatment of packing diagram, so the packing remnant extraction problem is transformed to an internal surface problem; then a chain search algorithm based on depth traversal is built to traverse the simplified diagram and extract the remnant characteristics; finally the process of the algorithm is given and the effectiveness of the method is verified with an instance.

Keywords


Packing Algorithms, Graph Theory, Feature Extraction, Depth Traversal.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.