Optimization of polyhedral terrains

A digital terrain model is a representation of a real-world terrain in a computer. Terrain models play an important role in geographic information systems, where they are used for numerous purposes. For example, a terrain model can be used to simulate rainfall and to predict terrain areas that are prone to flooding. Or it can help to locate the best spot where to place a fire lookout tower in a wilderness area, such that the terrain area visible from the tower is as large as possible. One of the main ways to represent a terrain is by a triangulation: some points are sampled from the real terrain, and they are connected by triangles that cover the whole terrain area. This results in a subdivision into triangles. It is well-known that when triangulations are used for terrain modeling, there are several geometric aspects of the triangulation that have an important effect. In particular, it is an established fact that long and skinny triangles should be avoided. Moreover, for terrain modeling one cannot ignore that every point has an elevation, thus there are other requirements the triangulation must fulfill in order to provide a reasonable model for a terrain. For example, terrains formed by natural processes have few depressions. Depending on the triangulation chosen, the number of resulting depressions can be excessively high. If the terrain is meant to be used for hydrologic simulations (such as rainfall simulation), these spurious pits will cause serious disruptions in the water flow, rendering the model useless. In this case, depressions are an example of artifacts of the triangulation that should be avoided. This thesis presents new automated methods to improve terrain models, by finding triangulations with well-shaped triangles and---at the same time---as few artifacts as possible. The methods proposed can produce a more accurate and reliable representation of terrains.

[1]  Pankaj K. Agarwal,et al.  I/O-efficient batched union-find and its applications to terrain analysis , 2006, SCG '06.

[2]  Henk J. Scholten,et al.  An Introduction to Geographical Information Systems , 1995 .

[3]  P. Burrough,et al.  Principles of geographical information systems , 1998 .

[4]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

[5]  Bernard Chazelle Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[6]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[7]  Dara Entekhabi,et al.  Generation of triangulated irregular networks based on hydrological similarity , 2004 .

[8]  Micha Sharir,et al.  Random triangulations of planar point sets , 2006, SCG '06.

[9]  J. Lindsay,et al.  Removal of artifact depressions from digital elevation models: towards a minimum impact approach , 2005 .

[10]  Tiow Seng Tan,et al.  A quadratic time algorithm for the minmax length triangulation , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[12]  Goos Kant,et al.  Augmenting Outerplanar Graphs , 1996, J. Algorithms.

[13]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.

[14]  Mark de Berg,et al.  Trekking in the Alps Without Freezing or Getting Tired , 1993, ESA.

[15]  Valerio Pascucci,et al.  Contour Trees and Small Seed Sets for Isosurface Generation , 2006 .

[16]  A. Veldkamp,et al.  Algorithm for dealing with depressions in dynamic landscape evolution models , 2006, Comput. Geosci..

[17]  Joseph S. B. Mitchell,et al.  Visibility preserving terrain simplification: an experimental study , 2002, SCG '02.

[18]  Marco Pilotti,et al.  IDENTIFICATION AND ANALYSIS OF NATURAL CHANNEL NETWORKS FROM DIGITAL ELEVATION MODELS , 1996 .

[19]  Peter Gilbert New Results on Planar Triangulations. , 1979 .

[20]  David Eppstein,et al.  Edge insertion for optimal triangulations , 1993, Discret. Comput. Geom..

[21]  Ferran Hurtado,et al.  On the number of plane graphs , 2006, SODA '06.

[22]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[23]  Albert K. W. Yeung,et al.  Concepts And Techniques Of Geographic Information Systems , 2002 .

[24]  Emo Welzl,et al.  The Number of Triangulations on Planar Point Sets , 2006, GD.

[25]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[26]  Joachim Gudmundsson,et al.  Higher order Delaunay triangulations , 2000, Comput. Geom..

[27]  L. Martz,et al.  An outlet breaching algorithm for the treatment of closed depressions in a raster DEM , 1999 .

[28]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[29]  J. N. Callow,et al.  How does modifying a DEM to reflect known hydrology affect subsequent terrain analysis , 2007 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[32]  Maarten Löffler,et al.  Generating realistic terrains with higher-order Delaunay triangulations , 2005, Comput. Geom..

[33]  Michael F. Goodchild,et al.  GIS and hydrologic modeling. , 1993 .

[34]  Joachim Gudmundsson,et al.  Constrained higher order Delaunay triangulations , 2005, Comput. Geom..

[35]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[36]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[37]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[38]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[39]  Goos Kant,et al.  Triangulating Planar Graphs while Minimizing the Maximum Degree , 1992, Inf. Comput..

[40]  L. Paul Chew,et al.  Constrained Delaunay triangulations , 1987, SCG '87.

[41]  Christopher M. Gold,et al.  Spatially ordered networks and topographic reconstructions , 1987, Int. J. Geogr. Inf. Sci..

