Optimal construction and visualisation of geological structures

被引:21
作者
Xu, C [1 ]
Dowd, PA [1 ]
机构
[1] Univ Leeds, Dept Min & Minerals Engn, Sch Proc Environm & Mat Engn, Leeds LS2 9JT, W Yorkshire, England
关键词
Dijkstra's algorithm; orebody modelling; geological structures; volume rendering; surface rendering; visualisation;
D O I
10.1016/S0098-3004(03)00026-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The authors propose an optimal solution to the problem of generating three-dimensional (3D) geological structures from sectional contours, which, in turn, are generated from sparse information irregularly located in the 3D space. The problem is to construct a 3D orebody, or a topographical surface, from a few planar feature contours defined on a certain number of cross-sections, or more generally any sectional planes, intersecting the unknown structure. The planar contours on the sections are assumed to be simple, closed, concave or convex, polygons for orebodies or polylines for topographical surfaces. The problem is reduced to constructing a sequence of partial approximations, each of which connects two planar contours on two adjacent planes. In the method described here the authors use triangular tiles to construct orebody and, topography surfaces and describe an adaptation of the graph theory approach. The authors extend the original algorithms to the more general cases of multiple open and closed curves on sections and to non-parallel sections and non-planar applications (arbitrary 3D contours). Automatic generation of orebody shapes by volume rendering is also presented and compared to the optimal solution generated by the surface-based rendering technique. In a more general context, the algorithm can be used for optimal surface construction between any two arbitrary contours (either planar or non-planar). The C+ + computer code for the implementation of the algorithms is described and is available from the IAMG server. (C) 2003 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:761 / 773
页数:13
相关论文
共 18 条
[1]  
[Anonymous], 2004, COMPUTER GRAPHICS OP
[2]   SURFACE AND VOLUME RENDERING TECHNIQUES TO DISPLAY 3-D DATA [J].
BARILLOT, C .
IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE, 1993, 12 (01) :111-119
[3]   SHAPE RECONSTRUCTION FROM PLANAR CROSS-SECTIONS [J].
BOISSONNAT, JD .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 44 (01) :1-29
[4]  
Dijkstra E.W., 1959, Numerische mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[5]   Volume rendering [J].
Drebin, Robert A. ;
Carpenter, Loren ;
Hanrahan, Pat .
Computer Graphics (ACM), 1988, 22 (04) :65-74
[6]   OPTIMAL SURFACE RECONSTRUCTION FROM PLANAR CONTOURS [J].
FUCHS, H ;
KEDEM, ZM ;
USELTON, SP .
COMMUNICATIONS OF THE ACM, 1977, 20 (10) :693-702
[7]  
Gibbons A., 1985, ALGORITHMIC GRAPH TH
[8]   APPROXIMATING COMPLEX SURFACES BY TRIANGULATION OF CONTOUR LINES [J].
KEPPEL, E .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1975, 19 (01) :2-11
[9]  
Lorensen W. E., 1987, COMPUT GRAPH, V21, P163, DOI DOI 10.1145/37402.37422
[10]  
PARK JS, 1996, THESIS U LEEDS