A subdivision algorithm for smooth 3D terrain models

Current terrain modelling algorithms are not capable of reconstructing 3D surfaces, but are restricted to so-called 2.5D surfaces: for one planimetric position only one height may exist. The objective of this paper is to extend terrain relief modelling to 3D. In a 3D terrain model overhangs and caves, cliffs and tunnels will be presented correctly. Random measurement errors, limitations in data sampling and the requirement for a smooth surface rule out a triangulation of the original measurements as the final terrain model. A new algorithm, starting from a triangular mesh in 3D and following the subdivision paradigm will be presented. It is a stepwise refinement of a polygonal mesh, in which the location of the vertices on the next level is computed from the vertices on the current level. This yields a series of triangulated terrain surfaces with increasing point density and smaller angles between adjacent triangles, converging to a smooth surface. With the proposed algorithm, the special requirements in terrain modelling, e.g. breaklines can be considered. The refinement process can be stopped as soon as a resolution suitable for a specific application is obtained. Examples of an overhang, a bridge which is modelled as part of the terrain surface and for a 2.5D terrain surface are presented. The implications of extending modelling to 3D are discussed for typical terrain model applications.

[1]  Tom Lyche,et al.  Mathematical methods in computer aided geometric design , 1989 .

[2]  P. Schröder.  Subdivision as a fundamental building block of digital geometry processing algorithms , 2002 .

[3]  Tony DeRose,et al.  An approximately G 1 cubic surface interpolant , 1992 .

[4]  Nasser Khalili,et al.  Curvature Computation on Free-Form 3-D Meshes at Multiple Scales , 2001, Comput. Vis. Image Underst..

[5]  Tamal K. Dey,et al.  Delaunay based shape reconstruction from large data , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[6]  Albrecht Preusser.  Algorithm 684: C1- and C2-interplation on triangles with quintic and nonic bivariate polynomials , 1990, TOMS.

[7]  Ashish Amresh,et al.  Adaptive Subdivision Schemes for Triangular Meshes , 2003 .

[8]  Hartmut Prautzsch,et al.  Fan Clouds - An Alternative to Meshes , 2002, Theoretical Foundations of Computer Vision.

[9]  Tony DeRose,et al.  8. A Survey of Parametric Scattered Data Fitting Using Triangular Interpolants , 1992, Curve and Surface Design.

[10]  Karl Kraus,et al.  Photogrammetrie, Band 3, Topographische Informationssysteme , 2000 .

[11]  P.J.M. van Oosterom,et al.  The STIN Method: 3D-surface reconstruction by observation lines and Delaunay TENs , 2003 .

[12]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[13]  Peter Schröder,et al.  Interpolating Subdivision for meshes with arbitrary topology , 1996, SIGGRAPH.

[14]  Nira Dyn,et al.  A 4-point interpolatory subdivision scheme for curve design , 1987, Comput. Aided Geom. Des..

[15]  Hans Hagen,et al.  Curve and Surface Design , 1992 .

[16]  Martin Reimers,et al.  Meshless parameterization and surface reconstruction , 2001, Comput. Aided Geom. Des..

[17]  Géza Kós.  An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds , 1999, Geometric Modelling.

[18]  Stefanie Hahmann,et al.  Polynomial Surfaces Interpolating Arbitrary Triangulations , 2003, IEEE Trans. Vis. Comput. Graph..

[19]  Heinrich Müller,et al.  Interpolation and Approximation of Surfaces from Three-Dimensional Scattered Data Points , 1997, Scientific Visualization Conference (dagstuhl '97).

[20]  Erik W. Grafarend,et al.  Erstellung eines digitalen Höhenmodells (DHM) mit Dreiecks-Bezier-Flächen , 2002 .