Drainage reality in terrains with higher-order Delaunay triangulations

  • Ahmad Biniaz
  • Gholamhossein Dastghaibyfard
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)


Terrains are often modeled by triangulations, which ideally should have ‘nice shape’ triangles and reality of drainage in terrains (few local minima and drainage lines in the bottoms of valleys). Delaunay triangulation is a good way to formalize nice shape, and if higher-order Delaunay triangulations are used, drainage reality can be achieved. Two heuristics are presented, one for reducing the number of local minima and one for reducing the number of valley edges and components. The empirical results show how well they perform on real-world data; on average we see a 16% improvement over known algorithms.


Local Minimum Steep Descent Delaunay Triangulation Drainage Network Drainage Line 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. R. Shewchuk, Lecture notes on Delaunay mesh generation, University of California at Berkeley, (1999).Google Scholar
  2. [2]
    Kreveld M van, GOGO project homepage.
  3. [3]
    Gudmundsson J, Hammar M, Kreveld M van (2002) Higher order Delaunay triangulations. Computational Geometry: Theory and Applications 23:85–98Google Scholar
  4. [4]
    Gudmundsson J, Haverkort H, Kreveld M van (2005) Constrained higher order Delaunay triangulations. Computational Geometry: Theory and Applications 30:271–277Google Scholar
  5. [5]
    Kok T de, Kreveld M van, Löffler M (2007) Generating realistic terrains with higher-order Delaunay triangulations. Computational Geometry: Theory and Applications 36:52–67Google Scholar
  6. [6]
    Yu S, Kreveld M van, Snoeyink J (1997) Drainage queries in TINs: from local to global and back again. In: Kraak MJ, Molenaar M (eds) Advances in GIS research II: Proc. of the 7th Int. Symp. on Spatial Data Handling, pp. 829–842Google Scholar
  7. [7]
    Chew LP (1989) Constrained Delaunay triangulations. Algorithmica 4:97–108CrossRefGoogle Scholar
  8. [8]
    Berg M de, Bose P, Dobrint K, Kreveld M van, Overmars M, Groot M de, Roos R, Snoeyink J, Yu S (1996) The complexity of rivers in triangulated terrains. In: Proc. 8th Canad. Conf. Comput. Geom. 325–330Google Scholar
  9. [9]
    McAllister M, Snoeyink J (1999) Extracting consistent watersheds from digital river and elevation data. In: Proc. ASPRS/ACSM Annu. Conf.Google Scholar
  10. [10]
    Ramos EA (1999) On range reporting, ray shooting and k-level construction. In: Proc. 15th Annu. ACM Symp. on Computational Geometry, 390–399Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ahmad Biniaz
    • 1
  • Gholamhossein Dastghaibyfard
    • 1
  1. 1.Department of Computer Science and EngineeringShiraz UniversityShirazIran

Personalised recommendations