Andrew DannerAssociate ProfessorComputer Science Swarthmore College Swarthmore, PA 19081 Science Center 247 |
I'm an assistant professor in computer science at Swarthmore College. I am interested in researching ways to process very large geometric data sets that often arise in geographic information systems (GIS). I am originally from Southwestern Pennsylvania, so I say "pop", not "soda".
A. Danner, and T. Newhall. Integrating Parallel and Distributed Computing Topics into an Undergraduate CS Curriculum. In Proc. Workshop on Parallel and Distributed Computing Education (EduPar-13), 2013. [bib | pdf ]
A. Danner, J. Baskin, A. Breslow, and D. Wilikofsky. Hybrid MPI/GPU Interpolation for Grid DEM Construction. In Proc. ACM Symposium on Advances in Geographic Information Systems, pages 299—308, 2012. [bib | pdf ]
R. Carlson and A. Danner. Bridge detection in grid terrains and improved drainage enforcement. In Proc. ACM Symposium on Advances in Geographic Information Systems, pages 250—260, 2010. [bib | pdf ]
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 ]
B.S. Gettysburg College physics and mathematics (1999)