The Complexity of Rivers in Triangulated Terrains
نویسندگان
چکیده
Triangulated surfaces are often used to represent terrains in Geographic Information Systems (GIS); one of the primary computations on terrains is determining drainage networks. Under natural deenitions of the ow of water on a terrain represented by n triangles, we show that the river network has (n 3) worst-case complexity, where complexity is measured in the number of line segments that make up the network.
منابع مشابه
Flood hazard zoning using geographic information system (GIS) and HEC-RAS model (Case study: Rasht City)
Rivers are important water resources for human life, but sometimes cause irreparable damages. The flood plains are fertile terrains which are endangered by flood. Flood hazard mapping is one of the basic methods in flood fighting. In order to decline flood damages, the simulation of the hydraulic behavior of the rivers during flood occurrence is very important. In this study, areas that are flo...
متن کاملRiver networks and watershed maps of triangulated terrains revisited ∗
Triangulated surfaces are often used to represent terrains in geographic information systems. We investigate the complexity of river networks and watershed maps on such terrains under the assumption that water always follows the path of steepest descent. We show that the worst-case complexity is only Θ(n) if all triangles are non-obtuse or if all triangles are fat, that is, their minimum angles...
متن کاملThe complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in triangulations i/o-efficiently. We use the descent graph to obtain i/o-efficient algorithms for computing river networks and watershed-area maps in O(Sort(d + r)) i/o’s, where r is the complexity of the river network a...
متن کاملI/O-Efficient Flow Modeling on Fat Terrains
We study the flow of water on fat terrains, that is, triangulated terrains where the minimum angle of any triangle is bounded from below by a positive constant. We show that the worstcase complexity of any path of steepest descent on a fat terrain of n triangles is Θ(n), and that the worst-case complexity of the river network on such terrains is Θ(n). This improves the corresponding bounds for ...
متن کاملFast Polygonal Approximation of Terrains and Height Fields
Several algorithms for approximating terrains and other height fields using polygonal meshes are described, compared, and optimized. These algorithms take a height field as input, typically a rectangular grid of elevation data H(x, y), and approximate it with a mesh of triangles, also known as a triangulated irregular network, or TIN. The algorithms attempt to minimize both the error and the nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996