Abstract. A terrain M can be represented as a triangulation of the plane along with a height function associated with the vertices (and linearly ...
scholar.google.com › citations
We present an I/O-efficient data structure of linear size that answers a contour query in O(logB N + T/B) I/Os, where N is the number of triangles in the ...
We present an I/O-efficient data structure of linear size that can be used to answer a contour query in O(logB N + T/B) I/Os, where T is the number of triangles ...
Jan 23, 2011 · We present an I/O-efficient data structure of linear size that answers a contour query in O(logB N + T/B) I/Os, where N is the number of ...
The algorithm uses O(N/B) disk blocks. Each contour is generated individually with its composing segments sorted in clockwise or counterclockwise order.
An I/O-optimal algorithm is presented that reports all contours of M at heights '1;:::;'s using O(sort(N) + T=B) I/Os, where T is the total number edges in ...
These scalability problems are mainly due to the fact that most GIS algorithms have been designed to minimize internal computation time, while I/O communication.
In this paper, we study two terrain-analysis problems that benefit from a union-find data structure: (i) computing topological persistence and (ii) constructing ...
The algorithm uses O(N/B) disk blocks. Each contour is generated individually with its composing segments sorted in clockwise or counterclockwise order.
We develop I/O-efficient algorithms for the problem and use them to develop I/O-efficient topological persistence and contour tree algorithms. Related ...