License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2017.48
URN: urn:nbn:de:0030-drops-72204
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7220/
Go to the corresponding LIPIcs Volume Portal


Kleinhans, Maarten ; van Kreveld, Marc ; Ophelders, Tim ; Sonke, Willem ; Speckmann, Bettina ; Verbeek, Kevin

Computing Representative Networks for Braided Rivers

pdf-format:
LIPIcs-SoCG-2017-48.pdf (5 MB)


Abstract

Drainage networks on terrains have been studied extensively from an algorithmic perspective. However, in drainage networks water flow cannot bifurcate and hence they do not model braided rivers (multiple channels which split and join, separated by sediment bars). We initiate the algorithmic study of braided rivers by employing the descending quasi Morse-Smale complex on the river bed (a polyhedral terrain), and extending it with a certain ordering of bars from the one river bank to the other. This allows us to compute a graph that models a representative channel network, consisting of lowest paths. To ensure that channels in this network are sufficiently different we define a sand function that represents the volume of sediment separating them. We show that in general the problem of computing a maximum network of non-crossing channels which are delta-different from each other (as measured by the sand function) is NP-hard. However, using our ordering between the river banks, we can compute a maximum delta-different network that respects this order in polynomial time. We implemented our approach and applied it to simulated and real-world braided rivers.

BibTeX - Entry

@InProceedings{kleinhans_et_al:LIPIcs:2017:7220,
  author =	{Maarten Kleinhans and Marc van Kreveld and Tim Ophelders and Willem Sonke and Bettina Speckmann and Kevin Verbeek},
  title =	{{Computing Representative Networks for Braided Rivers}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{48:1--48:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Boris Aronov and Matthew J. Katz},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7220},
  URN =		{urn:nbn:de:0030-drops-72204},
  doi =		{10.4230/LIPIcs.SoCG.2017.48},
  annote =	{Keywords: braided rivers, Morse-Smale complex, persistence, network extraction, polyhedral terrain}
}

Keywords: braided rivers, Morse-Smale complex, persistence, network extraction, polyhedral terrain
Seminar: 33rd International Symposium on Computational Geometry (SoCG 2017)
Issue Date: 2017
Date of publication: 08.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI