Office Hours:

Mon 1:00 - 2:00

Thurs 1:30 - 2:30


My Calendar

My Complete CV


Doug Baldwin

Professor Of


South 307
1 College Circle
Geneseo, NY 14454

Doug Baldwin

Professor Baldwin has been a member of the Geneseo faculty since 1990. Originally holding a position in computer science, he joined the mathematics department in 2013.

Faculty Information


  • B.Sc., 1980, Yale University
  • M.Sc., 1981, Yale University
  • Ph.D., 1985, Yale University

Research Interests

My main research interests are in computer graphics, particularly procedural modelling of natural objects (e.g., terrains, plants, etc.) I am currently beginning a project aimed at studying what if any mathematical and algorithmic models can describe crystal aggregates in computer graphics. I also recently completed IViPP, a scientific visualization project in particle physics. Other interests include the role of mathematics in computer science, and programming languages and methods.

Publications and Professional Activities


Fall 2015 Classes

MATH 223:
Calculus III

    View course details / syllabus
    Vector calculus, functions of several variables, partial derivatives, multiple integrals, space analytic geometry, and line integrals. Prerequisites: MATH 222. Offered every semester

MATH 230:

    View course details / syllabus
    This course serves as an introductory programming course for Mathematics majors. Basic programming techniques for solving problems typically encountered by mathematicians will be developed. The cour
    se covers basic procedural techniques such as algorithms, variables, input/output, data types, selection, iteration, functions and graphing. Good programming and commenting practices will be emphasized. The programming language for the course will be a mathematical programming language such as Matlab. Restricted to Math majors only. Corequisite/Prequisite: MATH 222. Offered every semester
Read more.

MATH 303:
TheoryComputational Complexity

    View course details / syllabus
    A survey of the mathematical analysis of the time and space resources required to execute algorithms. Starting with the asymptotic analysis of resource needs of specific algorithms, the course builds
    to a study of lower bounds associated with problems, and culminates in an in-depth study of abstract resource-complexity classes such as P, NP, and PSPACE. Prerequisites: MATH 239. Not offered on a regular basis.
Read more.