An algorithm for 3D simulation of branchwork karst networks using Horton parameters and A-star. Application to a synthetic case.

in: Geological Society of London - Special Publications - Advances in Carbonate Exploration and Reservoir Analysis, 370:1 (295-306)

Abstract

his paper presents a method to stochastically simulate 3D karstic networks and more specifically branchwork pattern cave systems. Considering that they can be compared with 3D fluvial networks, the topological classification of Strahler and the corresponding ratios of Horton are used to define three morphometric parameters. These parameters are integrated in an algorithm that computes branches hierarchically to obtain a final network organized around the main observed inlet and outlet with a branching complexity controlled by the user. Each branch corresponds to a low-cost path between two points calculated with the

Download / Links

BibTeX Reference

@ARTICLE{Collon-Drouaillet2012,
    author = { Collon, Pauline and Henrion, Vincent and Pellerin, Jeanne },
     title = { An algorithm for 3D simulation of branchwork karst networks using Horton parameters and A-star. Application to a synthetic case. },
   journal = { Geological Society of London - Special Publications - Advances in Carbonate Exploration and Reservoir Analysis },
    volume = { 370 },
    number = { 1 },
      year = { 2012 },
     pages = { 295-306 },
       url = { http://sp.lyellcollection.org/cgi/doi/10.1144/SP370.3 },
       doi = { 10.1144/SP370.3 },
  abstract = { his paper presents a method to stochastically simulate 3D karstic networks and more specifically branchwork pattern cave systems. Considering that they can be compared with 3D fluvial networks, the topological classification of Strahler and the corresponding ratios of Horton are used to define three morphometric parameters. These parameters are integrated in an algorithm that computes branches hierarchically to obtain a final network organized around the main observed inlet and outlet with a branching complexity controlled by the user. Each branch corresponds to a low-cost path between two points calculated with the  }
}