The reconstruction and simplification techniques of meshes are a major focus of research in 3D computer graphics due to the increasing size and complexity of geometric data. Especially in the 3D geological modeling, this is a formidable challenge for modeling and for rendering on displays of limited resolution, limited dynamic range and limited technologies of the hardware and software. The geological modeling and model management is perhaps the biggest part of the challenge.Over the past several years, a multitude of simplification techniques have been developed, focusing on various problem domains. In particular, most relevant work has been focused on two distinct types of geometric data: polygonal meshes and polyhedral meshes. However, comparatively little effort has been directed towards algorithmic techniques that can successfully simplify all such data in 3D geological modeling.In this paper, we present a new mesh simplification framework, based on the "simplex collapse", which can produce approximations of simplicial complexes of any type of meshes embedded in 3D Euclidean spaces, such as triangular meshes, quadrangular meshes, tetrahedral meshes, hexahedral meshes, and mixed complexes. It has higher decimations ratio than the "edge collapse"-based methods. We described the general process of the General Mesh Simplification (GMS), and presented the main GMS data structure and operations prototypes. With the different prey rule and reconstruction rules, this framework can reduce the general mesh dataset rapidly and effectively. The GMS algorithm has been applied to the 3D geological modeling. Additionally, this framework can be extended to multi-dimension (＞3) spaces.
展开▼
