William Harvey, Ph.D.

Consulting Software Engineer

William Harvey, Ph.D.

William Harvey is a Consulting Software Engineer at OCLC Research as of 2015.  He received his Ph.D. and M.S. in Computer Science from The Ohio State University in 2012, where he studied analysis and visualization of high-dimensional data using Morse theory and other topological approaches.  Prior to graduate school, William was a research scientist at Pacific Northwest National Laboratory where he worked primarily on computer vision and machine learning problems. William graduated from the University of Washington in 2004 with a B.S. in Computer Science and a B.A. in Russian Language and Literature.  With more than 13 years of professional experience in software engineering and an extensive mathematics and advanced computer science background, William continues to enjoy the wealth of challenges and beautiful insights that reside at the intersection of these areas (e.g., homotopy type theory).

Currently, William is working with Lynn Silipigni Connaway on the Visitors and Residents project.  He is also working with Ixchel Faniel on the DIPIR project, where he analyzes and creates visualizations of clickstream data to better understand the role of contextual information in facilitating data reuse, creation, and preservation.

William is a member of the Free Software Foundation.

Selected Publications:

A Collaborative Visual Analytics Suite for Protein Folding Research.  William Harvey, In-Hee Park, Oliver Rübel, Valerio Pascucci, Peer-Timo Bremer, Chenglong Li, and Yusu Wang. Journal of Molecular Graphics and Modelling, Volume 53, September 2014, pages 59-71.

Enhanced Topology-Sensitive Clustering by Reeb Graph Shattering.  William Harvey, Oliver Rübel, Valerio Pascucci, Peer-Timo Bremer, and Yusu Wang. TopoInVis 2011.

Generating and Exploring a Collection of Topological Landscapes for Visualization of Scalar-Valued Functions.  William Harvey and Yusu Wang. Computer Graphics Forum (EuroVis) 2010. 3rd Best Paper Award.

A Randomized O(m log m) Time Algorithm for Computing Reeb Graphs of Arbitrary Simplicial Complexes.  William Harvey, Yusu Wang, and Rephael Wenger. ACM Symposium on Computational Geometry (SOCG) 2010.

Contact William


O: +1-614-761-6180