Top Message
Top Message
Back to Home Page  |  Settings   |  Sign In
Web Education
Viewing 1-1 of 1 total results
 I/O-Efficient Algorithms for Computing Contours on a Terrain
called contour tree [9] encodes a \seed" for each contour of K. Many e cient internal-memory algorithms are known for computing a contour tree; see e.g. [9]. Hence, one can e ciently construct a contour map of K. This approach of tracing a contour has been extended to higher dimensions as well, e.g., the well-known marching-cube algorithm for...