[42]  Tiow-Seng Tan,et al.  Optimal two-dimensional triangulations , 1992 .

[43]  Edith Cohen,et al.  Improved algorithms for linear inequalities with two variables per inequality , 1991, STOC '91.

[44]  Bharat K. Soni,et al.  Mesh Generation , 2020, Handbook of Computational Geometry.

[45]  Marian Neamtu,et al.  Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay , 2007 .

[46]  J. Snoeyink,et al.  Extracting Consistent Watersheds From Digital River And Elevation Data , 1999 .

[47]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[48]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[49]  G. Klincsek Minimal Triangulations of Polygonal Domains , 1980 .

[50]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[51]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[52]  Alan Saalfeld,et al.  Conflation Automated map compilation , 1988, Int. J. Geogr. Inf. Sci..

[53]  Tosiyasu L. Kunii,et al.  Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data , 1995, Comput. Graph. Forum.

[54]  E. Nelson,et al.  Algorithm for Precise Drainage-Basin Delineation , 1994 .

[55]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[56]  Tiow Seng Tan,et al.  An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation , 1992, SIAM J. Sci. Comput..

[57]  S. Rippa,et al.  Data Dependent Triangulations for Piecewise Linear Interpolation , 1990 .

[58]  Larry L. Schumaker,et al.  Cubic spline fitting using data dependent triangulations , 1990, Comput. Aided Geom. Des..

[59]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[60]  Alexander Wolff,et al.  Constructing interference-minimal networks , 2005, EuroCG.

[61]  Christian Puech,et al.  Quality assessment for drainage networks and watershed boundaries extraction from a digital elevation model (DEM) , 2000, GIS '00.

[62]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[63]  Rolf Klein,et al.  A Sweepcircle Algorithm for Voronoi Diagrams , 1987, WG.

[64]  Prosenjit Bose,et al.  The Complexity of Rivers in Triangulated Terrains , 1996, CCCG.

[65]  Christian Heipke,et al.  Semantically Correct 2.5D GIS Data - the Integration of a DTM and Topographic Vector Data , 2004, SDH.

[66]  L. De Floriani A pyramidal data structure for triangle-based surface description , 1989, IEEE Computer Graphics and Applications.

[67]  Christopher B. Jones,et al.  Characterisation and generalisation of cartographic lines using Delaunay triangulation , 2002, Int. J. Geogr. Inf. Sci..

[68]  M. Hutchinson A new procedure for gridding elevation and stream line data with automatic removal of spurious pits , 1989 .

[69]  G. Phillips Interpolation and Approximation by Polynomials , 2003 .

[70]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[71]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[72]  Samir Khuller,et al.  Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets , 1998, Inf. Comput..

[73]  Christopher B. Jones,et al.  A Triangulated Spatial Model for Cartographic Generalisation of Areal Objects , 1995, COSIT.

[74]  M. Filipiak Mesh Generation , 2007 .

[75]  S. K. Jenson,et al.  Extracting topographic structure from digital elevation data for geographic information-system analysis , 1988 .

[76]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[77]  Christos Levcopoulos,et al.  The greedy triangulation can be computed from the Delaunay triangulation in linear time , 1999, Comput. Geom..

[78]  Jack Snoeyink,et al.  Flooding Triangulated Terrain , 2004, SDH.

[79]  DEM Based Multi-Directional Flow Path Mapping Using the Raft Method , 2005 .

[80]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[81]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

[82]  J. Mark Keil,et al.  Algorithms for optimal area triangulations of a convex polygon , 2006, Comput. Geom..

[83]  Jack Snoeyink,et al.  Computing contour trees in all dimensions , 2000, SODA '00.

[84]  Helmuth Späth,et al.  Two-dimensional spline interpolation algorithms , 1993 .

[85]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[86]  James J. Little,et al.  Automatic extraction of Irregular Network digital terrain models , 1979, SIGGRAPH.

[87]  Lori Scarlatos,et al.  Hierarchical triangulation using terrain features , 1990, Proceedings of the First IEEE Conference on Visualization: Visualization `90.

[88]  Ashraf El-Hamalawi,et al.  Mesh Generation – Application to Finite Elements , 2001 .

[89]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[90]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[91]  Oleg R. Musin Properties of the Delaunay triangulation , 1997, SCG '97.

[92]  Nimrod Megiddo,et al.  Towards a Genuinely Polynomial Algorithm for Linear Programming , 1983, SIAM J. Comput..

[93]  Qing Zhu,et al.  An efficient depression processing algorithm for hydrologic analysis , 2006, Comput. Geosci..

[94]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[95]  W. Rieger A phenomenon‐based approach to upslope contributing area and depressions in DEMs , 1998 .