Patterns and pathways of packing circles into a square
by Chikit Au
International Journal of Computer Applications in Technology (IJCAT), Vol. 48, No. 1, 2013

Abstract: Seeking an improbable, but globally optimum, state is useful in many scientific and engineering endeavours. To handle a larger data size, computational techniques are often employed. Yet, they are bound by the inherent combinatorial complexity. This paper employs the examples of packing a set of circles into a square to verify the existence of the pathways between the global optimisations based on the hypothesis that hopping from one known optimum to an unknown optimum in a global landscape is feasible. Twenty seven proven optimal circle packing configurations are investigated and eleven pathways are identified. These pathways lead to other optimal configurations which conform to the best known results. These pathways are beneficial to obtaining the optimum since it does not require going through the combinatorial many intermediate configuration before reaching the optimum.

Online publication date: Wed, 31-Jul-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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