Learn More
We consider the problem of extracting a river network and a watershed hierarchy from a terrain given as a set of irregularly spaced points. We describe TERRASTREAM, a "pipelined" solution that consists of four main stages: construction of a digital elevation model (DEM), hydrological conditioning, extraction of river networks, and construction of a(More)
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all <i>T</i> points in a set of <i>N</i> points in <i>IR<sup>d</sup></i> lying in a query hyper-rectangle. Cache-oblivious data structures are designed to be efficient in arbitrary memory hierarchies.We describe a dynamic linear-size data structure that answers(More)
We present an external planar point location data structure that is I/O-efficient both in theory and practice.The developed structure uses linear space and answers a query in optimal <i>O</i>(log <i><inf>B</inf>N</i>) I/Os, where <i>B</i> is the disk block size. It is based on a persistent B-tree, and all previously developed such structures assume a total(More)
In line with institutions across the United States, the Computer Science Department at Swarthmore College has faced the challenge of maintaining a demographic composition of students that matches the student body as a whole. To combat this trend, our department has made a concerted effort to revamp our introductory course sequence to both attract and retain(More)
Bare Earth gridded digital elevation models (DEMs) are often used to extract hydrologic features such as rivers and watersheds. DEMs must be conditioned by removing spurious <i>sinks</i> (or depressions) which impede water flow in the model, but are not true hydrologic barriers. This conditioning process is designed to enforce proper drainage and connect(More)
The proliferation of lidar technology in remote sensing has resulted in extremely large, high resolution point clouds covering a wide variety of terrain. Constructing a grid digital elevation model (DEM) from these large data sets requires extensive computational resources and ample disk space. We propose a framework for leveraging modern computing(More)
—We present curricular changes to our undergraduate computer science curriculum for a small liberal arts college. The changes are designed to incorporate parallel and distributed computing topics into all levels of our curriculum, with the goal of ensuring that all graduating CS majors have exposure to and experience with parallel and distributed computing.(More)
  • 1