Flow computations on imprecise terrains
Visualitza/Obre
Flow-computations-on-imprecise-terrains.pdf (272,6Kb) (Accés restringit)
10.1007/978-3-642-22300-6_30
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/13873
Tipus de documentText en actes de congrés
Data publicació2011
EditorSpringer Verlag
Condicions d'accésAccés restringit per acord de confidencialitat
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
We study water flow computation on imprecise terrains. We
consider two approaches to modeling flow on a terrain: one where water
flows across the surface of a polyhedral terrain in the direction of steepest
descent, and one where water only flows along the edges of a predefined
graph, for example a grid or a triangulation. In both cases each vertex has
an imprecise elevation, given by an interval of possible values, while its
(x, y)-coordinates are fixed. For the first model, we show that the problem
of deciding whether one vertex may be contained in the watershed of
another is NP-hard. In contrast, for the second model we give a simple
O(n log n) time algorithm to compute the minimal and the maximal
watershed of a vertex, where n is the number of edges of the graph.
On a grid model, we can compute the same in O(n) time.
CitacióDriemel, A. [et al.]. Flow computations on imprecise terrains. A: Algorithms and Data Structures Symposium. "2011 Workshop on Algorithms and Data Structures Symposium (WADS)". Brooklyn: Springer Verlag, 2011, p. 350-361.
ISBN978-3-642-22299-3
Versió de l'editorhttp://cataleg.upc.edu/record=b1390385~S1*cat
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Flow-computations-on-imprecise-terrains.pdf | 272,6Kb | Accés restringit |