Constrained stochastic simulation of 3D branchwork karsts.

in: Proc. 31st Gocad Meeting, Nancy

Abstract

The present work proposes a new method to stochastically simulate 3D karstic networks. Based on the graph search algorithm A* , it uses observed inlet and outlet locations to generate karstic networks between these points. By an adapted definition of the searching functions of A* , the karst is preferentially generated along surfaces known for their karstogenetical properties: inception horizons, paleo-watertables, fractures. Its originality is also to focus on a specifical pattern of cave systems, the branchwork one, and to propose parameters to control the branching complexity. Its application to a 3D synthetic case gives promising results.

Download / Links

BibTeX Reference

@inproceedings{Collon-DrouailletGM2011,
 abstract = { The present work proposes a new method to stochastically simulate 3D karstic networks. Based on the graph search algorithm A* , it uses observed inlet and outlet locations to generate karstic networks between these points. By an adapted definition of the searching functions of A* , the karst is preferentially generated along surfaces known for their karstogenetical properties: inception horizons, paleo-watertables, fractures. Its originality is also to focus on a specifical pattern of cave systems, the branchwork one, and to propose parameters to control the branching complexity. Its application to a 3D synthetic case gives promising results. },
 author = { Collon, Pauline AND Pellerin, Jeanne },
 booktitle = { Proc. 31st Gocad Meeting, Nancy },
 title = { Constrained stochastic simulation of 3D branchwork karsts. },
 year = { 2011 }
}