Scott McElfresh's professional information page

Teaching Research Affiliations



Some of the courses I have taught.

Carnegie Mellon (2001- present)
  • Introduction to Programming.  
    • Course for people who have little or no programming experience.   Taught to students from any major on campus.  Currently taught in Java.
  • Introduction to Data Structures
    • Basic data structures (stacks, queues, linked lists, binary trees, lists, sets, maps).  Currently taught in Java.
  • Freshman Immigration Course I and II
    • A course to introduce cs majors to computer science as a field and some of the projects at Carnegie Mellon.   Co-taught with Rich Pattis or Jacobo Carrasquel.
  • Fundamental Data Structures and Algorithms
    • Sophomore core course that teaches students details of mathematical algorithm analysis and core algorithms from the field, such as graph theory, binary search tree balancing, heaps, priority queues, compression, and game tree searching.  Co taught with Danny Sleator, Klaus Sutner, and Margaret Reid-Miller.
  • Technology Consulting in the Community.
    • A course that engages students in a project with a non-profit client in the community.  Students are engaged in intellectual inquiry and communication throughout the course in a rigrorous environment.    Program run with Joe Mertz.
    • Program web site.
    • "Teaching Communication, Leadership, and the Social Context of Computing via a Consulting Course", Joe Mertz and Scott McElfresh, Proceedings of the SIGCSE Technical Symposium.. Digital library.
  • SAMS - CS.
    • A summer program for high school students, the Summer Academy for Math and Science.  From 2002-2004, I worked with Ananda Gunawardena and Neema Moraveji  on computer science projects with  students in this program.

Muhlenberg College  (1998-2001) 
Statistical Methods, Topics in Mathematics, Computer Science I, Computer Science II, Introduction to Computers, Data Structures, Theory of Programming Languages.

St Lawrence University   (1995-1998)
Concepts of Computation, Introduction to Computer Programming, Introduction to Computer Science, Data Structures, Object-Oriented Programming, Programming Languages, Algorithm Analysis.

Dartmouth College (1994)
Introduction to Computer Science (Honors)



I received my PhD in Computer Science from Dartmouth College's Department of Computer Science in June 2002.
My thesis:  Locally Minimal Triangulations
Advisor:  Robert L. "Scot" Drysdale


  • "A Triangle-based LMT-Skeleton of the Minimum Weight Triangulation", Scott McElfresh (in preparation).
  • "On Exclusion Regions for Optimal Triangulations", Scot Drysdale, Scott McElfresh, Jack Scott Snoeyink.  Discrete Applied Mathematics 109 (2001) 49--65. [Preliminary version at CG98, 14th European Workshop on Computational Geometry.]
  • "Fast Greedy Triangulation Algorithms", Matt Dickerson, Scot Drysdale, Scott McElfresh, Emo Welzl. Computational Geometry: Theory and Applications, 8 (1997) 67--86.  [Preliminary version at SoCG94, ACM Symposium on Computational Geometry.]
  • "New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics", Matt Dickerson, Scott McElfresh, Mark Montague. Proceedings of the 11th Annual Symposium on Computational Geometry (1995) 238--247.

Some recent work in computational geometry includes:

Examination of the properties of Locally Optimal Triangulations.
Empirical examination of various skeletons for the MWT.
Theoretical work on pre-tests for inclusion or exclusion from the MWT or LOTs.



This page updated on March 25, 2010.