Welcome

I'm a visiting assistant professor in computer science at Swarthmore College. I did my PhD studies in computer science at Duke University. I did my undergraduate studies at Gettysburg College in mathematics and physics. I am originally from Southwestern Pennsylvania, so I say "pop", not "soda".

Courses

Spring 2008 CS 97 Senior Conference
Spring 2008 CS 35 Data Structures and Algorithms
Fall 2007 CS 21 Introduction to Computer Science
Fall 2007 CS 35 Data Structures and Algorithms
Spring 2007 CS 21 Algorithmic Problem Solving
Spring 2007 CS 46 Theory of Computation
Fall 2006 CS 41 Algorithms
Fall 2006 CS 97 Senior Conference

Research Summary

My current research interests are in I/O-efficient algorithms (also called out-of-core or external-memory algorithms). On data sets larger than the amount of available internal memory of a computer, the transfer of data between slow hard disks and faster internal memory, not CPU speed, limits computing performance. Working in a theoretical model that mimics this behavior, I am interested in finding efficient ways to solve problems in computational geometry on large data sets. I also look at possible applications in geographic information systems (GIS). The STREAM project page summarizes some recent contributions by my research group to hi-resolution elevation data analysis and modeling. While my emphasis is on theory, I prefer to develop solutions that are practical enough to implement and be applied. One example of a practical project that I work on is TPIE—a templated, portable I/O environment written in C++ that makes it easier for people to develop I/O-efficient applications. I also contribute to the open source GIS community through the GRASS project. My thesis committee members were Pankaj Agarwal, Lars Arge, Helena Mitasova, and Herbert Edelsbrunner.

Publications

A. Danner, T. Mølhave, K. Yi, P. K. Agarwal, L. Arge, and H. Mitasova. TerraStream: From Elevation Data to Watershed Hierarchies. In Proc. ACM Symposium on Advances in Geographic Information Systems, pages 212-219, 2007. [bib | pdf ]

P. K. Agarwal, L. Arge, and A. Danner. From point cloud to grid DEM: A scalable approach. In Andreas Riedl, Wolfgang Kainz, and Gregory Elmes, editors, Progress in Spatial Data Handling. 12th International Symposium on Spatial Data Handling, pages 771-788. Springer-Verlag, 2006. [ bib | pdf ]

L. Arge, A. Danner, H. Haverkort, and N. Zeh. I/O-efficient hierarchical watershed decomposition of grid terrain models. In Andreas Riedl, Wolfgang Kainz, and Gregory Elmes, editors, Progress in Spatial Data Handling. 12th International Symposium on Spatial Data Handling, pages 825-844. Springer-Verlag, 2006. [ bib | pdf ]

A. Danner. I/O Efficient Algorithms and Applications in Geographic Information Systems PhD thesis, Department of Computer Science, Duke University, 2006. [bib | pdf | pdf2 | color_pdf | color_pdf2 ]

L. Arge, A. Danner, H. Haverkort, and N. Zeh. Computing Pfafstetter labellings I/O-efficiently. In Münster University, Dept. of Computer Science, technical report 02/05-I, 2005. [ bib | pdf ]

L. Arge, A. Danner, and S. Teh. I/O-efficient point location using persistent B-trees. The ACM Journal of Experimental Algorithmics, 8, 2003. [ bib | pdf ]

P. K. Agarwal, L. Arge, A. Danner, and B. Holland-Minkley. Cache-oblivious data structures for orthogonal range searching. In Proc. ACM Symposium on Computational Geometry, pages 237-245, 2003. [ bib | pdf ]

L. Arge, A. Danner, and S. Teh. I/O-efficient point location using persistent B-trees. In Proc. Workshop on Algorithm Engineering and Experimentation, 2003. [ bib | pdf ]

Prior Teaching

Theory of Computation (CSC351) Elon University Fall 2005

Intro. to C++ Programming (CPS006) Duke University Summer 2002

Home Page


Last updated: Wednesday, January 16, 2008 at 10:58:22 PM