Skip to main content

Procedural Natural Phenomena from Least-Cost Paths in a Weighted Graph

  • Conference paper
Computer Vision and Computer Graphics. Theory and Applications (VISIGRAPP 2007)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 21))

Included in the following conference series:

Abstract

We present a method for creating geometric models of dendritic forms. Dendritic shapes are commonplace in the natural world; some examples of objects exhibiting dendritic shape include lichens, coral, trees, lightning, rivers, crystals, and venation patterns. Our method first generates a regular lattice with randomly weighted edges, then finds least-cost paths through the lattice. Multiple paths from a single starting location (or generator) are connected into a single dendritic shape. Alternatively, path costs can be used to segment volumes into irregular shapes. The pathfinding process is inexpensive, and allows user control through specification of endpoint placement, distribution of generators, and arrangement of nodes in the graph.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ball, P.: The Self-Made Tapestry: Pattern Formation in Nature. Oxford University Press, Oxford (2004)

    Google Scholar 

  2. Bertails, F., Ménier, C., Cani, M.-P.: A Practical Self-Shadowing Algorithm for Interactive Hair Animations. In: Proceedings of Graphics Interface 2005, pp. 71–78 (2005)

    Google Scholar 

  3. Bunde, A., Havlin, S.: Fractals and Disordered Systems. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  4. Desboinet, B., Galin, E., Akkoche, S.: Simulating and Modeling Lichen Growth. Computer Graphics Forum 23(3), 341–350 (2004)

    Article  Google Scholar 

  5. Ebert, D., Musgrave, F., Peachey, D., Perlin, K., Worley, S.: Texturing and Modeling: A Procedural Approach, 3rd edn. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  6. Gastner, M., Newman, M.: Shape and efficiency in spatial distribution networks. Journal of Statistical Mechanics 1(P01015) (2006)

    Google Scholar 

  7. Kim, T., Henson, M., Lin, M.: A hybrid algorithm for modeling ice formation. In: The 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation, pp. 305–314 (2004)

    Google Scholar 

  8. Kim, T., Lin, M.: Visual simulation of ice crystal growth. In: The 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation, pp. 86–97 (2003)

    Google Scholar 

  9. Kim, T., Lin, M.: Physically based animation and rendering of lightning. In: Pacific Conference on Computer Graphics and Applications 2004, pp. 267–275 (2004)

    Google Scholar 

  10. Lindenmeyer, A., Prusinkiewicz, P.: The Algorithmic Beauty of Plants. Springer, Heidelberg (1990)

    Google Scholar 

  11. Lokovic, T., Veach, E.: Deep shadow maps. In: Proceedings of SIGGRAPH 2000, pp. 385–392 (2000)

    Google Scholar 

  12. Mech, R., Prusinkiewicz, P.: Visual models of plants interacting with their environment. In: Proceedings of SIGGRAPH 1996, pp. 397–410 (1996)

    Google Scholar 

  13. Prusinkiewicz, P., James, M., Mech, R.: Synthetic Topiary. In: Proceedings of SIGGRAPH 1994, pp. 351–358 (1994)

    Google Scholar 

  14. Winston, P.: Artificial Intelligence. Addison-Wesley, Reading (1992)

    Google Scholar 

  15. Witten, T., Sander, L.: Diffusion-Limited Aggregation, a Kinetic Critical Phenomenon. Physical Review Letters 47(19), 1400–1403 (1981)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, L., Mould, D. (2008). Procedural Natural Phenomena from Least-Cost Paths in a Weighted Graph. In: Braz, J., Ranchordas, A., Araújo, H.J., Pereira, J.M. (eds) Computer Vision and Computer Graphics. Theory and Applications. VISIGRAPP 2007. Communications in Computer and Information Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89682-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89682-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89681-4

  • Online ISBN: 978-3-540-89682-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics