F. Abbasinejad, P. Joshi, and N. Amenta, Surface patches from unorganized space curves, Proceedings of the Twenty-eighth Annual Symposium on Computational Geometry. Chapel Hill, p.34, 2012.

E. Anderson, LAPACK Users' Guide. Third. Philadelphia, PA: Society for Industrial and Applied Mathematics, p.76, 1999.

M. Arnold, Architecture and policy for adaptive optimization in virtual machines, IBM Research Report, p.81, 2018.

S. Azri, Review of Spatial Indexing Techniques for Large Urban Data Management, p.20, 2013.

B. Bates, Change and Water -IPCC Technical Paper VI, Tech. rep. Intergovernmental Panel on Climate Change, issue.7, 2012.

J. Baudrillard, Parameterization of polylines in unorganized crosssections and open surface reconstruction, 9th International Conference on Curves and Surfaces, pp.24-24, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01774804

J. Baudrillard, Reconstruction of piecewise-explicit surfaces from three-dimensional polylines, International Conference on Geographical Information Systems Theory, Applications and Management (Doctoral Consortium), p.59, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01720662

S. Bae, R. Balakrishnan, and K. Singh, ILoveSketch: asnatural-as-possible sketching system for creating 3D curve models, Proceedings of the 21st Annual ACM Symposium on User Interface Software and Technology, p.34, 2008.

N. Beckmann, The r*-tree:an efficient and robust access method forpoints and rectangles, ACM Transactions on Graphics, vol.19, p.23, 1990.

M. Berger, A survey of surface reconstruction from point clouds, Computer Graphics Forum, vol.36, issue.1, p.17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01348404

M. Bessmeltsev, Design-driven quadrangulation of closed 3D curves, ACM Transactions on Graphics, vol.31, issue.11, p.34, 2012.

J. Boissonnat and B. Geiger, Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation, Biomedical Image Processing and Biomedical Visualization. Vol. 1905. International Society for Optics and Photonics, p.34, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00076934

T. Bially, Space-filling curves: their generation and their application to bandwidth reduction, IEEE Transactions on Information Theory, p.22, 1969.

J. Boissonnat and P. Memari, Shape reconstruction from unorganized cross-sections, Proceedings of the Fifth Eurographics Symposium on Geometry Processing, p.34, 2007.

F. Bookstein, Principal warps: thin-plate splines and the decomposition of deformations, IEEE Transactions on Pattern Analysis and Machine Intelligence 11, vol.6, p.34, 1989.

M. Botsch, Polygon Mesh Processing. AK Peters, vol.86, p.17, 2010.

R. Beatson, M. Powell, and A. Tan, Fast evaluation of polyharmonic splines in three dimensions, IMA Journal of Numerical Analysis, vol.27, p.34, 2007.

J. E. Bresenham, Algorithm for computer control of a digital plotter, IBM Systems Journal, vol.4, p.37, 1965.

I. C. Briggs, Machine contouring using minimum curvature, Geophysics 39, p.35, 1974.

A. Buluc, Recent advances in graph partitioning, Lecture Notes in Computer Science, vol.9220, p.44, 2013.

A. Bermano, A. Vaxman, and C. Gotsman, Online reconstruction of 3D objects from arbitrary cross-sections, ACM Transactions on Graphics, vol.30, issue.11, p.34, 2011.

G. Caumon, Surface-based 3D modeling of geological structures, Mathematical Geosciences, vol.41, p.12, 2009.
URL : https://hal.archives-ouvertes.fr/insu-00429910

P. Collon and G. Caumon, 3D geomodelling in structurally complex areas: implicit vs. explicit representations". In: 79th EAGE Conference Exhibition, p.14, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01534251

N. Clausolles, P. Collon, and G. Caumon, A workflow for 3D stochastic modeling of salt from seismic images, 80th EAGE Conference and Exhibition, p.14, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01825267

M. Trishul, M. D. Chilimbi, J. R. Hill, and . Larus, Making pointer-based data structures cache conscious, Computer 33, vol.12, p.88, 2000.

, Advancing the Science of Climate Change : America's Climate Choices. Washington, D.C: National Academies Press, 2010.

K. Crane, Discrete Differential Geometry: An Applied Introduction, p.63, 2015.

S. Dalvi, Fundamentals of Oil and Gas Industry for Beginners, vol.4, 2015.

E. Danielsson, Euclidian distance mapping, Computer Graphics and Image Processing, vol.14, p.51, 1980.

A. Timothy and . Davis, Direct Methods for Sparse Linear Systems, vol.2, p.76, 2006.

B. Douillard, Hybrid elevation maps: 3D surface models for segmentation, IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.1532-1538, 2010.

H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel, On the shape of a set of points in the plane, IEEE Transactions on Information Theory, vol.29, p.49, 1983.

X. Emery, Simple and ordinary multigaussian kriging for estimating recoverable reserves, Mathematical Geology, vol.37, p.34, 2005.
DOI : 10.1007/s11004-005-1560-6

R. Finkel and J. L. Bentley, Quad trees: a data structure for retrieval on composite keys, Acta Informatica, vol.4, p.22, 1974.

M. Floater and K. Hormann, Surface parameterization: a tutorial and survey, Advances in Multiresolution for Geometric Modeling (2054), vol.63, p.17

M. Floater, Mean value coordinates, Computer-Aided Geometric Design, vol.20, p.64, 2003.
DOI : 10.1016/s0167-8396(03)00002-5

A. Fog, Optimizing Subroutines in Assembly Language: An Optimization Guide for x86 Platforms, p.82, 2018.

A. Fog, The Microarchitecture of Intel, AMD and VIA CPUs: An Optimization Guide for Assembly Programmers and Compiler Makers, p.82, 2018.

M. Floater and M. Reimers, Meshless parameterization and surface reconstruction, Computer-Aided Geometric Design, vol.18, pp.77-92, 2001.
DOI : 10.1016/s0167-8396(01)00013-9

A. Fournier and W. T. Reeves, A simple model of ocean waves, ACM Siggraph Computer Graphics, p.18, 1986.

H. Fuchs, On visible surface generation by a priori tree structures, SIGGRAPH '80 Conference Proceedings, p.22, 1980.

I. Gargantini, An effective way to represent quadtrees, ACM Communications on Graphics, vol.25, pp.905-910, 1982.

V. Gaede and O. Günther, Multidimensional access methods, Computing Surveys, vol.30, p.20, 1998.
DOI : 10.1145/280277.280279
URL : http://www.cs.columbia.edu/~gravano/Qual/Papers/24 - Multidimensional Access Methods.pdf

G. Greiner and K. Hormann, Interpolating and approximating scattered 3D-data with hierarchical tensor product b-splines, Surface Fitting and Multiresolution Methods, p.68, 1997.

M. Gamito and . Forest-kenton-musgrave, Procedural Landscapes with Overhangs, p.18, 2003.

G. J. Grevera, Distance Transform Algorithms and their Implementation and Evaluation, p.51, 2004.
DOI : 10.1007/978-0-387-68413-0_2

A. Guttman, R-trees: a dynamic index structure for spatial searching, SIGMOD Rec, vol.14, p.23, 1984.

K. Hormann, B. Levy, and A. Sheffer, Mesh Parameterization: Theory and Practice, Siggraph Course Notes, vol.17, pp.63-65, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00186795

J. F. Hughes, Computer Graphics: Principles and Practice. Third, p.19, 2013.

T. Ijiri, Flower modeling via x-ray computed tomography, ACM Transactions on Graphics, vol.33, issue.10, p.34, 2014.

, Intel® 64 and IA-32 Architectures Software Developer's Manual. 2015 (cit, p.82

M. Isenburg and J. R. Shewchuk, Streaming Connected Component Computation for Trillion Voxel Images, p.20, 2011.

A. Jäger-waldau, , vol.8, 2016.

N. Keskes, Image analysis techniques for seismic data, SEG Technical Program Expanded Abstract, vol.1, issue.1, p.39, 1982.

I. Kamel and C. Faloutsos, Hilbert r-tree: an improved r-tree using fractals, Proceedings of the 20th International Conference on Very Large Data Bases, p.23, 1994.

D. Knuth, The Art of Computer Programming, p.22, 1997.

G. David, R. Kirkpatrick, and . Seidel, The ultimate planar convex hull algorithm, SIAM Journal on Computing, vol.15, p.49, 1986.

R. U. Lobello, F. Dupont, and F. Denis, Out-of-core adaptive iso-surface extraction from binary volume data, Graphical Models, vol.76, p.14, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01016785

T. Scott, J. M. Leutenegger, M. A. Edgington, and . Lopez, STR: A Simple and Efficient Algorithm for R-tree Packing, p.88, 1997.

J. Li and A. D. Heap, Spatial Interpolation Methods Applied in the Environmental Sciences, Environmental Modeling & Software 53.C (Mar. 2014), p.34

A. Loseille, Unstructured mesh generation and adaptation, Handbook of Numerical Analysis, vol.18, p.73, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01438967

Y. Liu, X. Balakrishnan-prabhakaran, and . Guo, Point-based manifold harmonics, IEEE Transactions on Visualization and Computer Graphics, vol.18, p.34, 2012.

M. Levoy and T. Whitted, University of North Carolina at Chapel Hill, Computer Science Department, p.17, 1985.

A. Maglo, 3D mesh compression: survey, comparisons, and emerging trends, ACM Computation Survey, vol.47, p.17, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01174418

D. Meagher, Octree Encoding: A New Technique for the Representation, Manipulation and Display of Arbitrary 3-D Objects by Computer (Technical Report), p.22, 1980.

J. Myllymaki and J. H. Kaufman, DynaMark: a benchmark for dynamic spatial indexing, p.25, 2003.

A. Lukasz, T. Machowski, and . Marwala, Using images to create a hierarchical grid spatial index, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, p.22, 2006.

. Morton, A computer oriented geodetic data base and a new technique in file sequencing, p.86, 1966.

M. Natali, Modeling terrains and subsurface geology, EuroGraphics 2013 State of the Art Reports (STARs, p.12, 2013.

R. Novelline, Squire's Fundamentals of Radiology, p.19, 1997.

R. Beng-chin-ooi, J. Sacks-davis, and . Han, Indexing in Spatial Databases, p.22

N. Pant, Performance Comparison of Spatial Indexing Structures for Different Query Types, p.22, 2016.

A. Peytavie, Arches: a framework for modeling complex terrains, Computer Graphics Forum, vol.28, p.18, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01250530

G. Passalis, A. Ioannis, T. Kakadiaris, and . Theoharis, Efficient hardware voxelization, Proceedings of Computer Graphics International, p.20, 2004.
DOI : 10.1109/cgi.2004.1309236

, Numerical Recipes : the Art of Scientific Computing, p.34, 2007.

W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, vol.33, p.22, 1990.
DOI : 10.1007/3-540-51542-9_36
URL : http://www.cs.uiowa.edu/~ghosh/skip.pdf

A. Robinson and C. Cherry, Results of a prototype television bandwidth compression scheme, Proceedings of the IEEE, vol.55, p.86, 1967.

, Deploying Renewables 2011: Best and Future Policy Practice, vol.8, 2011.

S. Rusinkiewicz and M. Levoy, QSplat: A multiresolution point rendering system for large meshes, Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, p.17, 2000.

S. Ray, B. Simion, and A. D. Brown, Jackpine: a benchmark to evaluate spatial database performance, Proceedings of the IEEE 27th International Conference on Data Engineering, p.25, 2011.

P. Rigaux, M. Scholl, and A. Voisard, , p.22, 2001.

J. C. Russ, The Image Processing Handbook, p.50, 1998.

. Maruto-masserie-sardadi, Choosing R-tree or Quadtree Spatial Data Indexing in One Oracle Spatial Database System to Make Faster Showing Geographical Map in Mobile Geographical Information System Technology, International Journal of Science, Engineering and Information Technology, vol.2, issue.10, p.25, 2008.

R. Sawhney and K. Crane, Boundary first flattening, ACM Transactions on Graphics, vol.37, p.63, 2017.
DOI : 10.1145/3132705
URL : http://arxiv.org/pdf/1704.06873

H. Schobert, Chemistry of Fossil Fuels and Biofuels, 2013.

, Training Research Division. Study for applying computer-generated images to visual simulation. Air Force Human Resources Laboratory, Air Force Systems Command, p.22, 1969.

D. Shepard, A two-dimensional interpolation function for irregularlyspaced data, Proceedings of the 23rd ACM National Conference, p.34, 1968.

A. Sitek, R. Huesman, and G. Gullberg, Tomographic reconstruction using an adaptive tetrahedral mesh defined by a point cloud, p.17, 2006.

D. J. Sorin, M. D. Hill, and D. A. Wood, A Primer on Memory Consistency and Cache Coherence. 1st, p.88, 2011.

M. Silberberg, Chemistry : the Molecular Nature of Matter and Change, vol.4, 2006.

R. Smelik, A survey of procedural methods for terrain modeling, p.18, 2009.

S. Amir-arsalan, Synthesizing 3D shapes via modeling multi-view depth maps and silhouettes with deep generative networks, IEEE Conference on Computer Vision and Pattern Recognition (CVPR, p.17, 2017.

Y. Solihin, Fundamentals of Parallel Multicore Architecture. 1st. Chapman & Hall/CRC, 2015 (cit, p.82

T. Sellis, N. Roussopoulos, and C. Faloutsos, The r+-tree: a dynamic index for multi-dimensional objects, Proceedings of the 20th International Conference on Very Large Data Bases, p.23, 1987.

B. Sadri and K. Singh, Flow-complex-based shape reconstruction from 3D curves, ACM Transaction on Graphics, vol.33, p.34, 2014.

A. Lira-dos-santos, V. Teichrieb, and J. Lindoso, Review and comparative study of ray traversal algorithms on a modern GPU architecture, Proceedings of the World Society for Computer Graphics, p.20, 2014.

W. H. Smith and P. Wessel, Gridding with continuous curvature splines in tension, Geophysics 55, p.35, 1990.

E. Treister and E. Haber, A fast marching algorithm for the factored eikonal equation, Journal of Computational Physics, vol.324, pp.210-225, 2016.

C. William, B. F. Thibault, and . Naylor, Set operations on polyhedra using binary space partitioning trees, SIGGRAPH Computer Graphics, vol.21, p.22, 1987.

R. Triebel, P. Pfaff, and W. Burgard, Multi-level surface maps for outdoor terrain mapping and loop closing, IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.2276-2282, 2006.

N. Thrane, L. O. Simonsen, and A. Peter-Ørbaek, A Comparison of Acceleration Structures for GPU Assisted Ray Tracing, p.20, 2005.

W. Thomas-tutte, How to draw a graph, Proceedings of the London Mathematical Society, pp.743-767, 1960.

J. K. Uhlmann, Satisfying general proximity/similarity queries with metric trees, Information Processing Letters, vol.40, p.23, 1991.
DOI : 10.1016/0020-0190(91)90074-r

C. Voglis and I. Lagaris, BOXCQP: an algorithm for bound constrained convex quadratic problems, First International Conference "From Scientific Computing to Computational Engineering, p.70, 2004.

T. Várady, A. Rockwood, and P. Salvi, Transfinite surface interpolation over irregular n-sided domains, Computer-Aided Geometric Design, vol.43, p.34, 2011.

E. L. Wachspress, A Rational Finite Element Basis, p.68, 1975.

E. Walter, Numerical Methods and Optimization, a Consumer Guide, p.37, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01277196

X. Wu, S. Fomel, and M. Hudec, Fast salt boundary interpretation with optimal path picking, Geophysics 83, vol.3, p.14, 2018.

S. Yoshizawa, A. Belyaev, and H. Seidel, A fast and simple stretch-minimizing mesh parameterization, Proceedings of the Shape Modeling International, p.73, 2004.

N. Peter and . Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, p.23, 1993.

X. Zhang and Z. Du, Spatial indexing, The Geographic Information Science and Technology Body of Knowledge, p.20, 2017.

A. Dean and . Zimmerman, A comparison of seven geostatistically based inverse approaches to estimate transmissivities for modeling advective transport by groundwater flow, Water Resources Research, vol.34, p.34, 1998.

M. Zou, T. Ju, and N. Carr, An algorithm for triangulating multiple 3D polygons, Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing, p.34, 2013.

M. Zou, Topology-constrained surface reconstruction from crosssections, ACM Transactions on Graphics, vol.34, issue.10, p.34, 2015.

T. Zäschke, C. Zimmerli, and M. C. Norrie, The ph-tree: a space-efficient storage structure and multi-dimensional index, Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, p.22, 2014.

, UnétatUnétat de l'art des modèles de données et un programme de comparaison automatique montrent ainsi comment les systèmes de patch et les surfaces triangulées sont les plus adaptés pour représenter les horizons avec failles inverses et les dômes de sel, respectivement. Dans un second temps, il faut pouvoir reconstruire les surfaces de ces horizons multivaluésmultivaluésà partir de données d'interprétation, qui sontàsontà la fois peu denses et non-uniformément distribuées. Nous proposons deux algorithmes de reconstruction, un pour chaque type d'horizon. Ces méthodes sont basées sur les approches classiques en géoscience, et forment donc une extension naturelle de l'´ etat de l'art. Avec ces modèles et leurs méthodes de reconstruction, Résumé -Les horizons sont desélémentsdeséléments indispensablesàindispensablesà la création d'un modèle structural pour l'exploration d'hydrocarbures

, Mots clés : Horizons Multivalués, Modèle de Données, Indexation Spatiale, Structure d'Accélération

, Handling those so-called "multivalued" horizons indeed requires tackling two problems. First, data models must be found to represent them. A review of the state of the art, complemented by a benchmark, led us to promote the use of patch systems and triangulated surfaces in order to represent reverse-faulted horizons and salt domes, respectively. Second, multivalued surfaces must be reconstructed from sparse and non-uniformly distributed interpretation data. We developed two reconstruction methods, each targeting a multivalued horizon type. They are based on standard geoscience interpolation methods, making them both fast and natural extensions of the state of the art. Using the proposed models along with the reconstruction methods, Abstract -Horizons are first-class elements of the structural models used for Oil & Gas exploration

. Gipsa-lab, 11 rue des Mathématiques