Skip to main content

Minimal spanning tree analysis of regular, random and cluster structures

  • Conference paper
  • 171 Accesses

Abstract

It is shown that a graph called the minimal spanning tree (MST) is capable of detecting several kinds of cluster structure in arbitrary points set. From a MST it is possible to deduce the average edge length m and the standard deviation σ, which are characteristics for the corresponding distribution. The use of a diagram involving both m and σ makes it possible to determine the degree of order by taking a simple reading in the (m, σ) plane. It is also possible, through angular diagrams retrieved from the MST, to bring out directional properties. The method is applied to the study of the growth of granular thin films.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zahn, CT.: IEEE Trans. Comput. C 20, 68 (1971).

    Article  MATH  Google Scholar 

  2. Dussert, C, Rasigni, G., Rasigni, M., Palmari, J., Llebaria, A.: Phys. Rev. B 34, 3528 (1986).

    Article  ADS  Google Scholar 

  3. Rasigni, M., Rasigni, G., Palmari, J.P., Llebaria, A.: J. Opt. Soc. Am. 71, 1124 (1981).

    Article  ADS  Google Scholar 

  4. Rohlf, F.J.: Computer. J. 16, 93 (1973).

    Google Scholar 

  5. Hoffman, R., Jain, A.K.: Pattern Recognit. Lett. 1, 175 (1983).

    Article  Google Scholar 

  6. Stevens, P.J.: Les formes dans la nature. Paris: Editions du Seuil 1978.

    Google Scholar 

  7. Knuth, D.E.: The art of computer programming. New York: Addison Wesley 1969.

    MATH  Google Scholar 

  8. Venables, J.A., Spiller, G.D.T., Nanücken, M.: Rep. Prog. Phys. 47, 399 (1984).

    Article  ADS  Google Scholar 

  9. Diggle, P.J.: Statistical analysis of spatial points patterns. London: Academic Press 1983.

    Google Scholar 

  10. Bassett, G.A., Menker, J.W., Pashley, D.W.: In: Structure and properties of thin films. Neugebauer, C.A., New-Kirk, J.B., Vermilyea, D.A., (eds.), p. 11. New York: Wiley 1959.

    Google Scholar 

  11. Dussert, C, Rasigni, G, Llebaria, A.: J. Theor. Biol. 135, 295 (1988).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Dussert, C., Rasigni, G., Rasigni, M., Palmari, J., Llebaria, A. (1989). Minimal spanning tree analysis of regular, random and cluster structures. In: Chapon, C., Gillet, M.F., Henry, C.R. (eds) Small Particles and Inorganic Clusters. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74913-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74913-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-74915-5

  • Online ISBN: 978-3-642-74913-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics